Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable (Q2276947)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable |
scientific article |
Statements
Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable (English)
0 references
1990
0 references
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).
0 references
Prucnal's logic
0 references
modal logics
0 references
intermediate fragments
0 references
logic of infinite problems
0 references
Medvedev logic of finite problems
0 references
coverings
0 references
colourings
0 references
