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

Studia Logica 49 (3):365 - 385 (1990)
  Copy   BIBTEX

Abstract

We consider modal logics whose intermediate fragments lie between the logic of infinite problems [20] and the Medvedev logic of finite problems [15]. There is continuum of such logics [19]. We prove that none of them is finitely axiomatizable. The proof is based on methods from [12] and makes use of some graph-theoretic constructions (operations on coverings, and colourings).

Categories

Keywords

Reprint years

DOI

10.1007/bf00370370

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Standard bayes logic is not finitely axiomatizable.Zalán Gyenis - 2020 - Review of Symbolic Logic 13 (2):326-337.
On the Modal Logic of Subset and Superset: Tense Logic over Medvedev Frames.Wesley H. Holliday - 2017 - Studia Logica 105 (1):13-35.
Logics of some kripke frames connected with Medvedev notion of informational types.V. B. Shehtman & D. P. Skvortsov - 1986 - Studia Logica 45 (1):101-118.
Arrow logic and infinite counting.Ágnes Kurucz - 2000 - Studia Logica 65 (2):199-222.
FMP-Ensuring Logics, RA-Ensuring Logics and FA-Ensuring Logics in $$\text {NExtK4.3}$$.Ming Xu - 2023 - Studia Logica 111 (6):899-946.
More on d-Logics of Subspaces of the Rational Numbers.Guram Bezhanishvili & Joel Lucero-Bryan - 2012 - Notre Dame Journal of Formal Logic 53 (3):319-345.
On modal logics between {$\roman K\times\roman K\times \roman K$} and {${\rm S}5\times{\rm S}5\times{\rm S}5$}.Robin Hirsch, I. Hodkinson & A. Kurucz - 2002 - Journal of Symbolic Logic 67 (1):221-234.
The Modal Logic of Bayesian Belief Revision.William Brown, Zalán Gyenis & Miklós Rédei - 2019 - Journal of Philosophical Logic 48 (5):809-824.
All Finitely Axiomatizable Normal Extensions of K4.3 are Decidable.Michael Zakharyaschevm & Alexander Alekseev - 1995 - Mathematical Logic Quarterly 41 (1):15-23.
Finite axiomatizability of logics of distributive lattices with negation.Sérgio Marcelino & Umberto Rivieccio - forthcoming - Logic Journal of the IGPL.

Analytics

Added to PP
2009-01-28

Downloads
73 (#298,031)

6 months
11 (#246,005)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Valentin Shehtman
Moscow State University

Citations of this work

The Modal Logic of Bayesian Belief Revision.William Brown, Zalán Gyenis & Miklós Rédei - 2019 - Journal of Philosophical Logic 48 (5):809-824.
Standard bayes logic is not finitely axiomatizable.Zalán Gyenis - 2020 - Review of Symbolic Logic 13 (2):326-337.
On the Modal Logic of Jeffrey Conditionalization.Zalán Gyenis - 2018 - Logica Universalis 12 (3-4):351-374.

View all 6 citations / Add more citations

References found in this work

An essay in classical modal logic.Krister Segerberg - 1971 - Uppsala,: Filosofiska föreningen och Filosofiska institutionen vid Uppsala universitet.
An incomplete logic containing S.Kit Fine - 1974 - Theoria 40 (1):23-29.
One hundred and two problems in mathematical logic.Harvey Friedman - 1975 - Journal of Symbolic Logic 40 (2):113-129.
Modal Logics Between S 4 and S 5.M. A. E. Dummett & E. J. Lemmon - 1959 - Mathematical Logic Quarterly 5 (14-24):250-264.

View all 9 references / Add more references