Segunda Feira dia 11 de Julho
14h - UFRJ Cidade Universitaria
Sala H-324B - PESC/COPPE
A graph calculus for proving intuitionistic relation algebraic equations
by Petrucio Viana, IME-UFF
(joint work with Renata de Freitas, IME-UFF)
Abstract: Every relation algebraic (RA) equation E is equivalent to a
sentence t(E) of FOL=2R, the first-order language with equality and binary
relation predicates. Moreover, all valid inference S |- E, of an RA equation
E from a set S of RA equations correspond to the inference of t(E) from t(S)
= { t(F) : F in S }. Call a such an inference S |- E intuitionistic if t(E)
can be proved intuitionistically from t(S).
We introduce a diagrammatic calculus, based on graphs, for proving the
intuitionistic inferences (not involving the identity relation). We show
that this graph calculus is sound and complete for the aim it was devised.
Todos os detalhos no site da logica carioca:
http://www.rio-logic.org/
_______________________________________________
Logica-l mailing list
[email protected]
http://www.dimap.ufrn.br/cgi-bin/mailman/listinfo/logica-l
