Recognizability in pre-Heyting and well-composed logics

DOI10.33048/SEMI.2019.16.024zbMATH Open1432.03018OpenAlexW3015191523MaRDI QIDQ2003246FDOQ2003246

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

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

zbMATH Keywords

recognizabilityHeyting algebracalculusminimal logicsuperintuitionistic logicJohansson algebrapre-Heyting logicstrong recognizability

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (2)

• 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)