2015
DOI: 10.1017/jsl.2014.59
|View full text |Cite
|
Sign up to set email alerts
|

TOPOLOGICAL COMPLETENESS OF LOGICS ABOVES4

Abstract: It is a celebrated result of McKinsey and Tarski [28] that S4 is the logic of the closure algebra X + over any dense-in-itself separable metrizable space. In particular, S4 is the logic of the closure algebra over the reals R, the rationals Q, or the Cantor space C. By [5], each logic above S4 that has the finite model property is the logic of a subalgebra of Q + , as well as the logic of a subalgebra of C + . This is no longer true for R, and the main result of [5] states that each connected logic above S4 w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
8
0

Year Published

2016
2016
2020
2020

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(8 citation statements)
references
References 27 publications
0
8
0
Order By: Relevance
“…Our present interest in the infinite binary tree stems from the following lemma, proved in Bezhanishvili et al, (2015). What follows is a sketch of the proof given there; for full details, the reader should consult Bezhanishvili et al, (2015), Lemma 5.4. LEMMA 4.2.…”
Section: If B Is Open and B ≤ A Then B ≤ I Amentioning
confidence: 99%
See 4 more Smart Citations
“…Our present interest in the infinite binary tree stems from the following lemma, proved in Bezhanishvili et al, (2015). What follows is a sketch of the proof given there; for full details, the reader should consult Bezhanishvili et al, (2015), Lemma 5.4. LEMMA 4.2.…”
Section: If B Is Open and B ≤ A Then B ≤ I Amentioning
confidence: 99%
“…Although for any logic L above S4, each nontheorem of L can be refuted in some general frame over the infinite binary tree 2 <ω , it is not the case that each logic above S4 is the logic of a subalgebra of B(2 <ω ). For further discussion, see Bezhanishvili et al, (2015). Proof.…”
Section: If B Is Open and B ≤ A Then B ≤ I Amentioning
confidence: 99%
See 3 more Smart Citations