Paulo A. S. Veloso (COPPE-UFRJ) |
Sheila R. M. Veloso (FEN-UERJ) |

We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e. it represents bottom. Our calculus establishes that a graph has empty extension by converting it to a normal form, which is expanded to other graphs until we can recognize conflicting situations (equivalent to a formula and its negation). |

Published: 28th March 2013.

ArXived at: https://dx.doi.org/10.4204/EPTCS.113.15 | bibtex | |

Comments and questions to: eptcs@eptcs.org |

For website issues: webmaster@eptcs.org |