Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable

DOI10.1007/BF00370370zbMath0724.03017OpenAlexW2074144566MaRDI QIDQ2276947

Valentin Shehtman

Publication date: 1990

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00370370

zbMATH Keywords

coveringscolouringsmodal logicslogic of infinite problemsintermediate fragmentsMedvedev logic of finite problemsPrucnal's logic

Mathematics Subject Classification ID

Applications of graph theory (05C90) Modal logic (including the logic of norms) (03B45) Intermediate logics (03B55)

Related Items (5)

On modal logics of model-theoretic relations ⋮ On the modal logic of Jeffrey conditionalization ⋮ STANDARD BAYES LOGIC IS NOT FINITELY AXIOMATIZABLE ⋮ On the modal logic of subset and superset: tense logic over Medvedev frames ⋮ The modal logic of Bayesian belief revision

Cites Work

• Unnamed Item
• Unnamed Item
• On two problems of Harvey Friedman
• Logics of some Kripke frames connected with Medvedev notion of informational types
• An ascending chain of S4 logics
• One hundred and two problems in mathematical logic
• An incomplete logic containing S4
• Modal Logics Between S 4 and S 5
• The decidability of the Kreisel-Putnam system
• Some theorems about the sentential calculi of Lewis and Heyting

This page was built for publication: Modal counterparts of Medvedev logic of finite problems are not finitely axiomatizable