It is a landmark theorem of McKinsey and Tarski that if we interpret modal diamond as closure, then $$\mathsf S4$$ S4 is the logic of any dense-in-itself metrizable space. The McKinsey–Tarski Theorem relies heavily on a metric that gives rise to the topology. We give a new and more topological proof of the theorem, utilizing Bing’s Metrization Theorem.

It is a landmark theorem of McKinsey and Tarski that if we interpret modal diamond as closure, then \ is the logic of any dense-in-itself metrizable space. The McKinsey–Tarski Theorem relies heavily on a metric that gives rise to the topology. We give a new and more topological proof of the theorem, utilizing Bing’s Metrization Theorem.

We prove that the existence of a measurable cardinal is equivalent to the existence of a normal space whose modal logic coincides with the modal logic of the Kripke frame isomorphic to the powerset of a two element set.

Within ZFC, we develop a general technique to topologize trees that provides a uniform approach to topological completeness results in modal logic with respect to zero-dimensional Hausdorff spaces. Embeddings of these spaces into well-known extremally disconnected spaces then gives new completeness results for logics extending S4.2.

We investigate a recently devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally complete if it is complete with respect to some class of polyhedra. The first main result of this paper is a necessary and sufficient condition for the polyhedral completeness of a logic. This condition, which we call the Nerve Criterion, is expressed in terms of Alexandrov’s notion of the nerve of a poset. It affords a purely combinatorial (...) characterisation of polyhedrally complete logics. Using the Nerve Criterion we show, easily, that there are continuum many intermediate logics that are not polyhedrally complete but which have the finite model property. We also provide, at considerable combinatorial labour, a countably infinite class of logics axiomatised by the Jankov–Fine formulas of ‘starlike trees’ all of which are polyhedrally complete. The polyhedral completeness theorem for these ‘starlike logics’ is the second main result of this paper. (shrink)

Let ${\beta(\mathbb{N})}$ denote the Stone–Čech compactification of the set ${\mathbb{N}}$ of natural numbers (with the discrete topology), and let ${\mathbb{N}^\ast}$ denote the remainder ${\beta(\mathbb{N})-\mathbb{N}}$ . We show that, interpreting modal diamond as the closure in a topological space, the modal logic of ${\mathbb{N}^\ast}$ is S4 and that the modal logic of ${\beta(\mathbb{N})}$ is S4.1.2.

We develop the theory of Krull dimension forS4-algebras and Heyting algebras. This leads to the concept of modal Krull dimension for topological spaces. We compare modal Krull dimension to other well-known dimension functions, and show that it can detect differences between topological spaces that Krull dimension is unable to detect. We prove that for aT1-space to have a finite modal Krull dimension can be described by an appropriate generalization of the well-known concept of a nodec space. This, in turn, can (...) be described by modal formulaszemnwhich generalize the well-known Zeman formulazem. We show that the modal logicS4.Zn:=S4+ zemnis the basic modal logic ofT1-spaces of modal Krull dimension ≤n, and we construct a countable dense-in-itselfω-resolvable Tychonoff spaceZnof modal Krull dimensionnsuch thatS4.Znis complete with respect toZn. This yields a version of the McKinsey-Tarski theorem forS4.Zn. We also show that no logic in the interval [S4n+1S4.Zn) is complete with respect to any class ofT1-spaces. (shrink)

