Recognizability in pre-Heyting and well-composed logics

DOI10.33048/SEMI.2019.16.024MaRDI QIDQ2003246zbMATH OpenOpenAlexFDO

Authors Veta Fedorovna Yun, L. L. Maksimova

Publication date 16 July 2019

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33048/semi.2019.16.024

zbMATH Keywords

recognizabilityHeyting algebracalculusminimal logicsuperintuitionistic logicJohansson algebrapre-Heyting logicstrong recognizability

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20)

Recommendations

• Perceptibility in pre-Heyting logics
• Recognizable logics
• Strong decidability and strong recognizability
• Recognizability of all WIP-minimal logics
• Extensions of the minimal logic and the interpolation problem

Cites work

• scientific article; zbMATH DE number 2047484 (Why is no real title available?)
• scientific article; zbMATH DE number 2154091 (Why is no real title available?)
• Admissibility of logical inference rules
• Calculi over minimal logic and nonembeddability of algebras
• Constructive negations and paraconsistency
• Recognizable and perceptible logics and varieties
• Recognizable logics
• Strong decidability and strong recognizability
• 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

(3)

• Strong decidability and strong recognizability
• Perceptibility in pre-Heyting logics
• Recognizable logics

This page was built for publication: Recognizability in pre-Heyting and well-composed logics

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