Recognizability in pre-Heyting and well-composed logics

DOI10.33048/semi.2019.16.024zbMath1432.03018OpenAlexW3015191523MaRDI QIDQ2003246

Veta Fedorovna Yun, Larisa L. Maksimova

Publication date: 16 July 2019

Published in: Sibirskie Èlektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

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

zbMATH Keywords

calculusHeyting algebrasuperintuitionistic logicrecognizabilityminimal logicJohansson algebrapre-Heyting logicstrong recognizability

Mathematics Subject Classification ID

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

Related Items (1)

Perceptibility in pre-Heyting logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
• Recognizable and perceptible logics and varieties
• Recognizable logics
• Constructive negations and paraconsistency
• Admissibility of logical inference rules
• Strong decidability and strong recognizability
• Calculi over minimal logic and nonembeddability of algebras
• Strongly decidable properties of modal and intuitionistic calculi

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