When we interpret modal ◊ as the limit point operator of a topological space, the Gödel-Löb modal system GL defines the class Scat of scattered spaces. We give a partition of Scat into α-slices S α , where α ranges over all ordinals. This provides topological completeness and definability results for extensions of GL. In particular, we axiomatize the modal logic of each ordinal α, thus obtaining a simple proof of the Abashidze–Blass theorem. On the other hand, when we interpret (...) ◊ as closure in a topological space, the Grzegorczyk modal system Grz defines the class HI of hereditarily irresolvable spaces. We also give a partition of HI into α-slices H α , where α ranges over all ordinals. For a subset A of a hereditarily irresolvable space X and an ordinal α, we introduce the α-representation of A, give an axiomatization of the α-representation of A, and characterize H α in terms of α-representations. We prove that ${X \in {\bf H}_{1}}$ iff X is submaximal. For a positive integer n, we generalize the notion of a submaximal space to that of an n-submaximal space, and prove that ${X \in {\bf H}_{n}}$ iff X is n-submaximal. This provides topological completeness and definability results for extensions of Grz. We show that the two partitions are related to each other as follows. For a successor ordinal α = β + n, with β a limit ordinal and n a positive integer, we have ${{\bf H}_{\alpha} \cap {\bf Scat} = {\bf S}_{\beta+2n-1} \cup {\bf S}_{\beta+2n}}$ , and for a limit ordinal α, we have ${{\bf H}_{\alpha} \cap {\bf Scat} = {\bf S}_{\alpha}}$ . As a result, we obtain full and faithful translations of ordinal complete extensions of Grz into ordinal complete extensions of GL, thus generalizing the Kuznetsov–Goldblatt–Boolos theorem. (shrink)

This paper is the concluding part of [1] and [2], and it investigates the inner structure of the lattice (MHA) of all varieties of monadic Heyting algebras. For every n , we introduce and investigate varieties of depth n and cluster n, and present two partitions of (MHA), into varieties of depth n, and into varieties of cluster n. We pay a special attention to the lower part of (MHA) and investigate finite and critical varieties of monadic Heyting algebras in (...) detail. In particular, we prove that there exist exactly thirteen critical varieties in (MHA) and that it is decidable whether a given variety of monadic Heyting algebras is finite or not. The representation of (MHA) is also given. All these provide us with a satisfactory insight into (MHA). Since (MHA) is dual to the lattice NExtMIPC of all normal extensions of the intuitionistic modal logic MIPC, we also obtain a clearer picture of the lattice structure of intuitionistic modal logics over MIPC. (shrink)

We give alternative characterizations of exact, extendible and projective formulas in intuitionistic propositional calculus IPC in terms of n -universal models. From these characterizations we derive a new syntactic description of all extendible formulas of IPC in two variables. For the formulas in two variables we also give an alternative proof of Ghilardi’s theorem that every extendible formula is projective.

We give alternative characterizations of exact, extendible and projective formulas in intuitionistic propositional calculus IPC in terms of n-universal models. From these characterizations we derive a new syntactic description of all extendible formulas of IPC in two variables. For the formulas in two variables we also give an alternative proof of Ghilardi’s theorem that every extendible formula is projective.

For a Euclidean space , let L n denote the modal logic of chequered subsets of . For every n 1, we characterize L n using the more familiar Kripke semantics, thus implying that each L n is a tabular logic over the well-known modal system Grz of Grzegorczyk. We show that the logics L n form a decreasing chain converging to the logic L of chequered subsets of . As a result, we obtain that L is also a logic (...) over Grz, and that L has the finite model property. We conclude the paper by extending our results to the modal language enriched with the universal modality. (shrink)

For a Euclidean space \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}^n $$ \end{document}, let Ln denote the modal logic of chequered subsets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}^n $$ \end{document}. For every n ≥ 1, we characterize Ln using the more familiar Kripke semantics, thus implying that each Ln is a tabular logic over the well-known modal system Grz of Grzegorczyk. We show that the logics Ln form a decreasing chain (...) converging to the logic L∞ of chequered subsets of \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $$\mathbb{R}^\infty $$ \end{document}. As a result, we obtain that L∞ is also a logic over Grz, and that L∞ has the finite model property. We conclude the paper by extending our results to the modal language enriched with the universal modality. (shrink)

Brouwer's views on the foundations of mathematics have inspired the study of intuitionistic logic, including the study of the intuitionistic propositional calculus and its extensions. The theory of these systems has become an independent branch of logic with connections to lattice theory, topology, modal logic and other areas. This paper aims to present a modern account of semantics for intuitionistic propositional systems. The guiding idea is that of a hierarchy of semantics, organized by increasing generality: from the least general Kripke (...) semantics on through Beth semantics, topological semantics, Dragalin semantics, and finally to the most general algebraic semantics. While the Kripke, topological, and algebraic semantics have been extensively studied, the Beth and Dragalin semantics have received less attention. We bring Beth and Dragalin semantics to the fore, relating them to the concept of a nucleus from pointfree topology, which provides a unifying perspective on the semantic hierarchy. (shrink)

