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: 93,612

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

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.
Undecidable Varieties of Semilattice—ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus.A. Kurucz, I. Nemeti, I. Sain & A. Simon - 1993 - Logic Journal of the IGPL 1 (1):91-98.
On Modal Logics of Partial Recursive Functions.Pavel Naumov - 2005 - Studia Logica 81 (3):295-309.
Decidable and undecidable logics with a binary modality.ágnes Kurucz, István Németi, Ildikó Sain & András Simon - 1995 - Journal of Logic, Language and Information 4 (3):191-206.
Proof analysis in intermediate logics.Roy Dyckhoff & Sara Negri - 2012 - Archive for Mathematical Logic 51 (1):71-92.
Structural completeness in propositional logics of dependence.Rosalie Iemhoff & Fan Yang - 2016 - Archive for Mathematical Logic 55 (7-8):955-975.
On the polynomial-space completeness of intuitionistic propositional logic.Vítězslav Švejdar - 2003 - Archive for Mathematical Logic 42 (7):711-716.
Note on grammatical translations of logical calculi.Stanislaw Krajewski - 1992 - Archive for Mathematical Logic 31 (4):259-262.
Propositional logic of continuous transformations in Cantor space.Grigori Mints & Ting Zhang - 2005 - Archive for Mathematical Logic 44 (6):783-799.
Automated Proof Search in Non-classical Logics: Efficient Matrix Proof Methods for Modal and Intuitionistic Logics.Lincoln A. Wallen - 1990 - MIT Press (MA).

Analytics

Added to PP
2024-04-30

Downloads
3 (#1,729,833)

6 months
3 (#1,206,820)

Historical graph of downloads
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