Strong computability of slices over the logic GL
DOI10.17377/SEMI.2018.15.005zbMATH Open1397.03048OpenAlexW3174714985MaRDI QIDQ1707569FDOQ1707569
Authors: L. L. Maksimova, Veta Fedorovna Yun
Publication date: 3 April 2018
Published in: Sibirskie Elektronnye 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
Recommendations
Cites Work
- Constructive negations and paraconsistency
- Title not available (Why is that?)
- A method of proving interpolation in paraconsistent extensions of the minimal logic
- Interpolation and definability over the logic Gl
- Title not available (Why is that?)
- Recognizable logics
- Layers over minimal logic
- The structure of slices over minimal logic
- Title not available (Why is that?)
- Strong decidability and strong recognizability
- Strongly decidable properties of modal and intuitionistic calculi
- Slices and levels of extensions of the minimal logic
- Title not available (Why is that?)
Cited In (5)
This page was built for publication: Strong computability of slices over the logic GL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1707569)