In this article, we develop a bimodal perspective on possibility semantics, a framework allowing partiality of states that provides an alternative modelling for classical propositional and modal logics. In particular, we define a full and faithful translation of the basic modal logic K over possibility models into a bimodal logic of partial functions over partial orders, and we show how to modulate this analysis by varying across logics and model classes that have independent topological motivations. This relates the two realms (...) under comparison both semantically and syntactically at the level of derivations. Moreover, our analysis clarifies the interplay between the complexity of translations and axiomatizations of the corresponding logics: adding axioms to the target bimodal logic simplifies translations, or vice versa, complex translations can simplify frame conditions. We also investigate a transfer of first-order correspondence theory between possibility semantics and its bimodal counterpart. Finally, we discuss the conceptual trade-off between giving translations and giving new semantics for logical systems, and we identify a number of further research directions to which our analysis gives rise. (shrink)

We introduce new algebraic and topological semantics for inquisitive logic. The algebraic semantics is based on special Heyting algebras, which we call inquisitive algebras, with propositional valuations ranging over only the ¬¬-fixpoints of the algebra. We show how inquisitive algebras arise from Boolean algebras: for a given Boolean algebra B, we define its inquisitive extension H(B) and prove that H(B) is the unique inquisitive algebra having B as its algebra of ¬¬-fixpoints. We also show that inquisitive algebras determine Medvedev’s logic (...) of finite problems. In addition to the algebraic characterization of H(B), we give a topological characterization of H(B) in terms of the recently introduced choice-free duality for Boolean algebras using so-called upper Vietoris spaces (UV-spaces). In particular, while a Boolean algebra B is realized as the Boolean algebra of compact regular open elements of a UV-space dual to B, we show that H(B) is realized as the algebra of compact open elements of this space. This connection yields a new topological semantics for inquisitive logic. (shrink)

Stalnaker, 169–199 2006) introduced a combined epistemic-doxastic logic that can formally express a strong concept of belief, a concept of belief as ‘subjective certainty’. In this paper, we provide a topological semantics for belief, in particular, for Stalnaker’s notion of belief defined as ‘epistemic possibility of knowledge’, in terms of the closure of the interior operator on extremally disconnected spaces. This semantics extends the standard topological interpretation of knowledge with a new topological semantics for belief. We prove that the belief (...) logic KD45 is sound and complete with respect to the class of extremally disconnected spaces and we compare our approach to a different topological setting in which belief is interpreted in terms of the derived set operator. We also study belief revision as well as belief dynamics by providing a topological semantics for conditional belief and belief update modalities, respectively. Our setting based on extremally disconnected spaces, however, encounters problems when extended with dynamic updates. We then propose a solution consisting in interpreting belief in a similar way based on hereditarily extremally disconnected spaces, and axiomatize the belief logic of hereditarily extremally disconnected spaces. Finally, we provide a complete axiomatization of the logic of conditional belief and knowledge, as well as a complete axiomatization of the corresponding dynamic logic. (shrink)

We generalize the notion of a monadic algebra to that of a pseudomonadic algebra. In the same way as monadic algebras serve as algebraic models of epistemic modal system S5, pseudomonadic algebras serve as algebraic models of doxastic modal system KD45. The main results of the paper are: Characterization of subdirectly irreducible and simple pseudomonadic algebras, as well as Tokarz's proper filter algebras; Ordertopological representation of pseudomonadic algebras; Complete description of the lattice of subvarieties of the variety of pseudomonadic algebras.

We consider two topological interpretations of the modal diamond—as the closure operator (C-semantics) and as the derived set operator (d-semantics). We call the logics arising from these interpretations C-logics and d-logics, respectively. We axiomatize a number of subclasses of the class of nodec spaces with respect to both semantics, and characterize exactly which of these classes are modally definable. It is demonstrated that the d-semantics is more expressive than the C-semantics. In particular, we show that the d-logics of the six (...) classes of spaces considered in the paper are pairwise distinct, while the C-logics of some of them coincide. (shrink)

We present a new notion of game equivalence that captures basic powers of interacting players. We provide a representation theorem, a complete logic, and a new game algebra for basic powers. In doing so, we establish connections with imperfect information games and epistemic logic. We also identify some new open problems concerning logic and games.

