Abstract
We study Church’s “weak implicational calculus” of 1951, which is the pure implicational part R→ of the relevant logic R. We investigate and develop, again following Church, the effect of adding propositional quantifiers to R→; this allows also the specification of a minimal, a De Morgan and finally a Boolean negation. The bulk of the paper deals with finite model properties for various fragments of R, including R→. A modification of an argument due to Saul Kripke is the chief tool in this project, yielding an Infinite Division Prinicple (IDP) for “Church monoids” that facilitates our finitization. Thus systems intermediate between R→ and LR (non-distributive R) have the finite model property and are hence model-theoretically decidable. A concluding section shows how to define various logical particles using Church’s propositional quantifiers, which turns what are conservative extension results at the quantifier-free level into axiomatic extensions when quantifiers are present.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ackermann, W. 1956 Begründung einer strengen Implikation, The Journal of Symbolic Logic, vol. 21, pp. 113–128.
Anderson, A. R., and N. D. Belnap, Jr. 1975 Entailment, vol. I, Princeton University Press, Princeton, New Jersey.
Anderson, A. R., N. D. Belnap, Jr., and J. M. Dunn 1992 Entailment, vol. II, Princeton University Press, Princeton, New Jersey.
Belnap, N. D. 1993 Life in the undistributed middle, Substructural logics (P. Schroeder-Heister and K. Dosen, editors), Oxford University Press, Oxford, pp. 31–41.
Church, A. 1941 The calculi of lambda-conversion, Princeton University Press, Princeton, New Jersey.
Church, A. 1951 The weak positive implicational propositional calculus (abstract), The Journal of Symbolic Logic, vol. 16, p. 238.
Church, A. 1951a The weak theory of implication, Kontrolliertes Denken, Untersuchungen zum Logikkalkül und zur Logik der Einzelwissenschaften, (A. Menne, A. Wilhelmy, and H. Angsil, editors), Kommissions-Verlag Karl Alber, Munich, pp. 22–37.
Curry, H. B., and R. Feys 1958 Combinatory logic, vol. 1, North-Holland, Amsterdam.
Dickson, L. E. 1913 Finiteness of the odd perfect primitive abundant numbers with n distinct prime factors, American Journal of Mathematics, vol. 35, pp. 413–422.
Dosen, K. 1993 A historical introduction to substructural logics, Substructural logics (P. Schroeder-Heister and K. Došen, editors), Oxford University Press, Oxford, pp. 1–30.
Dunn, J. M. 1966 The algebra of intensional logics, Doctoral dissertation, University of Pittsburgh, University Microfilms, Ann Arbor; see Anderson and Belnap 1975, pp. 352-369, contributed by Dunn.
Fine, K. 1974 Models for entailment, The Journal of Philosophical Logic, vol. 3, pp. 347–372; an updated version appears in Anderson, Belnap, and Dunn 1992, pp. 208-231.
Johansson, I. 1936 Der Minimalkalkül, einer reduzierter intuitionistischer Formalismus, Compositio Mathematica, vol. 4, pp. 119–136.
Kripke, S. 1959 The problem of entailment (abstract), The Journal of Symbolic Logic, vol. 24, p. 324.
Meyer, R. K. 1966 Topics in modal and many-valued logic, Doctoral dissertation, University of Pittsburgh, University Microfilms, Ann Arbor.
Meyer, R. K. 1978 The relevant theory of propositions is undecidable, unpublished manuscript.
Meyer, R. K. 1979 A Boolean-valued semantics for R, research paper no. 4, Research School of Social Sciences, Logic Group, Australian National University.
Meyer, R. K., and M. A. McRobbie 1982 Multisets and relevant implication, Australasian Journal of Philosophy, vol. 60, pp. 265–281.
Meyer, R. K., and H. Ono 1994 The finite model property for BCK and BCIW, Studia Logica, vol. 53, pp. 107–118.
Orlov, I. E. 1928 The calculus of compatibility of propositions (Russian), Matematicheskii Sbornik, vol. 35, pp. 263–286.
Riche, J. 1991 Decidability, complexity and automated reasoning in relevant logic, Doctoral dissertation, Australian National University, Canberra.
Routley, R., and R. K. Meyer 1973 The semantics of entailment (I), Truth, syntax, modality (H. Leblanc, editor), North-Holland, Amsterdam, pp. 199–243.
Routley, R., V. Plumwood, R. K. Meyer, and R. T. Brady 1982 Relevant logics and their rivals, Part I, Ridgeview, Atascadero, California.
Shaw-Kwei, M. 1950 The deduction theorems and two new logical systems, Methodos, vol. 2, pp. 56–75.
Slaney, J. K. 1985 3088 varieties. A solution to the Ackermann constant problem, The Journal of Symbolic Logic, vol. 52, pp. 487–501.
Thistlewaite, P. B., M. A. McRobbie, and R. K. Meyer 1988 Automated theorem-proving in non-classical logics, Wiley, New York.
Urquhart, A. 1972 Semantics for relevant logics, The Journal of Symbolic Logic, vol. 37. pp. 159–169; an updated version appears in Anderson, Belnap, and Dunn 1992, pp. 142-155.
Urquhart, A. 1984 The undecidabilty of entailment and relevant implication, The Journal of Symbolic Logic, vol. 49, pp. 1059–1073; reprinted with additional material in Anderson, Belnap, and Dunn 1992, pp. 348-375.
Urquhart, A. 1990 The complexity of decision procedures in relevance logic, Truth or consequences: Essays in honor of Nuel Belnap (J. M. Dunn and A. Gupta, editors), Kluwer, London, pp. 61–76.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Meyer, R.K. (2001). Improved Decision Procedures for Pure Relevant Logic. In: Anderson, C.A., Zelëny, M. (eds) Logic, Meaning and Computation. Synthese Library, vol 305. Springer, Dordrecht. https://doi.org/10.1007/978-94-010-0526-5_9
Download citation
DOI: https://doi.org/10.1007/978-94-010-0526-5_9
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-3891-1
Online ISBN: 978-94-010-0526-5
eBook Packages: Springer Book Archive