Abstract
The first philosophically motivated sentential logics to be proved undecidable were relevant logics like R and E. But we deal here with important decidable fragments thereof, like \(R_{\longrightarrow}\) . Their decidability rests on S. Kripke’s gentzenizations, together with his central combinatorial lemma. Kripke’s lemma has a long history and was reinvented several times. It turns out equivalent to and a consequence of Dickson’s lemma in number theory, with antecedents in Hilbert’s basis theorem. This lemma has been used in several forms and in various fields. For example, Dickson’s lemma guarantees termination of Buchberger’s algorithm that computes the Gröbner bases of polynomial ideals. In logic, Kripke’s lemma is used in decision proofs of some substructural logics with contraction. Our preferred form here of Dickson-Kripke is the Infinite Division Principle (IDP). We present our proof of IDP and its use in proving the finite model property for \(R_{\longrightarrow}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Anderson, A.R., Belnap, N.D.: Entailment I. The Logic of Relevance and Necessity. Princeton Un. Press, Princeton (1975)
Anderson, A.R., Belnap, N.D., Dunn, J.M.: Entailment II. The Logic of Relevance and Necessity. Princeton Un. Press, Princeton (1992)
Becker, T., Weispfenning, V., Kredel, H.: Gröbner Bases. A Computational Approach to Commutative Algebra. Springer, New York (1993)
Bell, E.T.: The Development of Mathematics. McGraw-Hill, New York (1945)
Belnap, N.D., Wallace, J.R.: A Decision Procedure for the System E I of Entailment with Negation. Zeitschr. f. math. Logik und Grundlagen d. Math. 11, 277–289 (1965)
Birkhoff, G.: Lattice Theory, 3rd edn. Providence, AMS (1967)
Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer, New York (1997)
Cox, D., Little, J., O’Sheen, D.: Ideals, Varieties, and Algorithms. Springer, New York (1992)
Church, A.: The Weak Theory of Implication. In: Menne, A., et al. (eds.) Kontrolliertes Denken, Untersuchungen zum Logikkalkül und zur Logik der Einzelwissenschaften, pp. 22–37. Karl Albert Verlag (1951)
Curry, H.B.: A Theory of Formal Deducibility, Ann Arbor (1950)
Curry, H.B.: Foundations of Mathematical Logic, New York (1963)
Curry, H.B., Craig, W.: Review of [Ch51]. J. Symb. Logic 18, 177–178 (1953)
Dickson, L.E.: Finiteness of the Odd Perfect Primitive Abundant Numbers with n Distinct Prime Factors. Am. J. Math. 35, 413–422 (1913)
Dos̆en, K.: The First Axiomatization of Relevant Logic. J. Phil. Log. 21, 339–356 (1992)
Dunn, J.M.: Relevance Logic and Entailment. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, Dordrecht, D. Reidel, vol. III, pp. 117–224 (1986)
Grace, J.H., Young, A.: The Algebra of Invariants. Cambridge University Press, Cambridge (1903) (Repub. New York, Chelsea Pub. Comp.)
Higman, G.: Ordering by Divisibility in Abstract Algebras. Proc. London. Math. Soc. 2, 326–336 (1952)
Hilbert, D.: Über die Theorie des algebraischen Formen. Math. Annalen 36, 473–534 (1890)
König, D.: Theorie der endlichen und unendlichen Graphen. Chelsea Pub. Comp, Repub. New York (1936)
Kripke, S.: The Problem of Entailment (Abstract). J. Symb. Logic 24, 324 (1959)
Meyer, R.K.: Improved Decision Procedures for Pure Relevant Logics (1973) (Unpublished)
Meyer, R.K.: Improved Decision Procedures for Pure Relevant Logics. t.a. A. Church’s Festschrift
Meyer, R.K., Ono, H.: The Finite Model Property for BCK and BCIW. Studia Logica 53(1), 107–118 (1994)
Meyer, R.K., McRobbie, M.A.: Multisets and Relevant Implication I and II. Australasian J. of Philosophy 60, 107–139, 265-281 (1982)
Orlov, I.E.: The Calculus of Compatibility of Propositions (in Russian). Matematicheskiĭ sbornik 35, 263–286 (1928)
Simpson, S.G.: Ordinal Numbers and the Hilbert Basis Theorem. J. Symb. Logic 53(3), 961–974 (1988)
Thistlewaite, P., McRobbie, M., Meyer, R.K.: Automated Theorem Proving in Non-Classical Logics. John Wiley, New York (1988)
Urquhart, A.: The Undecidability of Entailment and Relevant Implication. J. Symb. Logic 40, 1059–1073 (1984)
Urquhart, A.: The Complexity of Decision Procedures in Relevance Logic. In: Dunn, J.M., Gupta, A. (eds.) Truth or Consequences, Essays in Honor of Nuel Belnap., pp. 61–76. Kluwer Academic Publishers, Dordrecht (1990)
Urquhart, A.: The Complexity of Decision Procedures in Relevance Logic II (t.a.)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Riche, J., Meyer, R.K. (1999). Kripke, Belnap, Urquhart and Relevant Decidability & Complexity. In: Gottlob, G., Grandjean, E., Seyr, K. (eds) Computer Science Logic. CSL 1998. Lecture Notes in Computer Science, vol 1584. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10703163_16
Download citation
DOI: https://doi.org/10.1007/10703163_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65922-8
Online ISBN: 978-3-540-48855-2
eBook Packages: Springer Book Archive