Strong decidability and strong recognizability
From MaRDI portal
Publication:1703280
DOI10.1007/S10469-017-9459-0zbMATH Open1420.03046OpenAlexW2771865035MaRDI QIDQ1703280FDOQ1703280
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
Recommendations
Cites Work
- Admissibility of logical inference rules
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constructive negations and paraconsistency
- Title not available (Why is that?)
- Recognizable logics
- Negative equivalence over the minimal logic and interpolation
- Algebraic Completeness Results for Dummett's LC and Its Extensions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Strongly decidable properties of modal and intuitionistic calculi
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)