We propose a new perspective on logics of computation by combining instantial neighborhood logic INL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {INL}$$\end{document} with bisimulation safe operations adapted from PDL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {PDL}$$\end{document}. INL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {INL}$$\end{document} is a recent modal logic, based on an extended neighborhood semantics which permits quantification over individual neighborhoods plus their contents. This system has a natural interpretation as a (...) logic of computation in open systems. Motivated by this interpretation, we show that a number of familiar program constructors can be adapted to instantial neighborhood semantics to preserve invariance for instantial neighborhood bisimulations, the appropriate bisimulation concept for INL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {INL}$$\end{document}. We also prove that our extended logic IPDL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {IPDL}$$\end{document} is a conservative extension of dual-free game logic, and its semantics generalizes the monotone neighborhood semantics of game logic. Finally, we provide a sound and complete system of axioms for IPDL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathsf {IPDL}$$\end{document}, and establish its finite model property and decidability. (shrink)

The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices via compact open sets. It also takes advantage of Tarski’s observation that the regular open sets of any topological space form a Boolean (...) algebra. We prove without choice principles that any Boolean algebra arises from a special spectral space X via the compact regular open sets of X; these sets may also be described as those that are both compact open in X and regular open in the upset topology of the specialization order of X, allowing one to apply to an arbitrary Boolean algebra simple reasoning about regular opens of a separative poset. Our representation is therefore a mix of Stone and Tarski, with the two connected by Vietoris: the relevant spectral spaces also arise as the hyperspace of nonempty closed sets of a Stone space endowed with the upper Vietoris topology. This connection makes clear the relation between our point-set topological approach to choice-free Stone duality, which may be called the hyperspace approach, and a point-free approach to choice-free Stone duality using Stone locales. Unlike Stone’s representation of Boolean algebras via Stone spaces, our choice-free topological representation of Boolean algebras does not show that every Boolean algebra can be represented as a field of sets; but like Stone’s representation, it provides the benefit of a topological perspective on Boolean algebras, only now without choice. In addition to representation, we establish a choice-free dual equivalence between the category of Boolean algebras with Boolean homomorphisms and a subcategory of the category of spectral spaces with spectral maps. We show how this duality can be used to prove some basic facts about Boolean algebras. (shrink)

We prove that S4 is complete with respect to Boolean combinations of countable unions of convex subsets of the real line, thus strengthening a 1944 result of McKinsey and Tarski 45 141). We also prove that the same result holds for the bimodal system S4+S5+C, which is a strengthening of a 1999 result of Shehtman 369).

The variety of Heyting algebras has two well-behaved locally finite reducts, the variety of bounded distributive lattices and the variety of implicative semilattices. The variety of bounded distributive lattices is generated by the →-free reducts of Heyting algebras, while the variety of implicative semilattices is generated by the ∨-free reducts. Each of these reducts gives rise to canonical formulas that generalize Jankov formulas and provide an axiomatization of all superintuitionistic logics. The ∨-free reducts of Heyting algebras give rise to the (...) -canonical formulas that we studied in an earlier work. Here we introduce the -canonical formulas, which are obtained from the study of the →-free reducts of Heyting algebras. We prove that every si-logic is axiomatizable by -canonical formulas. We also discuss the similarities and differences between these two kinds of canonical formulas. One of the main ingredients of these formulas is a designated subset D of pairs of elements of a finite subdirectly irreducible Heyting algebra A. When D=A2, we show that the -canonical formula of A is equivalent to the Jankov formula of A. On the other hand, when D=∅, the -canonical formulas produce a new class of si-logics we term stable si-logics. We prove that there are continuum many stable si-logics and that all stable si-logics have the finite model property. We also compare stable si-logics to splitting and subframe si-logics. (shrink)

