Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable
From MaRDI portal
Publication:2276947
The author considers modal logics whose intermediate fragments lie between the logic of infinite problems and the Medvedev logic of finite problems. There is a continuum of such logics. He proves that none of them is finitely axiomatizable. The proof is based on some graph- theoretic constructions (operations on coverings, and colourings).
Recommendations
- On the Independent Axiomatizability of Modal and Intermediate Logics
- Finite and finitely separable intermediate propositional logics
- On non-finite axiomatization of \(n\)-modal logics between \(\mathbf{K}^n\) and \(\mathbf{S}5^n\) for finite \(n \geq 3\)
- Non-finitely axiomatisable two-dimensional modal logics
- Non-finitely axiomatisable modal product logics with infinite canonical axiomatisations
Cites work
- An ascending chain of S4 logics
- An incomplete logic containing S4
- scientific article; zbMATH DE number 3485746 (Why is no real title available?)
- scientific article; zbMATH DE number 3198011 (Why is no real title available?)
- Logics of some Kripke frames connected with Medvedev notion of informational types
- Modal Logics Between S 4 and S 5
- On two problems of Harvey Friedman
- One hundred and two problems in mathematical logic
- Some theorems about the sentential calculi of Lewis and Heyting
- The decidability of the Kreisel-Putnam system
Cited in
(13)- Not every ``tabular predicate logic is finitely axiomatizable
- On the modal logic of Jeffrey conditionalization
- The modal logic of Bayesian belief revision
- scientific article; zbMATH DE number 5295707 (Why is no real title available?)
- scientific article; zbMATH DE number 1354106 (Why is no real title available?)
- scientific article; zbMATH DE number 1975415 (Why is no real title available?)
- On the Independent Axiomatizability of Modal and Intermediate Logics
- On non-finite axiomatization of \(n\)-modal logics between \(\mathbf{K}^n\) and \(\mathbf{S}5^n\) for finite \(n \geq 3\)
- Standard Bayes logic is not finitely axiomatizable
- On the modal logic of subset and superset: tense logic over Medvedev frames
- Medvedev's logic and products of converse well orders
- Modal and intermediate logics of spiked Boolean algebras
- On modal logics of model-theoretic relations
This page was built for publication: Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2276947)
