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

Journal of Symbolic Logic 54 (3):795-827 (1989)
  Copy   BIBTEX

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.The increase mainly studied here allows one both to consider arbitrary partial functions and to express the condition that a function be total. A further increase taken into account is equivalent to a change to universal Horn sentences for partial and for total functions.Two ways of increasing expressive power will be considered. In both cases, the notion of equality is modified and nonlogical function symbols are interpreted as ranging over partial functions, instead of ranging only over total functions. In one case, the only further change is the addition of symbols that denote logical functions, such as the binary projection functionAethat maps each pair ‹a0,a1› of elements of a setAinto the elementa0. An addition of this kind results in a language, and also in a system of logic based on this language, which we callequationalIn the other case, instead of adding a symbol forAe, one admits those special universal Horn sentences in which the conditions expressed by the antecedent are, in a sense, pure conditions of existence. Languages and systems of logic that result from a change of this kind will be callednear-equational. According to whether the number of existence conditions that one may express in antecedents is finite or arbitrary, the resulting language and logic shall befiniteorinfinitary, respectively. Each of our finite near-equational languages turns out to be equivalent to one of our equational languages, and vice versa.

Other Versions

No versions found

Links

PhilArchive

    This entry is not archived by us. If you are the author and have permission from the publisher, we recommend that you archive it. Many publishers automatically grant permission to authors to archive pre-prints. By uploading a copy of your work, you will enable us to better index it, making it easier to find.

    Upload a copy of this work     Papers currently archived: 102,546

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
55 (#403,195)

6 months
14 (#209,306)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Lattice Theory.Garrett Birkhoff - 1940 - Journal of Symbolic Logic 5 (4):155-157.
Meinong and the Principle of Independence.Karel Lambert - 1985 - Philosophical Review 94 (3):423-426.

Add more references