Article PDF
Avoid common mistakes on your manuscript.
References
Alan R.Anderson and Nuel D.BelnapJr., Entailment: The Logic of Relevance and Necessity, Vol. 1, Princeton University Press, Princeton, New Jersey, 1975.
Nuel D.BelnapJr., ‘Display logic’, J. Philosophical Logic 11 (1982) 375–418.
Nuel D.BelnapJr., ‘Pure rigorous implication as a Sequenzen-kalkul’, J. Symbolic Logic 24 (1959) 282–283.
H. B.Curry and R.Feys, Combinatory Logic, Vol. 1, North-Holland, Amsterdam, 1958.
J. MichaelDunn, ‘A “Gentzen” system for positive relevant implication’, (Abstract), J. Symbolic Logic 38 (1973) 356–357.
J. Michael Dunn, ‘Consecution formulation of positive R with Co-tenability and t’, in [1], 381–391.
GerhardGentzen, ‘Investigations into logical deductions’, in M.Szabo (ed.), The Collected Papers of Gerhard Gentzen, North-Holland, Amsterdam, 1969.
Steve Giambrone, Gentzen Systems and Decision Procedures for Relevant Logics, Australian National University Doctoral Dissertation, Canberra, 1983.
Steve Giambrone, ‘Critique of “decision procedures for two positive relevance logics”’, forthcoming in Reports on Mathematical Logic 19.
S. A.Kripke, ‘The problem of entailment’, (Abstract), J. Symbolic Logic 24 (1959) 324.
AlexandarKron, ‘Decision procedures for two positive relevance logics’, Reports on Mathematical Logic 10 (1978) 61–78.
Errol P. Martin, The P-W Problem, Doctoral Dissertation, Australian National University, Canberra, 1978.
Errol P.Martin and Robert K.Meyer, ‘Solution to the P-W problem’, J. Symbolic Logic 47 (1982) 869–887.
Robert K.Meyer, ‘A general Gentzen system for implicational calculi’, Relevance Logic Newsletter 1 (1976) 189–201.
Robert K.Meyer, RichardRoutley, and J. MichaelDunn, ‘Curry's paradox’, Analysis 39 (1979) 124–128.
G. E.Minc, ‘Cut elimination theorem for relevant logics’, J. Soviet Mathematics 6 (1976) 422–428.
L.Powers, ‘On P-W’, Relevance Logic Newsletter 1 (1976) 131–142.
John Slaney, ‘A meta-completeness theorem for contraction-free relevant logics’, forthcoming in Studia Logica.
Alasdair Urquhart, ‘The undecidability of entailment and relevant implication’, forthcoming in J. Symbolic Logic.
Author information
Authors and Affiliations
Additional information
These results were claimed in [11] on the basis of subscripted Gentzen systems and an argument for decidability for them. However [9] shows that those systems are not equivalent to TW + and RW +, and that the decidability argument is in fact unsound.
Rights and permissions
About this article
Cite this article
Giambrone, S. TW + and RW + are decidable. J Philos Logic 14, 235–254 (1985). https://doi.org/10.1007/BF00249365
Issue Date:
DOI: https://doi.org/10.1007/BF00249365