Dugundji's theorem revisited
According to \textit{J. Dugundji}'s well-known theorem [J. Symb. Log. 5, 150--151 (1940; Zbl 0024.09703)], no system between \({\mathbf {S1}}\) and \({\mathbf {S5}}\) can be characterized by finite matrices. The authors recall this classical result and its proof, and show how it can be extended to a wider spectrum of modal systems. Namely, they demonstrate that no system between \({\mathbf {S0.5}}^0\) and \({\mathbf {S5}}\) (Theorem 5.3), as well as between \({\mathbf {C2}}\) and \({\mathbf {S5}}\) (Theorem 5.4), as well as between \({\mathbf K}\) and \({\mathbf {GL}}\) (Theorem 5.8), whose non-modal fragment is between \({\mathbf PC}^\supset\) and \({\mathbf {PC}}\), can be characterized by finite matrices. Here, \({\mathbf K}\) is the minimal system of normal modal logic, \({\mathbf {GL}} ={\mathbf K} + \square p \supset \square\square p + \square(\square p \supset p) \supset \square p\), and \({\mathbf {PC}}^\supset\) is the implicational fragment of classical propositional calculus. The authors further consider the so-called \textit{tabularity property} by \textit{A. Chagrov} and \textit{M. Zakharyaschev} [Modal logic. Oxford: Clarendon Press (1997; Zbl 0871.03007)], according to which a modal system is tabular if and only if it can be characterized by a finite Kripke frame. They show that no extension of \({\mathbf K}\) contained in \({\mathbf {GL}}\) is tabular.
- The extensions of the modal logic K5
- A simple propositional \(\text{S}5\) tableau system
- Modal tableau calculi and interpolation
- On modal logics betweenK × K × KandS5 × S5 × S5
- scientific article; zbMATH DE number 3895038
- scientific article; zbMATH DE number 1612561
- scientific article; zbMATH DE number 2072494
- All finitely axiomatizable subframe logics containing the provability logic CSM₀ are decidable
- Finite non-deterministic semantics for some modal systems
- A simple incomplete extension of T which is the union of two complete modal logics with f. m. p
- A new four-valued approach to modal logic
- A reduction in number of the postulates for C. I. Lewis’ system of strict implication
- Algebraic semantics for modal logics I
- Extensions of the Lewis system S5
- Family K of the non-Lewis modal systems
- Five critical modal systems
- Fragments of the propositional calculus
- scientific article; zbMATH DE number 1003731 (Why is no real title available?)
- scientific article; zbMATH DE number 3950473 (Why is no real title available?)
- scientific article; zbMATH DE number 755666 (Why is no real title available?)
- scientific article; zbMATH DE number 3335866 (Why is no real title available?)
- scientific article; zbMATH DE number 3402571 (Why is no real title available?)
- Modalities and multimodalities. With the assistance and collaboration of Juliana Bueno-Soler.
- New foundations for Lewis modal systems
- Note on a property of matrices for Lewis and Langford's calculi of propositions
- Representation and duality theory for diagonalizable algebras. (The algebraization of theories which express Theor. IV.)
- Non-deterministic logic of informal provability has no finite characterization
- Tree-like proof systems for finitely-many valued non-deterministic consequence relations
- Theorems of Kakutani and Dyson revisited
- scientific article; zbMATH DE number 1665445 (Why is no real title available?)
- The Dipper-Du conjecture revisited
- Finite non-deterministic semantics for some modal systems
- scientific article; zbMATH DE number 2096884 (Why is no real title available?)
- scientific article; zbMATH DE number 850205 (Why is no real title available?)
- Modal logic with non-deterministic semantics. I: Propositional case
- Douglas factorization theorem revisited
- FRACTIONAL-VALUED MODAL LOGIC
- Many-valued modalities and paraconsistency
- Theory matrices (for modal logics) using alphabetical monotonicity
- A modal axiomatization of \(\mathbf{BK}\)
- A Gödel-Dugundji-style theorem for the minimal structural logic
- Boolean and modal connectives as primitives in non-deterministic semantics
This page was built for publication: Dugundji's theorem revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254571)