Abstract
For a number of tasks in knowledge representation, and particularly in natural language semantics, it is useful to be able to treat propositions and properties as objects — as items that can appear as arguments of predicates, as things one can quantify over, and so on. Logics that support such “intensional” operations are notoriously hard to work with. The current paper presents a theorem prover for one such logic, namely, Turner's property theory.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Groenendijk, J. and Stokhof, M.:Studies on the Semantics of Questions and the Pragmatics of Answers, Diss., Department of Philosophy, University of Amsterdam, 1984.
Hintikka, J.:Knowledge and Belief: An Introduction to the Two Notions, Cornell University Press, New York, 1962.
Konolige, K.:A Deduction Model of Belief, Pitman, London, 1986.
Manthey, R. and Bry, F.: SATCHMO: A theorem prover in PROLOG,CADE-88, 1988.
Moore, R. C.: A formal theory of knowledge and action, in J. R. Hobbs and R. C. Moore (eds),Formal Theories of the Commonsense World, Ablex Pub. Corp., New Jersey, 1984, pp. 319–358.
Ramsay, A. M.: Generating relevant models,J. Automated Reasoning 7 (1991), 359–368.
Ramsay, A. M.: Focus on “Only” and “Not”,COLING-94, Kyoto, 1994.
Turner, R.: A theory of properties,J. Symbolic Logic 52(2) (1987), 455–472.
Turner, R.:Truth and Modality for Knowledge Representation, Pitman, London, 1990.
Whitehead, A. N. and Russell, B.:Principia Mathematica, Cambridge University Press, Cambridge, 1925.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Ramsay, A. Theorem proving for intensional logic. J Autom Reasoning 14, 237–255 (1995). https://doi.org/10.1007/BF00881857
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00881857