Strong decidability and strong recognizability

DOI10.1007/s10469-017-9459-0zbMath1420.03046OpenAlexW2771865035MaRDI QIDQ1703280

Veta Fedorovna Yun, Larisa L. Maksimova

Publication date: 2 March 2018

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10469-017-9459-0

zbMATH Keywords

decidabilityadmissible ruleminimal logicrecognizable logicJohansson algebrastrong decidability

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Paraconsistent logics (03B53)

Related Items

Hybrid extensions of the minimal logic, Recognizability of all WIP-minimal logics, Perceptibility in pre-Heyting logics, Strong computability of slices over the logic GL, Multi-agent temporal nontransitive linear logics and the admissibility problem, Slices and levels of extensions of the minimal logic, Recognizable and perceptible logics and varieties, Recognizability in pre-Heyting and well-composed logics, Constructive classifications of modal logics and extensions of minimal logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
• Recognizable logics
• Negative equivalence over the minimal logic and interpolation
• Constructive negations and paraconsistency
• Admissibility of logical inference rules
• Strongly decidable properties of modal and intuitionistic calculi
• Algebraic Completeness Results for Dummett's LC and Its Extensions