Strong decidability and strong recognizability

DOI10.1007/S10469-017-9459-0MaRDI QIDQ1703280zbMATH OpenOpenAlexFDO

Authors L. L. Maksimova, Veta Fedorovna Yun

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

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

Recommendations

• Recognizable logics
• Slices and levels of extensions of the minimal logic
• Recognizability in pre-Heyting and well-composed logics
• Recognizability of all WIP-minimal logics
• Strong computability of slices over the logic GL

Cites work

• scientific article; zbMATH DE number 2184446 (Why is no real title available?)
• scientific article; zbMATH DE number 1003731 (Why is no real title available?)
• scientific article; zbMATH DE number 3659563 (Why is no real title available?)
• scientific article; zbMATH DE number 850397 (Why is no real title available?)
• scientific article; zbMATH DE number 3198011 (Why is no real title available?)
• scientific article; zbMATH DE number 3024119 (Why is no real title available?)
• Admissibility of logical inference rules
• Algebraic Completeness Results for Dummett's LC and Its Extensions
• Constructive negations and paraconsistency
• Negative equivalence over the minimal logic and interpolation
• Recognizable logics
• Strongly decidable properties of modal and intuitionistic calculi
• Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)

Cited in

(10)

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

This page was built for publication: Strong decidability and strong recognizability

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