Notre Dame Journal of Formal Logic
- Notre Dame J. Formal Logic
- Volume 46, Number 2 (2005), 173-180.
Finite Tree Property for First-Order Logic with Identity and Functions
The typical rules for truth-trees for first-order logic without functions can fail to generate finite branches for formulas that have finite models–the rule set fails to have the finite tree property. In 1984 Boolos showed that a new rule set proposed by Burgess does have this property. In this paper we address a similar problem with the typical rule set for first-order logic with identity and functions, proposing a new rule set that does have the finite tree property.
Notre Dame J. Formal Logic Volume 46, Number 2 (2005), 173-180.
First available in Project Euclid: 2 June 2005
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Bergmann, Merrie. Finite Tree Property for First-Order Logic with Identity and Functions. Notre Dame J. Formal Logic 46 (2005), no. 2, 173--180. doi:10.1305/ndjfl/1117755148. https://projecteuclid.org/euclid.ndjfl/1117755148
- See also: Editorial Notice. Notre Dame J. Formal Logic 58 (2017), no. 1, p. 155.