The tabularity problem over the minimal logic

DOI10.1134/S0037446616060100zbMath1420.03024OpenAlexW2567507395MaRDI QIDQ515492

Veta Fedorovna Yun, Larisa L. Maksimova

Publication date: 16 March 2017

Published in: Siberian Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0037446616060100

zbMATH Keywords

decidabilityminimal logicpretabular logicrecognizable logictabularity

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items

Craig's interpolation property in pretabular logics ⋮ Two pretabular linear extensions of relevance logic R ⋮ Recognizable and perceptible logics and varieties ⋮ Constructive classifications of modal logics and extensions of minimal logic

Cites Work

• Recognizable logics
• Pretabular varieties of modal algebras
• Complexity of some problems in positive and related calculi
• Pretabular superintuitionistic logic
• Layers over minimal logic
• A propositional calculus with denumerable matrix
• A method of proving interpolation in paraconsistent extensions of the minimal logic
• Complexity of interpolation and related problems in positive calculi
• Computer Science Logic
• Algebraic Completeness Results for Dummett's LC and Its Extensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item