On undecidability of the propositional logic of an associative binary modality

DOI10.1007/S00153-024-00921-WMaRDI QIDQ6617171zbMATH OpenFDO

Authors M. Kamiński

Publication date 10 October 2024

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00153-024-00921-W

zbMATH Keywords

deduction theoremlogic of a binary modalityrelational semanticsundecidability

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Undecidability and degrees of sets of sentences (03D35)

Cites work

• A BRIEF SURVEY OF FRAMES FOR THE LAMBEK CALCULUS
• Boolean Algebras with Operators
• Boolean Algebras with Operators. Part I
• Cylindric algebras. Part II
• Decidable and undecidable logics with a binary modality
• scientific article; zbMATH DE number 755666 (Why is no real title available?)
• Recursive unsolvability of a problem of Thue
• Relational semantics of the Lambek calculus extended with classical propositional logic
• The deduction theorem in S4, S4.2, and S5
• The dual of concatenation
• The Lambek calculus extended with intuitionistic propositional logic
• The Mathematics of Sentence Structure
• Undecidable Varieties of Semilattice—ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus

This page was built for publication: On undecidability of the propositional logic of an associative binary modality

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6617171)