A Gödel-Dugundji-style theorem for the minimal structural logic
From MaRDI portal
Cites work
- 8 valued non-deterministic semantics for modal logics
- A hierarchy of classical and paraconsistent logics
- A non-deterministic view on non-classical negations
- A note on Ciuciura's \(\mathbf{mbC}^1\)
- A pretabular classical relevance logic
- Characterizing finite-valuedness
- Dugundji's theorem revisited
- Effective semantics for the modal logics K and KT via non-deterministic matrices
- Finite non-deterministic semantics for some modal systems
- Five critical modal systems
- From Inconsistency to Incompatibility
- scientific article; zbMATH DE number 5872190 (Why is no real title available?)
- scientific article; zbMATH DE number 5997431 (Why is no real title available?)
- scientific article; zbMATH DE number 4055579 (Why is no real title available?)
- scientific article; zbMATH DE number 3668604 (Why is no real title available?)
- scientific article; zbMATH DE number 120342 (Why is no real title available?)
- scientific article; zbMATH DE number 3485746 (Why is no real title available?)
- scientific article; zbMATH DE number 3591947 (Why is no real title available?)
- scientific article; zbMATH DE number 3598472 (Why is no real title available?)
- scientific article; zbMATH DE number 3300568 (Why is no real title available?)
- scientific article; zbMATH DE number 4187771 (Why is no real title available?)
- scientific article; zbMATH DE number 7713503 (Why is no real title available?)
- Les rapports de la logique polyvalente avec le calcul des probabilités.
- Logic of informal provability with truth values
- Logical matrices and non-structural consequence operators
- Many-valued logic of informal provability: a non-deterministic strategy
- Modal semantics without possible worlds
- Non-deterministic logic of informal provability has no finite characterization
- Non-deterministic semantics for logics with a consistency operator
- Note on a property of matrices for Lewis and Langford's calculi of propositions.
- On non-deterministic quantification
- Paraconsistent logic: consistency, contradiction and negation
- Pretabular extensions of Lewis S4
- Pretabular superintuitionistic logic
- Proof systems for BAT consequence relations
- Quasi-truth-functional systems of propositional logic
- ST, LP and tolerant metainferences
- Symbolic and Quantitative Approaches to Reasoning with Uncertainty
- The tabularity problem over the minimal logic
- There exists an uncountable set of pretabular extensions of the relevant logic R and each logic of this set is generated by a variety of finite height
- Tolerant, classical, strict
- Truth tables for modal logics T and S4, by using three-valued non-deterministic level semantics
- Two decision procedures for da Costa's \(C_n\) Logics based on restricted Nmatrix semantics
- Two pretabular linear extensions of relevance logic R
- Wahrscheinlichkeitslehre.
- Wahrscheinlichkeitslogik als Form wissenschaftlichen Denkens.
- What is a non-truth-functional logic?
- Why conclusions should remain single
- Zum intuitionistischen Aussagekalkül.
This page was built for publication: A Gödel-Dugundji-style theorem for the minimal structural logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6909874)
