Recognizable logics

DOI10.1007/S10469-015-9336-7MaRDI QIDQ887647zbMATH OpenOpenAlexFDO

Authors L. L. Maksimova, Veta Fedorovna Yun

Publication date 27 October 2015

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

Full work available at URL https://doi.org/10.1007/s10469-015-9336-7

zbMATH Keywords

recognizabilityinterpolation propertyJohansson's minimal logiccharacteristic formulareliable recognizability

Mathematics Subject Classification ID

Paraconsistent logics (03B53) Decidability of theories and sets of sentences (03B25) Intermediate logics (03B55) Interpolation, preservation, definability (03C40)

Recommendations

• Recognizability in pre-Heyting and well-composed logics
• scientific article; zbMATH DE number 3890762
• Logics for knowability
• scientific article; zbMATH DE number 5994598
• scientific article; zbMATH DE number 3887681
• A logic on subobjects and recognizability
• Reasoning with logical bilattices
• scientific article; zbMATH DE number 1749198
• scientific article; zbMATH DE number 1028828
• Well-structured mathematical logic

Cites work

• scientific article; zbMATH DE number 2184446 (Why is no real title available?)
• scientific article; zbMATH DE number 1746556 (Why is no real title available?)
• scientific article; zbMATH DE number 2154091 (Why is no real title available?)
• scientific article; zbMATH DE number 850397 (Why is no real title available?)
• scientific article; zbMATH DE number 3231075 (Why is no real title available?)
• scientific article; zbMATH DE number 3266622 (Why is no real title available?)
• scientific article; zbMATH DE number 3353345 (Why is no real title available?)
• A Remark on the Intersection of Tow Logics
• A method of proving interpolation in paraconsistent extensions of the minimal logic
• Classification of extensions of the modal logic S4
• Constructive negations and paraconsistency
• Craig's theorem in superintuitionistic logics and amalgamable varieties of pseudo-Boolean algebras
• Decidability of the weak interpolation property over the minimal logic
• Interpolation and the projective Beth property in well-composed logics
• Pretabular superintuitionistic logic
• Problem of restricted interpolation in superintuitionistic and some modal logics
• Restricted interpolation over modal logic S4
• The decidability of Craig's interpolation property in well-composed J-logics
• The projective Beth property in well-composed logics
• Undecidable properties of extensions of provability logic. II

Cited in

(17)

• Hybrid extensions of the minimal logic
• Recognizable and perceptible logics and varieties
• Recognizability of all WIP-minimal logics
• The interpolation problem in finite-layered pre-Heyting logics
• Strong decidability and strong recognizability
• Layers over minimal logic
• Perceptibility in pre-Heyting logics
• Craig's interpolation property in pretabular logics
• Recognizability in pre-Heyting and well-composed logics
• Constructive classifications of modal logics and extensions of minimal logic
• Interpolation over the minimal logic and Odintsov intervals
• The structure of slices over minimal logic
• Extensions of the minimal logic and the interpolation problem
• The tabularity problem over the minimal logic
• Strong computability of slices over the logic GL
• Slices and levels of extensions of the minimal logic
• LC and its pretabular relatives

This page was built for publication: Recognizable logics

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