This volume is dedicated to Leo Esakia's contributions to the theory of modal and intuitionistic systems. Consisting of 10 chapters, written by leading experts, this volume discusses Esakia’s original contributions and consequent developments that have helped to shape duality theory for modal and intuitionistic logics and to utilize it to obtain some major results in the area. Beginning with a chapter which explores Esakia duality for S4-algebras, the volume goes on to explore Esakia duality for Heyting algebras and its generalizations (...) to weak Heyting algebras and implicative semilattices. The book also dives into the Blok-Esakia theorem and provides an outline of the intuitionistic modal logic KM which is closely related to the Gödel-Löb provability logic GL. One chapter scrutinizes Esakia’s work interpreting modal diamond as the derivative of a topological space within the setting of point-free topology. The final chapter in the volume is dedicated to the derivational semantics of modal logic and other related issues. (shrink)

This article provides an algebraic study of the propositional system $\mathtt {InqB}$ of inquisitive logic. We also investigate the wider class of $\mathtt {DNA}$ -logics, which are negative variants of intermediate logics, and the corresponding algebraic structures, $\mathtt {DNA}$ -varieties. We prove that the lattice of $\mathtt {DNA}$ -logics is dually isomorphic to the lattice of $\mathtt {DNA}$ -varieties. We characterise maximal and minimal intermediate logics with the same negative variant, and we prove a suitable version of Birkhoff’s classic variety (...) theorems. We also introduce locally finite $\mathtt {DNA}$ -varieties and show that these varieties are axiomatised by the analogues of Jankov formulas. Finally, we prove that the lattice of extensions of $\mathtt {InqB}$ is dually isomorphic to the ordinal $\omega +1$ and give an axiomatisation of these logics via Jankov $\mathtt {DNA}$ -formulas. This shows that these extensions coincide with the so-called inquisitive hierarchy of [9].1. (shrink)

This paper deals with the varieties of monadic Heyting algebras, algebraic models of intuitionistic modal logic MIPC. We investigate semisimple, locally finite, finitely approximated and splitting varieties of monadic Heyting algebras as well as varieties with the disjunction and the existence properties. The investigation of monadic Heyting algebras clarifies the correspondence between intuitionistic modal logics over MIPC and superintuitionistic predicate logics and provides us with the solutions of several problems raised by Ono [35].

We develop duality between nuclei on Heyting algebras and certain binary relations on Heyting spaces. We show that these binary relations are in 1–1 correspondence with subframes of Heyting spaces. We introduce the notions of nuclear and dense nuclear varieties of Heyting algebras, and prove that a variety of Heyting algebras is nuclear iff it is a subframe variety, and that it is dense nuclear iff it is a cofinal subframe variety. We give an alternative proof that every subframe variety (...) of Heyting algebras is generated by its finite members. (shrink)

We prove that if a modal formula is refuted on a wK4-algebra ( B ,□), then it is refuted on a finite wK4-algebra which is isomorphic to a subalgebra of a relativization of ( B ,□). As an immediate consequence, we obtain that each subframe and cofinal subframe logic over wK4 has the finite model property. On the one hand, this provides a purely algebraic proof of the results of Fine and Zakharyaschev for K4 . On the other hand, it (...) extends the Fine-Zakharyaschev results to wK4. (shrink)

Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones (...) in the logical representation of space and investigate current trends. In doing so, we do not only consider classical logic, but we indulge ourselves with modal logics. These present themselves naturally by providing simple axiomatizations of different geometries, topologies, space-time causality, and vector spaces. (shrink)

In 1995 Visser, van Benthem, de Jongh, and Renardel de Lavalette introduced NNIL-formulas, showing that these are exactly the formulas preserved under taking submodels of Kripke models. In this article we show that NNIL-formulas are up to frame equivalence the formulas preserved under taking subframes of frames, that NNIL-formulas are subframe formulas, and that subframe logics can be axiomatized by NNIL-formulas. We also define a new syntactic class of ONNILLI-formulas. We show that these are the formulas preserved in monotonic images (...) of frames and that ONNILLI-formulas are stable formulas as introduced by Bezhanishvili and Bezhanishvili in 2013. Thus, ONNILLI is a syntactically defined set of formulas axiomatizing all stable logics. This resolves a problem left open in 2013. (shrink)

