On undecidability of the propositional logic of an associative binary modality

Archive for Mathematical Logic:1-21 (forthcoming)
  Copy   BIBTEX

Abstract

It is shown that both classical and intuitionistic propositional logics of an associative binary modality are undecidable. The proof is based on the deduction theorem for these logics.

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/s00153-024-00921-w

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,150

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Propositional logic of continuous transformations in Cantor space.Grigori Mints & Ting Zhang - 2005 - Archive for Mathematical Logic 44 (6):783-799.
Counting proofs in propositional logic.René David & Marek Zaionc - 2009 - Archive for Mathematical Logic 48 (2):185-199.
On meta complexity of propositional formulas and propositional proofs.Pavel Naumov - 2008 - Archive for Mathematical Logic 47 (1):35-52.
Essential hereditary undecidability.Albert Visser - forthcoming - Archive for Mathematical Logic:1-34.
A predicate extension of real valued logic.Stefano Baratella - 2017 - Archive for Mathematical Logic 56 (5):585-605.
An Introduction to Mathematical Logic.Richard E. Hodel - 2013 - Courier Corporation.
Partially definable forcing and bounded arithmetic.Albert Atserias & Moritz Müller - 2015 - Archive for Mathematical Logic 54 (1):1-33.
A first course in logic.Mark Verus Lawson - 2019 - Boca Raton: CRC Press, Taylor and Francis Group.
The modal logic of continuous functions on cantor space.Philip Kremer - 2006 - Archive for Mathematical Logic 45 (8):1021-1032.
Reviews. Alfred Tarski. Preface. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1953, pp. VIII–IX. Alfred Tarski. A general method in proofs of undecidability. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1953, pp. 3–35. Andrzej Mostowski, Raphael M. Robinson, and Alfred Tarski. Undecidability and essential undecidability in arithmetic. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1953, pp. 39–74. Alfred Tarski. Undecidability of the elementary theory of groups. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1953, pp. 77–87. Bibliography. Undecidable theories, Studies in logic and the foundations of mathematics, North-Holland Publishing Company, Amsterdam 1953, pp. 89–91. Index. Undecidable theories. [REVIEW]Martin Davis - 1959 - Journal of Symbolic Logic 24 (2):167-169.
A complete many-valued logic with product-conjunction.Petr Hájek, Lluis Godo & Francesc Esteva - 1996 - Archive for Mathematical Logic 35 (3):191-208.
Hardness assumptions in the foundations of theoretical computer science.Jan Krajíček - 2005 - Archive for Mathematical Logic 44 (6):667-675.
On the linear Lindenbaum algebra of Basic Propositional Logic.Majid Alizadeh & Mohammad Ardeshir - 2004 - Mathematical Logic Quarterly 50 (1):65.
A semantical proof of the strong normalization theorem for full propositional classical natural deduction.Karim Nour & Khelifa Saber - 2006 - Archive for Mathematical Logic 45 (3):357-364.
On Interpreting the S5 Propositional Calculus: an essay in philosophical logic.Michael J. Carroll - 1976 - Dissertation, University of Iowa

Analytics

Added to PP
2024-04-30

Downloads
2 (#1,806,327)

6 months
2 (#1,203,099)

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Modal Logic.Patrick Blackburn, Maarten de Rijke & Yde Venema - 2001 - Studia Logica 76 (1):142-148.
A New Introduction to Modal Logic.G. E. Hughes & M. J. Cresswell - 1996 - Studia Logica 62 (3):439-441.
Recursive unsolvability of a problem of thue.Emil L. Post - 1947 - Journal of Symbolic Logic 12 (1):1-11.
A brief survey of frames for the Lambek calculus.Kosta Došen - 1992 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 38 (1):179-187.
A brief survey of frames for the Lambek calculus.Kosta Došen - 1992 - Mathematical Logic Quarterly 38 (1):179-187.

View all 11 references / Add more references