Kripke, Belnap, Urquhart and relevant decidability & complexity “Das ist nicht Mathematik. Das ist Theologie.”

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1584, Issue , 1999, Pages 224-240

  Riche, Jacques ^a   Meyer, Robert K ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; NUMBER THEORY;

BASES OF POLYNOMIALS; FINITE MODEL PROPERTY; HILBERT; RELEVANT LOGIC; S-ALGORITHMS; SUBSTRUCTURAL LOGIC;

COMPUTER CIRCUITS;

EID: 84956984317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10703163_16     Document Type: Conference Paper

References (30)

1. AB75. Anderson, A. R. and Belnap, N. D., Entailment I. The Logic of Relevance and Necessity. Princeton, Princeton Un. Press, 1975. 224, 225, 225, 229, 230, 233
2. ABD92. Anderson, A. R., Belnap, N. D. and Dunn, J. M., Entailment II. The Logic of Relevance and Necessity. Princeton, Princeton Un. Press, 1992. 224
3. BWK93. Becker, T., Weispfenning, V. and Kredel, H., Grobner Bases. A Computational Approach to Commutative Algebra, New York, Springer-Verlage, 1993. 238
4. Be45. Bell, E, T., The Development of Mathematics, New York, McGraw-Hill, 1945. 237
5. I of Entailment with Negation. Zeitschr. f. math. Logik und Grundlagen d. Math. 11 (1965), 277-289. 227, 227, 229, 230
6. Bi67. Birkhoff, G., Lattice Theory, 3rd edition. Providence, AMS, 1967. 235, 235
7. BGG97. Börger, E., Grädel, E. and Gurevich, Y., The Classical Decision Problem. BW65. New York, Springer Verlag, 1997. 238
8. CLO92. Cox, D., Little, J. and O'Sheen, D., Ideals, Varieties, and Algorithms. New York, Springer Verlag, 1992. 237
9. Ch51. Church, A., The Weak Theory of Implication, In: Kontrolliertes Denken, Un- tersuchungen zum Logikkalkul und zur Logik der Einzelwissenschaften, ed., A. Menne et al., Karl Albert Verlag, 1951, pp. 22-37. 224, 225, 226, 239
10. Cu50. Curry, H.B., A Theory of Formal Deducibility, Ann Arbor, 1950. 230
11. Cu63. Curry, H.B., Foundations of Mathematical Logic, New York, 1963. 225, 225
12. CuC53. Curry, H.B. and Craig, W., Review of The Weak Theory of Implication, J. Symb. Logic 18 (1953) pp. 177-8. 225
13. Di13. Dickson, L.E., Finiteness of the Odd Perfect Primitive Abundant Numbers with n Distinct Prime Factors. Am. J. Math. 35 (1913) 413-422.
14. Do92. Dosen, K., The First Axiomatization of Relevant Logic J. Phil. Log. 21 (1992), 339-56.
15. Du86. Dunn, J. M., Relevance Logic and Entailment. In: Handbook of Philosophical Logic, Vol.III, D. Gabbay and F. Guenthner (eds.), Dordrecht, D. Reidel, 1986, pp. 117-224. 224 229
16. GY03. Grace, J.H. and Young, A., The Algebra of Invariants. Cambridge University Press, 1903. (Repub. New York, Chelsea Pub. Comp.). 237
17. Hi52. Higman, G., Ordering by Divisibility in Abstract Algebras. Proc. London. Math. Soc. 2, (1952) 326-336. 235, 236
18. Hi90. Hilbert, D., Uber die Theorie des algebraischen Formen. Math. Annalen 36 (1890) 473-534. 236, 239
19. KÖ36. König, D., Theorie der endlichen und unendlichen Graphen, 1936. (Repub. New York, Chelsea Pub. Comp.) 237
20. Kr59. Kripke, S., The Problem of Entailment, (Abstract). J. Symb. Logic 24 (1959) 324. 227, 229
21. Me73. Meyer, R. K., Improved Decision Procedures for Pure Relevant Logics. Unpublished, 1973. 231, 233
22. Me98. Meyer, R. K., Improved Decision Procedures for Pure Relevant Logics. t.a. In: A. Church's Festschrift. 231, 231, 233, 233
23. MO94. Meyer, R. K and Ono, H., The Finite Model Property for BCK and BCIW. Studia Logica, 53, 1 (1994),107-118. 233
24. MM82. Meyer, R. K. and McRobbie, M. A., Multisets and Relevant Implication I and II. Australasian J. of Philosophy 60 (1982), 107-139 and 265-281. 225
25. Or28. Orlov, I. E., The Calculus of Compatibility of Propositions, (in Russian). Matematicheskii sbornik 35 (1928), 263-286. 224
26. Si88. Simpson, S.G., Ordinal Numbers and the Hilbert Basis Theorem. J. Symb. Logic 53, 3 (1988) 961-974. 238
27. TMM88. Thistlewaite, P., McRobbie, M. and Meyer, R.K., Automated Theorem- Proving in Non-Classical Logics, John Wiley, New York, 1988. 225, 226, 227, 227, 228, 228, 229, 238, 238
28. Ur84. Urquhart, A., The Undecidability of Entailment and Relevant Implication, J. Symb. Logic, 40 (1984), pp. 1059-1073. 226
29. Ur90. Urquhart, A., The Complexity of Decision Procedures in Relevance Logic. In: J.M. Dunn and A. Gupta (eds), Truth or Consequences, Essays in Honor of Nuel Belnap., Dordrecht, Kluwer Academic Publishers, 1990, pp. 61-76. 237
30. Ur97. Urquhart, A., The Complexity of Decision Procedures in Relevance Logic II. (t.a.) 237, 238