Abstract
We show that there are infinitely many pairwise non-equivalent formulae in one propositional variable p in the pure implication fragment of the logic T of “ticket entailment” proposed by Anderson and Belnap. This answers a question posed by R. K. Meyer.
Similar content being viewed by others
References
Anderson, A.R., & Belnap, N.D. (1962). The pure calculus of entailment. Journal of Symbolic Logic, 27, 19–52.
Anderson, A.R., & Belnap, N.D. (1975). Entailment: The logic of relevance and necessity (Vol. 1). Princeton: Princeton University Press.
Byrd, M. (1976). Single variable formulas in S4→. Journal of Philosophical Logic, 5, 439–456.
Girard, J.-Y. (1987). Linear logic. Theoretical Computer Science, 50, 1–102.
Kowalski, T., & Slaney, J. (2008). A finite fragment of S3. Reports on Mathematical Logic, 43, 65–72.
Meyer, R.K. (1970). RI—The bounds of finitude. Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 16, 385–387.
Meyer, R.K., & Routley, F.R. (1972). The algebraic analysis of entailment I. Logique et Analyse, 15, 407–428.
Sylvan, F.R., & Brady, R.T. (2003). Relevant logics and their rivals (Vol. II). Aldershot: Ashgate.
Acknowledgments
Work towards this result was carried out while the second author was a Summer Scholar at the Australian National University. We thank the College of Engineering and Computer Science for support through the Summer Scholarships scheme.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Slaney, J., Walker, E. The One-Variable Fragment of T→ . J Philos Logic 43, 867–878 (2014). https://doi.org/10.1007/s10992-013-9293-3
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10992-013-9293-3