It is a classic result in lattice theory that a poset is a complete lattice iff it can be realized as fixpoints of a closure operator on a powerset. Dragalin [9,10] observed that a poset is a locale (complete Heyting algebra) iff it can be realized as fixpoints of a nucleus on the locale of upsets of a poset. He also showed how to generate a nucleus on upsets by adding a structure of “paths” to a poset, forming what we (...) call a Dragalin frame. This allowed Dragalin to introduce a semantics for intuitionistic logic that generalizes Beth and Kripke semantics. He proved that every spatial locale (locale of open sets of a topological space) can be realized as fixpoints of the nucleus generated by a Dragalin frame. In this paper, we strengthen Dragalin’s result and prove that every locale—not only spatial locales—can be realized as fixpoints of the nucleus generated by a Dragalin frame. In fact, we prove the stronger result that for every nucleus on the upsets of a poset, there is a Dragalin frame based on that poset that generates the given nucleus. We then compare Dragalin’s approach to generating nuclei with the relational approach of Fairtlough and Mendler [11], based on what we call FM-frames. Surprisingly, every Dragalin frame can be turned into an equivalent FM-frame, albeit on a different poset. Thus, every locale can be realized as fixpoints of the nucleus generated by an FM-frame. Finally, we consider the relational approach of Goldblatt [13] and characterize the locales that can be realized using Goldblatt frames. (shrink)

We introduce partial Esakia morphisms, well partial Esakia morphisms, and strong partial Esakia morphisms between Esakia spaces and show that they provide the dual description of (∧, →) homomorphisms, (∧, →, 0) homomorphisms, and (∧, →, ∨) homomorphisms between Heyting algebras, thus establishing a generalization of Esakia duality. This yields an algebraic characterization of Zakharyaschev’s subreductions, cofinal subreductions, dense subreductions, and the closed domain condition. As a consequence, we obtain a new simplified proof (which is algebraic in nature) of Zakharyaschev’s (...) theorem that each intermediate logic can be axiomatized by canonical formulas. (shrink)

We introduce relativized modal algebra homomorphisms and show that the category of modal algebras and relativized modal algebra homomorphisms is dually equivalent to the category of modal spaces and partial continuous p-morphisms, thus extending the standard duality between the category of modal algebras and modal algebra homomorphisms and the category of modal spaces and continuous p-morphisms. In the transitive case, this yields an algebraic characterization of Zakharyaschev’s subreductions, cofinal subreductions, dense subreductions, and the closed domain condition. As a consequence, we (...) give an algebraic description of canonical, subframe, and cofinal subframe formulas, and provide a new algebraic proof of Zakharyaschev’s theorem that each logic over K4 is axiomatizable by canonical formulas. (shrink)

It is a classic result in modal logic, often referred to as Jónsson-Tarski duality, that the category of modal algebras is dually equivalent to the category of descriptive frames. The latter are Kripke frames equipped with a Stone topology such that the binary relation is continuous. This duality generalizes the celebrated Stone duality for boolean algebras. Our goal is to generalize descriptive frames so that the topology is an arbitrary compact Hausdorff topology. For this, instead of working with the boolean (...) algebra of clopen subsets of a Stone space, we work with the ring of continuous real-valued functions on a compact Hausdorff space. The main novelty is to define a modal operator on such a ring utilizing a continuous relation on a compact Hausdorff space.Our starting point is the well-known Gelfand duality between the category ${\sf KHaus}$ of compact Hausdorff spaces and the category $\boldsymbol {\mathit {uba}\ell }$ of uniformly complete bounded archimedean $\ell $ -algebras. We endow a bounded archimedean $\ell $ -algebra with a modal operator, which results in the category $\boldsymbol {\mathit {mba}\ell }$ of modal bounded archimedean $\ell $ -algebras. Our main result establishes a dual adjunction between $\boldsymbol {\mathit {mba}\ell }$ and the category ${\sf KHF}$ of what we call compact Hausdorff frames; that is, Kripke frames equipped with a compact Hausdorff topology such that the binary relation is continuous. This dual adjunction restricts to a dual equivalence between ${\sf KHF}$ and the reflective subcategory $\boldsymbol {\mathit {muba}\ell }$ of $\boldsymbol {\mathit {mba}\ell }$ consisting of uniformly complete objects of $\boldsymbol {\mathit {mba}\ell }$. This generalizes both Gelfand duality and Jónsson-Tarski duality. (shrink)