[

[

Tomáš Lávička The Czech Academy of Sciences
Institute of Information Theory and Automation
Pod vodárenskou věží 4
182 07 Praha, Czech Republic
Jonathan L. Verner Department of Logic
Faculty of Arts
Charles University
Palachovo nám. 2
116 38 Praha 1 Czech Republic
Abstract

We show in ZFC that the existence of completely separable maximal almost disjoint families of subsets of implies that the modal logic is complete with respect to the Čech-Stone compactification of the natural numbers, the space . In the same fashion we prove that the modal logic is complete with respect to the space . This improves the results of G. Bezhanishvili and J. Harding in [Bezhanishvili:2009], where the authors prove these theorems under stronger assumptions (). Our proof is also somewhat simpler.

\swapnumbers\theoremstyle

definition \theoremstyleremark Topological models of Intuitionistic logic]Completely separably MAD families
and the modal logic of \revauthorLávička, Tomáš \revauthorVerner, Jonathan L. thanks: The research of the first author was supported by project no. GA17-04630S of the Czech Science Foundation. The research of the second author was supported by FWF-GAČR grant no. 17-33849L: Filters, Ultrafilters and Connections with Forcing. \tikzcdset arrow style=tikz, diagrams=>=Straight Barb[scale=0.8]

1 Introduction

Topological semantics appeared as one of the first semantics for both intuitionistic logic and modal logic . First, in 1938, Tarski, in his pioneering work [Tarski:1938], proved that intuitionistic logic is complete with respect to all topological spaces (propositions are interpreted as open sets). He also obtained the remarkable result that any dense-it-itself metrizable space (e.g. the Cantor space or the real line ), is complete for . Later in 1944 he and McKinsey in their famous paper [Tarski:1944] proved an analogous results for the modal logic . Recently in [Bezhanishvili:2009] G. Bezhanishvili and J. Harding described logical counterparts of the important spaces and , which turned out to correspond to modal logics and respectively. However their proof needed the additional assumption that , i.e. the statement that every infinite maximal almost disjoint family of subsets of has cardinality of continuum .

The main part of the proof of the completeness theorem resides in proving that there exists a surjective interior map from (resp.  onto any finite tree with an additional top element (resp. any finite tree) where the topology of the target space is the upset topology. Additionally one also needs to guarantee that the fibers of the map are crowded in . In this paper we present a simpler construction of the map (and, consequently, prove the aforementioned completeness results). Moreover our proof relies on weaker assumptions, namely that there exists a completely separable maximal almost disjoint family of subsets of . It is still an open problem whether completely separable maximal almost disjoint families exist in ZFC.

The content of this paper is organized as follows: in the preliminary section we recall basic notions concerning modal logics and their relational and topological completeness. We then describe the so called interior map strategy (see also [Bezhanishvili:2009]) which we use to prove the main completeness theorems. The introductory part is concluded by recalling some basic facts about the topology of and almost disjoint families. In the second section we construct the interior map and then we use this map in the last section to prove the main completeness results.

2 Preliminaries

Modal logics111In general a logic in a language is just a structural consequence relation between sets of formulas of and formulas of . are presented using the standard modal language which consists of connectives of classical logic, a unary connective expressing necessity, and the connective expressing possibility, which is defined as . The collection of all modal formulas is denoted as . Global modal logic can by axiomatized by any axiomatization of classical logic plus the following schemata of axioms for the modal operator:

(K) □(φ→ψ)→(□φ→□ψ) □φ→φ □φ→□□φ

and the Necessitation rule . We write if there is a proof of from the set of formulas . The modal logic has the same presentation with an additional axiom

 □◊φ↔◊□φ.

We write for the provability relation in .

2.1 Topological semantics

Definition 2.2

Let be a topological space. A topological model on is a tuple , where is a relation between elements of and modal formulas which, for every and formulas , , satisfies:

• if and only if and .

• if and only if or .

• if and only if or .

• if and only if .

• if and only if .

From the above and the definition of we also have:

• if and only .

We say that a (modal) formula is valid in (or that satisfies , written ) if for every , .

Given a class of topological spaces we define the corresponding consequence relation as follows: if and only if for every and every topological model on if satisfies all formulas in then it also satisfies . When we write (instead of ).

Remark

Given a topological model , let . Observe that and . In other words is interpreted as the topological interior operation and as the closure operation.

Definition 2.3

We say that a modal logic is complete with respect to the class of spaces if for every we have .

To describe completeness results for the logics and , we first recall that a quasi-order is called a quasi-tree if the canonical quotient order of is a tree.

Notation

We denote by (resp. ) the class of all finite trees (resp. finite trees with an additional top element ) regarded as topological spaces with the topology given by upward closed sets in the tree order. The notation (resp. ) stands for the analogous classes corresponding to quasi-trees instead of trees.

Then, the modal logic (resp. ) is known to be complete with respect to the class (resp. ). In symbols: for every

 Γ⊢S4φ⟺Γ⊨QTφ. (1)
 Γ⊢S4.1.2φ⟺Γ⊨QT∗φ, (2)

For proofs and more information on topological semantics for modal logics see [Aiello:2003] or [Benthem:2007].

2.4 The interior map strategy

We describe a general method (the interior map strategy) which can be used to obtain new completeness results with respect to topological spaces from already existing ones (e.g. that is complete with respect to the Cantor space or the real line , see [Aiello:2003]).

Recall that a function between two topological spaces if called an interior map if it is both continuous and open. It is not hard to prove that interior maps preserve topological consequence:

Proposition 2.5 ([Gabelaia:2001])

Let be an interior map from onto and . Then implies .

To prove a completeness result we typically need to show that if a formula is not provable, then there is a model which serves as a counterexample. The above proposition allows us to transfer counterexamples from one space to another. This is the idea of the interior map strategy.

2.6 The space βω

Recall that the space , the Čech-Stone compactification of the countable discrete space , can be naturally identified (via Stone duality), with the set of all ultrafilters on . The topology is given by basic (cl)open sets of the form

 ^A={U∈βω:A∈U},

for some set . The space is a compact, extremally disconnected, zero-dimensional, topological space. The subspace consisting of all nonprincipal ultrafilters is denoted . It is a compact zerodimensional space homeomorphic to the Stone space of the algebra .

The space is very rich—it contains homeomorphic copies of many spaces. The following theorem of P. Simon gives a rough idea what to expect.

Theorem ([Simon:1985])

Every extremally disconnected compact space of weight can be homeomorphically embedded into such that the image is a weak P-set.

Also, since each is obviously isomorphic to , these copies are in fact dense.

2.7 Trees

We will also need some standard definitions regarding trees. A set together with a partial order is a tree if is well-ordered by for every . Elements of the tree are called nodes. The height of a node , denoted , is the rank of . Given we write for the set of immediate successors of in and for the set of “descendants” of (note that contrary to common usage does not include the predecessors of ).

2.8 Almost Disjoint Families

Almost disjoint families will be the main tool in our construction of an interior map. Here we collect some basic facts about them.

Definition 2.9

A family is an almost disjoint family (AD for short) if for each . An infinite maximal (w.r.t. inclusion) AD family is called a maximal almost disjoint family (MAD for short).

Given an AD family we denote by the ideal on generated by sets in together with all finite sets. It is natural to ask what are the possible sizes of a MAD family. It is not hard to see that every MAD family must be uncountable and have size at most . The minimal possible size of a MAD family

is called the almost disjoint number. It can consistently be strictly smaller than . However, MAD families of size always exist. To see this consider the family of branches of the full binary tree of height . This is clearly an AD family (on the countable set of nodes of the binary tree) of size . Then, by the axiom of choice, it can be extended to a MAD family.

The construction of the surjective map in [Bezhanishvili:2009] uses the assumption which guarantees that any small AD family cannot be maximal. This allows them to recursively construct a MAD family dealing with -many tasks. If , then the construction might run into a dead-end by constructing a MAD family before all tasks are met.

We will use a different approach, relying on the following concept:

Definition 2.10

An AD family is completely separable if for every either is almost disjoint with each element of or there is such that or, equivalently, there are -may such s (recall that means that ).

Notice that if is a MAD family then the first alternative cannot hold. A completely separable MAD family will be instrumental in our proof. While it is easy to construct a completely separable AD family by transfinite recursion, it is a long-standing open question whether there is, in ZFC, a completely separable MAD family. Their existence easily follows from . Recently (see [Shelah:2011:MAD], and others), they have been shown to exist under various much weaker assumption, e.g. if , but it is conceivable, that their existence is outright provable in ZFC. For more on this topic see, e.g., the survey paper [Hrusak:2007].

Finally, we finish with a simple technical lemma (observation, really), which will be important in the next section.

Lemma 2.11

Assume is an infinite AD family of infinite subsets of . Then the set

 Z=ω∗∩^X∖⋃{^A:A∈A}

is a compact subspace of without isolated points.

{proof}

The set is closed and hence compact. To see that it has no isolated points let and a neighbourhood of . There are two cases. Either

 p∉¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯⋃{^A:A∈A}.

Then there must be an such that is almost disjoint from . Then is a clopen neighbourhood of in so, in particular, is not an isolated point.

Dealing with the second case assume that

 p∈¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯⋃{^A:A∈A}∖⋃{^A:A∈A}

It follows that can’t be almost disjoint from and can’t be almost covered by finitely many elements of either. Pick a countable family such that is infinite for each . Let

 Bn=B′n∖⋃i

and partition each into two disjoint infinite subsets and and let

 C=⋃n<ωCn,D=⋃n<ωDn.

Then are disjoint so at most one can be an element of . Without loss of generality assume that . Notice that cannot be almost covered by finitely many elements of (because it hits each in an infinite set and is almost disjoint) so

 E=^C∖⋃{^A:A∈A}≠∅.

In particular there is . Since necessarily . So . Since was an arbitrary clopen neighbourhood of this finishes the proof that is not isolated in .

3 The interior map construction

The aim of this section is to prove the following theorem:

Theorem 3.1

Assume there is a completely separable MAD family. Then for every there is a surjective interior map from onto .

{proof}

For each we will recursively construct an almost disjoint family as follows.

First, for notational convenience, we introduce a unique formal predecessor of in and we denote it by . For this element we let . Assume now that has been constructed for some non-leaf node . Partition each element arbitrarily into -many infinite pieces:

 A=⋃t∈succT(s)A(t),

and for each and let be a completely separable MAD family on , which exists by our assumption. Finally, for let

 At=⋃A∈AsA(t,A).

This finishes the recursive construction.

Next we define the map . The isolated points in are mapped to the top element, and for each we map

 ω∗∩⋃A∈As^A(t)∖⋃{^B:B∈A(t,A)} (3)

onto . Finally, if is a leaf node, we also map

 ω∗∩⋃{^B:B∈A(t,A)} (4)

onto . It is clear that the map is well-defined.

Claim 3.2

If then

 f−1[Tt]=ω∗∩⋃A∈As^A(t)
{proof}

[proof of Claim] We prove the claim by induction on the distance of from the top. For leaf nodes (distance 0), the claim follows immediately from 3. Note that

 f−1[Tt]=⎛⎝f−1(t)∪⋃t′∈succT(t)f−1[Tt′].⎞⎠

Expanding the definitions we get

 f−1[Tt]=ω∗∩⎛⎝⋃A∈As^A(t)∖⋃{^B:B∈A(t,A)}∪⋃t′∈succT(t)f−1[Tt′]⎞⎠, (5)

finally, by the inductive assumption (applied to ) and by the definition of , we have

 f−1[Tt′]=ω∗∩⋃B∈At^B(t)=ω∗∩⋃A∈As⋃B∈A(t,A)^B(t) (6)

Putting together (5) and (6) gives the claim. From the claim it immediately follows that the map is continuous. It is clearly onto so it remains to show that it is open. First it is clear that the image of every open set contains the top element. Now let and assume that for some . We need to show that . Again, we prove this by downward induction on the distance of from the top. For leaf nodes there is nothing to prove. So assume and that for and any with we have, by the inductive assumption, . It is then enough to show that for every . Pick a such that . Then, by (3), we have

 p∈⋃A∈As−^A(s)∖⋃{^B:B∈A(s,A)},

where is the predecessor of in (the predecessor of the root element being the formal element ). In particular for some , . Let . Since , necessarily

 p∉⋃{^B:B∈A(s,A(s))}.

It follows that cannot be covered by finitely many elements of the completely separable MAD on . By complete separability, there must be such that . So we have and so, a fortiori, .

Corollary 3.3

For every there is a surjective interior map from onto .

{proof}

This is precisely the Main Lemma and Corollary 4.10 from [Bezhanishvili:2009]. The idea is the following: let be given. Then there is a projection map from onto its quotient order . This projection is an interior map with respect to the corresponding upset topologies. By Theorem 3.1 there is an interior onto map . We prove there is a surjective interior map such that the following commute:

{tikzcd}βω\arrow

[dashrightarrow ,d, "g"’] \arrow[r,two heads, "f"] & X/_≈

Such a map exists because for each the subspace is -resolvable (i.e. it is a union of -many disjoint dense subsets) for every natural number , in particular for . Indeed looking at (3) in the definition of in Theorem 3.1 and lemma 2.11, is locally compact and has no isolated points. It is obviously Hausdorff so it is -resolvable by [Hewitt:1943, see comments on p. 332].

A straightforward modification of the above proofs gives (just restricting the map to whose image is the tree without the top element):

Corollary 3.4

For every there is a surjective interior map from onto .

4 Completeness results

Theorem 4.1

The Modal logic is the logic of the space .

{proof}

Completeness: suppose , then by \eqrefE:topcomplS4.1.2 we obtain . In other words for some we have . By Proposition 2.5 and Corollary 3.3 we conclude that .

Soundness: From we want to prove . This is an easy inductive argument on the complexity of the proof. In more detail: the axiom is valid in every space with a dense set of isolated points (see [Bezhanishvilli:2003]). The axiom is valid precisely in extremally disconnected spaces (see [Gabelaia:2001]).

Theorem 4.2

The Modal logic is the logic of the space .

{proof}

Completeness follows by essentially the same argument as in the proof of Theorem 4.1: we use \eqrefE:topcomplS4, Proposition 2.5, and Corollary 3.4.

Soundness follows from the fact that every topological space is sound w.r.t. the modal logic .

5 Conclusion

Let us mention that the completeness results for the modal logic (and , resp.) obtained in this paper translate into completeness results for intutionistic logic (and, resp., the Jankov’s logic —i.e. intuitionistic logic + the axiom of weak excluded middle ). For more details see [Bezhanishvili:2009]. The results can also be used to weaken the assumptions of many results from [Bezhanishvili:2012], where the authors discuss the logics of stone spaces in general. For other topological completeness results for modal logics see, e.g., [Bezhanishvili:2015, Bezhanishvili:2017].

While we needed to assume for our construction that there is a completely separable MAD family, we still think that this is not necessary. Unfortunately, we only have partial results in this direction: we know that Theorem 3.1 holds for trees of height without additional assumptions—the proof is analogous but in this case it is enough to consider -partitionable MAD families, which are known to exists in ZFC ([Douwen:1993b]); the theorem also holds for all binary trees (though with a very different proof using the fact, due to B. Balcar and P. Vojtáš ([Balcar:1980b], that every ultrafilter has an almost disjoint refinement222The fact that using almost disjoint refinements works is not entirely unexpected because a MAD family is completely separable iff it is an almost disjoint refinement of .). Of course, if it turns out that completely separable MAD families exist in ZFC, our construction will be a ZFC construction.

References

• [1] \bibfitemAiello:2003 \guyM.MarcoAiello, \guyJ.JohanvanBenthem, and \guyG.GuramBezhanishvili 20030 \guysmagicMarco Aiello, Johan van Benthem, \biband Guram Bezhanishvili Reasoning About Space: The Modal Way, Journal of Logic and Computation, vol.\weaktie13\yearmagic(2003), pp.\weaktie889–920. \TheSortKeyIsaiello marco van benthem johan bezhanishvili guram 2003 reasoning about space the modal way
• [2] \bibfitemBalcar:1980b \guyB.BohuslavBalcar and \guyP.PeterVojtáš 19800 \guysmagicBohuslav Balcar \biband Peter Vojtáš Almost disjoint refinement of families of subsets of , Proc. Amer. Math. Soc., vol.\weaktie79\yearmagic(1980), no.\weaktie3, pp.\weaktie465–470. \TheSortKeyIsbalcar bohuslav vojtavs peter 1980 almost disjoint refinement of families of subsets of bf n
• [3] \bibfitemBezhanishvili:2015 \guyG.GuramBezhanishvili, \guyN.NickBezhanishvili, \guyJ.JoelLucero-Bryan, and \guyJ.JanvanMill 20150 \guysmagicGuram Bezhanishvili, Nick Bezhanishvili, Joel Lucero-Bryan, \biband Jan van Mill S4.3 and hereditarily extremally disconnected spaces, Georgian Mathematical Journal, vol.\weaktie22\yearmagic(2015), no.\weaktie4, pp.\weaktie469–475. \TheSortKeyIsbezhanishvili guram bezhanishvili nick lucero bryan joel van mill jan 2015 s43 and hereditarily extremally disconnected spaces
• [4] \bibfitemBezhanishvili:2009 \guyG.GuramBezhanishvili and \guyJ.JohnHarding 20090 \guysmagicGuram Bezhanishvili \biband John Harding The modal logic of , Archive for Mathematical Logic, vol.\weaktie48\yearmagic(2009), no.\weaktie3, pp.\weaktie231–242. \TheSortKeyIsbezhanishvili guram harding john 2009 the modal logic of betamathbb n
• [5] \bibritemBezhanishvili:2012 \guyG.GuramBezhanishvili and \guyJ.JohnHarding 20120 \guysmagic\bysame Modal Logics of Stone Spaces, Order, vol.\weaktie29\yearmagic(2012), pp.\weaktie271–292. \TheSortKeyIsbezhanishvili guram harding john 2012 modal logics of stone spaces
• [6] \bibfitemBezhanishvilli:2003 \guyG.GuramBezhanishvili, \guyR.RayMines, and \guyP. J.Patrick J.Morandi 20030 \guysmagicGuram Bezhanishvili, Ray Mines, \biband Patrick J. Morandi Scattered, Hausdorff-reducible, and hereditarily irresolvable spaces, Topology and its Applications, vol.\weaktie132\yearmagic(2003), pp.\weaktie291–306. \TheSortKeyIsbezhanishvili guram mines ray morandi patrick j 2003 scattered hausdorff reducible and hereditarily irresolvable spaces
• [7] \bibfitemGabelaia:2001 \guyD.D.Gabelaia 20010 \guysmagicD. Gabelaia Modal Definability in topology, Master’s thesis, Institute of Logic, Language and Computation, University of Amsterdam\yearmagic,2001. \TheSortKeyIsgabelaia d 2001 modal definability in topology
• [8] \bibfitemHewitt:1943 \guyE.E.Hewitt 19430 \guysmagicE. Hewitt A problem of set-theoretic topology, Duke Mathematical Journal, vol.\weaktie10\yearmagic(1943), pp.\weaktie309–333. \TheSortKeyIshewitt e 1943 a problem of set theoretic topology
• [9] \bibfitemHrusak:2007 \guyM.MichaelHrusak and \guyP.PetrSimon 20070 \guysmagicMichael Hrusak \biband Petr Simon Completely separable MAD families, Open problems in topology. II\yearmagic,(2007), pp.\weaktie179–184. \TheSortKeyIshrusak michael simon petr 2007 completely separable mad families
• [10] \bibfitemShelah:2011:MAD \guyS.SaharonShelah 20110 \guysmagicSaharon Shelah MAD saturated families and SANE player, Canad. J. Math., vol.\weaktie63\yearmagic(2011), no.\weaktie6, pp.\weaktie1416–1435. \TheSortKeyIsshelah saharon 2011 mad saturated families and sane player
• [11] \bibfitemSimon:1985 \guyP.P.Simon 19850 \guysmagicP. Simon Applications of independent linked families, Colloqium Mathematicae Societas János Bolyai, vol.\weaktie41\yearmagic(1985), pp.\weaktie561–580. \TheSortKeyIssimon p 1985 applications of independent linked families
• [12] \bibfitemTarski:1938 \guyA.A.Tarski 19380 \guysmagicA. Tarski Der Aussagenkalkül und die Topologie, Fundamenta Mathematicae, vol.\weaktie31\yearmagic(1938), pp.\weaktie103–134. \TheSortKeyIstarski a 1938 der aussagenkalkul und die topologie
• [13] \bibfitemTarski:1944 \guyA.A.Tarski and \guyJ. C. C.J. C. C.McKinsey 19440 \guysmagicA. Tarski \biband J. C. C. McKinsey The algebra of topology, Annals of mathematics, vol.\weaktie45\yearmagic(1944), pp.\weaktie141—–191. \TheSortKeyIstarski a mckinsey j c c 1944 the algebra of topology
• [14] \bibfitemBenthem:2007 \guyJ.JohanvanBenthem and \guyG.GuramBezhanishvili 20070 \guysmagicJohan van Benthem \biband Guram Bezhanishvili Modal Logics of Space, pp.\weaktie217–298, Springer\yearmagic,2007, pp.\weaktie217–298. \TheSortKeyIsvan benthem johan bezhanishvili guram 2007 modal logics of space
• [15] \bibfitemDouwen:1993b \guyE. K.Eric K.vanDouwen 19930 \guysmagicEric K. van Douwen An anti-Hausdorff Fréchet space in which convergent sequences have unique limits, Topology and its Applications, vol.\weaktie51\yearmagic(1993), no.\weaktie2, pp.\weaktie147–158. \TheSortKeyIsvan douwen eric k 1993 an anti hausdorff frechet space in which convergent sequences have unique limits
• [16] \bibfitemBezhanishvili:2017 \guyJ.JanvanMill, \guyN.NickBezhanishvili, \guyJ.JoelLucero-Bryan, and \guyG.GuramBezhanishvili 0 \guysmagicJan van Mill, Nick Bezhanishvili, Joel Lucero-Bryan, \biband Guram Bezhanishvili Tychonoff HED-spaces and Zemanian extensions of S4.3, Preprint. \TheSortKeyIsvan mill jan bezhanishvili nick lucero bryan joel bezhanishvili guram tychonoff hed spaces and zemanian extensions of s43
• [17]
You are adding the first comment!
How to quickly get a good reply:
• Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
• Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
• Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
The feedback must be of minimum 40 characters and the title a minimum of 5 characters