Extending relAPS to first order logic


Autoria(s): Aameri, Bahar
Contribuinte(s)

Department of Computer Science

Data(s)

08/03/2011

08/03/2011

08/03/2011

Resumo

RelAPS is an interactive system assisting in proving relation-algebraic theorems. The aim of the system is to provide an environment where a user can perform a relation-algebraic proof similar to doing it using pencil and paper. The previous version of RelAPS accepts only Horn-formulas. To extend the system to first order logic, we have defined and implemented a new language based on theory of allegories as well as a new calculus. The language has two different kinds of terms; object terms and relational terms, where object terms are built from object constant symbols and object variables, and relational terms from typed relational constant symbols, typed relational variables, typed operation symbols and the regular operations available in any allegory. The calculus is a mixture of natural deduction and the sequent calculus. It is formulated in a sequent style but with exactly one formula on the right-hand side. We have shown soundness and completeness of this new logic which verifies that the underlying proof system of RelAPS is working correctly.

Identificador

http://hdl.handle.net/10464/3147

Idioma(s)

eng

Publicador

Brock University

Palavras-Chave #Relation algebras #Computer science -- Mathematics.
Tipo

Electronic Thesis or Dissertation