Strong computability of slices over the logic GL
From MaRDI portal
Publication:1707569
Recommendations
Cites work
- scientific article; zbMATH DE number 2184446 (Why is no real title available?)
- scientific article; zbMATH DE number 3300568 (Why is no real title available?)
- scientific article; zbMATH DE number 3417441 (Why is no real title available?)
- scientific article; zbMATH DE number 3024119 (Why is no real title available?)
- A method of proving interpolation in paraconsistent extensions of the minimal logic
- Constructive negations and paraconsistency
- Interpolation and definability over the logic Gl
- Layers over minimal logic
- Recognizable logics
- Slices and levels of extensions of the minimal logic
- Strong decidability and strong recognizability
- Strongly decidable properties of modal and intuitionistic calculi
- The structure of slices over minimal logic
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)