Strong computability of slices over the logic GL

DOI10.17377/semi.2018.15.005zbMath1397.03048OpenAlexW3174714985MaRDI QIDQ1707569

Larisa L. Maksimova, Veta Fedorovna Yun

Publication date: 3 April 2018

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

Full work available at URL: https://research.nsu.ru/en/publications/%D1%81%D0%B8%D0%BB%D1%8C%D0%BD%D0%B0%D1%8F-%D0%B2%D1%8B%D1%87%D0%B8%D1%81%D0%BB%D0%B8%D0%BC%D0%BE%D1%81%D1%82%D1%8C-%D1%81%D0%BB%D0%BE%D0%B5%D0%B2-%D0%BD%D0%B0%D0%B4-%D0%BB%D0%BE%D0%B3%D0%B8%D0%BA%D0%BE%D0%B9-gl

zbMATH Keywords

decidabilityKripke frameminimal logicslicesrecognizable logic

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Paraconsistent logics (03B53)

Related Items (1)

Constructive classifications of modal logics and extensions of minimal logic

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The structure of slices over minimal logic
• Interpolation and definability over the logic Gl
• Recognizable logics
• Constructive negations and paraconsistency
• Strong decidability and strong recognizability
• Slices and levels of extensions of the minimal logic
• Layers over minimal logic
• A method of proving interpolation in paraconsistent extensions of the minimal logic
• Strongly decidable properties of modal and intuitionistic calculi

This page was built for publication: Strong computability of slices over the logic GL