Jankov's theorems for intermediate logics in the setting of universal models
| Authors |
|
|---|---|
| Publication date | 2011 |
| Host editors |
|
| Book title | Logic, Language, and Computation |
| Book subtitle | 8th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2009, Bakuriani, Georgia, September 21-25 2009 : revised selected papers |
| ISBN |
|
| ISBN (electronic) |
|
| Series | Lecture Notes in Computer Science |
| Event | TbiLLC2009: 8th Internation Symposium of Logic, Language and Computation |
| Pages (from-to) | 53-76 |
| Publisher | Heidelberg: Springer |
| Organisations |
|
| Abstract |
In this article we prove two well-known theorems of Jankov in a uniform frame-theoretic manner. In frame-theoretic terms, the first one states that for each finite rooted intuitionistic frame there is a formula ψ with the property that this frame can be found in any counter-model for ψ in the sense that each descriptive frame that falsifies ψ will have this frame as the p-morphic image of a generated subframe ([12]). The second one states that KC, the logic of weak excluded middle, is the strongest logic extending intuitionistic logic IPC that proves no negation-free formulas beyond IPC ([13]). The proofs use a simple frame-theoretic exposition of the fact discussed and proved in [4] that the upper part of the n-Henkin model H(n)(n) is isomorphic to the n-universal model U(n)(n) of IPC. Our methods allow us to extend the second theorem to many logics L for which L and L + KC prove the same negation-free formulas. All these results except the last one earlier occurred in a somewhat different form in [16].
|
| Document type | Conference contribution |
| Language | English |
| Published at | https://doi.org/10.1007/978-3-642-22303-7_5 |
| Permalink to this page | |