| Full text | |
| Author(s): |
de Freitas, Renata
;
Veloso, Sheila R. M.
;
Veloso, Paulo A. S.
;
Viana, Petrucio
;
Artemov, S
;
Nerode, A
Total Authors: 6
|
| Document type: | Journal article |
| Source: | Lecture Notes in Computer Science; v. 5407, p. 2-pg., 2009-01-01. |
| Abstract | |
We introduce and illustrate a graph calculus for proving and deciding the positive identities and inclusions of fork algebras, i.e., those without occurrences of complementation. We show that this graph calculus is sound, complete and decidable. Moreover, the playful nature of this calculus renders it much more intuitive than its equational counterpart. (AU) | |
| FAPESP's process: | 04/14107-2 - Logical consequence and combinations of logics: fundaments and efficient applications |
| Grantee: | Walter Alexandre Carnielli |
| Support Opportunities: | Research Projects - Thematic Grants |