Notre Dame Journal of Formal Logic

Decidability of Fluted Logic with Identity

William C. Purdy

Abstract

Fluted logic is the restriction of pure predicate logic to formulas in which variables play no essential role. Although fluted logic is significantly weaker than pure predicate logic, it is of interest because it seems closely to parallel natural logic, the logic that is conducted in natural language. It has been known since 1969 that if conjunction in fluted formulas is restricted to subformulas of equal arity, satisfiability is decidable. However, the decidability of sublogics lying between this restricted (homogeneous) fluted logic and full predicate logic remained unknown. In 1994 it was shown that the satisfiability of fluted formulas without restriction is decidable, thus reducing the unknown region significantly. This paper further reduces the unknown region. It shows that fluted logic with the logical identity is decidable. Since the reflection functor can be defined in fluted logic with identity, it follows that fluted logic with the reflection functor also lies within the region of decidability. Relevance to natural logic is increased since the identity permits definition of singular predicates, which can represent anaphoric pronouns.

Article information

Source
Notre Dame J. Formal Logic, Volume 37, Number 1 (1996), 84-104.

Dates
First available in Project Euclid: 16 December 2002

Permanent link to this document
https://projecteuclid.org/euclid.ndjfl/1040067318

Digital Object Identifier
doi:10.1305/ndjfl/1040067318

Mathematical Reviews number (MathSciNet)
MR1379551

Zentralblatt MATH identifier
0858.03013

Subjects
Primary: 03B25: Decidability of theories and sets of sentences [See also 11U05, 12L05, 20F10]
Secondary: 03B20: Subsystems of classical logic (including intuitionistic logic)

Citation

Purdy, William C. Decidability of Fluted Logic with Identity. Notre Dame J. Formal Logic 37 (1996), no. 1, 84--104. doi:10.1305/ndjfl/1040067318. https://projecteuclid.org/euclid.ndjfl/1040067318


Export citation

References

  • Andrews, P. B., An Introduction to Mathematical Logic and Type Theory, Academic Press, Orlando, 1986. Zbl 0617.03001 MR 88g:03001
  • Enderton, H. B., A Mathematical Introduction to Logic, Academic Press, New York, 1972. Zbl 0298.02002 MR 49:2239
  • Hintikka, J., “Surface information and depth information,” pp. 263–297 in Information and Inference, edited by J. Hintikka and P. Suppes, Reidel, Dordrecht, 1970. Zbl 0265.02005 MR 43:4625
  • Hintikka, J., Logic, Language-Games and Information, Clarendon Press, Oxford, 1973. Zbl 0253.02005 MR 54:4911
  • Noah, A., “Predicate-functors and the limits of decidability in logic,” Notre Dame Journal of Formal Logic, vol. 21 (1980), pp. 701–707. Zbl 0416.03014 MR 82b:03042
  • Purdy, W. C., “A variable-free logic for anaphora,” pp. 41–70 in Patrick Suppes: Scientific Philosopher, edited by P. Humphreys, vol. 3, Kluwer Academic Publishers, Dordrecht, 1994. MR 96e:03036
  • Purdy, W. C., “Fluted formulas and the limits of decidability,” The Journal of Symbolic Logic, forthcoming. Zbl 0858.03012 MR 97b:03019
  • Quine, W. V., “Variables explained away,” Proceedings of the American Philosophical Society, vol. 104 (1960), pp. 343–347.
  • Quine, W. V., “On the limits of decision,” Proceedings of the 14th International Congress of Philosophy, vol. III, University of Vienna, 1969.
  • Quine, W. V., The Ways of Paradox and Other Essays, Enlarged Edition, Harvard University Press, Cambridge, 1976.
  • Quine, W. V., “Predicate functors revisited,” The Journal of Symbolic Logic, vol. 46 (1981), pp. 649–652. Zbl 0472.03007 MR 83e:03028
  • Quine, W. V., Methods of Logic, Fourth Edition, Harvard University Press, Cambridge, 1982.
  • Rantala, V., “Constituents,” pp. 43–76 in Jaakko Hintikka, edited by R. J. Bogdan, Reidel, Dordrecht, 1987.