An incomplete system of modal logic
The authors present a new system of modal propositional logic, called GH, that is incomplete in the following sense: there is a sentence that is not a theorem of GH even though it is valid in every frame in which all theorems of GH are valid. This result is discussed with regard to the interpretation of '\(\square '\) as provability. The characteristic axiom of GH may then be read as saying that the sentences which are provably equivalent to their own provability are in fact provable. It is thus a formalized answer to \textit{L. Henkin}'s question in A problem concerning provability [J. Symb. Logic 17, 160 (1952)], and it is closely related to Löb's theorem.
- Magari's theorem via the recession frame
- Topology and duality in modal logic
- Some descending chains of incomplete modal logics
- Mathematical modal logic: A view of its evolution
- The incompleteness of RGL
- Neighborhood hypergraph based classification algorithm for incomplete information system
- A simple incomplete extension of T which is the union of two complete modal logics with f. m. p
- Elementary canonical formulae: extending Sahlqvist's theorem
- The Henkin sentence
- Infinitary combinatorics and modal logic
- An incomplete decidable modal logic
- scientific article; zbMATH DE number 2020141 (Why is no real title available?)
- COMPLETE ADDITIVITY AND MODAL INCOMPLETENESS
- Coalgebraic semantics of modal logics: an overview
- Nonconservative extensions by propositional quantifiers and modal incompleteness
- Kripke incomplete logics containing KTB
This page was built for publication: An incomplete system of modal logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1073780)