Near-equational and equational systems of logic for partial functions. I1

Publisher: Cambridge University Press

E-ISSN: 1943-5886|54|3|795-827

ISSN: 0022-4812

Source: The Journal of Symbolic Logic, Vol.54, Iss.3, 1989-09, pp. : 795-827

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Equational logic for total functions is a remarkable fragment of first-order logic. Rich enough to lend itself to many uses, it is also quite austere. The only predicate symbol is one for a notion of equality, and there are no logical connectives. Proof theory for equational logic therefore is different from proof theory for other logics and, in some respects, more transparent. The question therefore arises to what extent a logic with a similar proof theory can be constructed when expressive power is increased.