On the decidability of implicational ticket entailment

Journal of Symbolic Logic

Volumn 78, Issue 1, 2013, Pages 214-236

  Bimbo, Katalin ^a   Dunn, J Michael ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b INDIANA UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84880473242     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2178/jsl.7801150     Document Type: Article

References (29)

1. Alan R. Anderson [1960], Entailment shorn of modality, (abstract), this Journal, vol. 25, p. 388.
2. Alan R. Anderson [1963], Some open problems concerning the system E of entailment, Acta Philo-sophica Fennica, vol. 16, pp. 9-18.
3. Alan R. Anderson and Nuel D. Belnap [1975], Entailment. The logic of relevance and necessity, vol. I, Princeton University Press, Princeton, NJ.
4. Alan R. Anderson, Nuel D. Belnap, and J. Michael Dunn [1992], Entailment. The logic of rele-vance and necessity, vol. II, Princeton University Press, Princeton, NJ.
5. Nuel D. Belnap and John R. Wallace [1961], A decision procedure for the system EI of entailment with negation, Technical Report 11, Contract No. SAR/609 (16), Office of Naval Research, New Haven, (published in Zeitschrift f ur mathematische Logik und Grundlagen der Mathematik, vol. 11, (1965), pp. 277-289).
6. Katalin Bimbo [2005a], Admissibility of cut inLC with fixed point combinator, Studia Logica, vol. 81, pp. 399-423.
7. Katalin Bimbo [2005b], Types of I-free hereditary right maximal terms, Journal of Philosophical Logic, vol. 34, pp. 607-620.
8. Katalin Bimbo [2007a], LEt? , LR? , LK and cutfree proofs, Journal of Philosophical Logic, vol. 36, pp. 557-570.
9. Katalin Bimbo [2007b], Relevance logics, Philosophy of logic (D. Jacquette, editor), Handbook of the Philosophy of Science (D. Gabbay, P. Thagard and J. Woods, editors), vol. 5, Elsevier, pp. 723-789.
10. Katalin Bimbo [2012], Combinatory logic: Pure, applied and typed, Discrete Mathematics and its Applications, CRC Press, Boca Raton, FL.
11. Katalin Bimbo and J. Michael Dunn [2008], GeneralizedGalois logics. Relational semantics of non-classical logical calculi, CSLI Lecture Notes, vol. 188, CSLI Publications, Stanford, CA.
12. Katalin Bimbo and J. Michael Dunn [2012a], From relevant implication to ticket entailment, (ab-stract), The Bulletin of Symbolic Logic, vol. 18, p. 288.
13. Katalin Bimbo and J. Michael Dunn [2012b], New consecution calculi for Rt ?, Notre Dame Jour-nal of Formal Logic, vol. 53, pp. 491-509.
14. Katalin Bimbo and J. Michael Dunn [to appear], The decision problemof T?, (abstract), The Bul-letin of Symbolic Logic.
15. Haskell B. Curry [1963], Foundations of mathematical logic, McGraw-Hill Book Company, New York, NY, (reprint, Dover, New York, NY, 1977).
16. J. Michael Dunn [1973], A 'Gentzen system' for positive relevant implication, (abstract), this Jour-nal, vol. 38, pp. 356-357.
17. J. Michael Dunn [1986], Relevance logic and entailment, Handbook of philosophical logic (D.Gabbay and F. Guenthner, editors), vol. 3, D. Reidel, Dordrecht, 1st ed., pp. 117-224, (updated as Relevance Logic (with G. Restall), Handbook of Philosophical Logic, 2nd ed., (D. Gabbay and F. Guenthner, editors), vol. 6, Kluwer Academic Publishers, 2002, pp. 1-128).
18. J. Michael Dunn and Robert K.Meyer [1997], Combinators and structurally free logic, Logic Jour-nal of IGPL, vol. 5, pp. 505-537.
19. Steve Giambrone [1985], TW+ and RW+ are decidable, Journal of Philosophical Logic, vol. 14, pp. 235-254.
20. Stephen C. Kleene [1952], Introduction to metamathematics, P. Van Nostrand Company, Inc., Princeton, NJ.
21. Saul A. Kripke [1959], The problem of entailment, (abstract), this Journal, vol. 24, p. 324.
22. Edwin D.Mares and Robert K.Meyer [2001], Relevant logics, The Blackwell guide to philosophi-cal logic (L. Goble, editor), Blackwell Philosophy Guides, Blackwell Publishers, Oxford, UK, pp. 280-308.
23. Robert K. Meyer [2001], Improved decision procedures for pure relevant logic, Logic, meaning and computation. Essays in memory of Alonzo Church (C. A. Anderson and M. Zeleny, editors), Kluwer Academic Publishers, Dordrecht, pp. 191-217.
24. Robert K. Meyer andMichael A. McRobbie [1982], Multisets and relevant implication I, Aus-tralasian Journal of Philosophy, vol. 60, pp. 107-139.
25. Robert K. Meyer and Richard Routley [1972], Algebraic analysis of entailment I, Logique et Analyse, vol. 15, pp. 407-428.
26. Vincent Padovani [2010], Ticket Entailment is decidable, Mathematical Structures in Computer Sci-ence, to appear.
27. Jacques Riche and Robert K.Meyer [1999], Kripke, Belnap, Urquhart and relevant decidability and complexity, Computer science logic (Brno, 1998) (Georg Gottlob, Etienne Grandjean, and Katrin Seyr, editors), Lecture Notes in Computer Science, no. 1584, Springer, pp. 224-240.
28. Richard Routley, Robert K.Meyer, Val Plumwood, and Ross T. Brady [1982], Relevant logics and their rivals, vol. I, Ridgeview Publishing Company, Atascadero, CA.
29. Moses Schonfinkel [1924], On the building blocks of mathematical logic, From Frege to Godel. A source book in mathematical logic (J. van Heijenoort, editor), Harvard University Press, Cambridge, MA, 1967, pp. 355-366.