Related papers: Topological Modal Logics with Difference Modality
We classify the computational complexity of the satisfiability, validity and model-checking problems for propositional independence, inclusion, and team logic. Our main result shows that the satisfiability and validity problems for…
In this work in progress, we discuss independence and interpolation and related topics for classical, modal, and non-monotonic logics.
Fusions are a simple way of combining logics. For normal modal logics, fusions have been investigated in detail. In particular, it is known that, under certain conditions, decidability transfers from the component logics to their fusion.…
Dynamic topological logic (DTL) is a polymodal logic designed for reasoning about {\em dynamic topological systems. These are pairs (X,f), where X is a topological space and f:X->X is continuous. DTL uses a language L which combines the…
We describe a family of decidable propositional dynamic logics, where atomic modalities satisfy some extra conditions (for example, given by axioms of the logics K5, S5, or K45 for different atomic modalities). It follows from recent…
We study topological boundedness of order-to-topology bounded and order-to-topology continuous operators from ordered vector spaces to topological vector spaces. The uniform boundedness principle for such operators is investigated.
We present a simple technique for semantic, open logical relations arguments about languages with recursive types, which, as we show, follows from a principled foundation in categorical semantics. We demonstrate how it can be used to give a…
It is a classic result in modal logic 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.…
We describe various strengthenings of the concept of topological transitivity. Especially when one departs from the family of invertible systems, a number of interesting properties arise. We present the architecture of implications among…
It has been an open question as to whether the Modular Structural Operational Semantics framework can express the dynamic semantics of call/cc. This paper shows that it can, and furthermore, demonstrates that it can express the more general…
In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a…
Intuitionistic logic extended with decidable propositional atoms combines classical properties in its propositional part and intuitionistic properties for derivable formulas not containing propositional symbols. Sequent calculus is used as…
This paper studies nested sequents for quantified modal logics. In particular, it considers extensions of the propositional modal logics definable by the axioms D, T, B, 4, and 5 with varying, increasing, decreasing, and constant domains.…
Let E be a locally solid vector lattice. In this paper, we consider two particular vector subspaces of the space of all order bounded operators on E. With the aid of two appropriate topologies, we show that under some conditions, they…
In this paper, we have described a denotational model of Intuitionist Linear Logic which is also a differential category. Formulas are interpreted as Mackey-complete topological vector space and linear proofs are interpreted by bounded…
We initiate the study of finite characterizations and exact learnability of modal languages. A finite characterization of a modal formula w.r.t. a set of formulas is a finite set of finite models (labelled either positive or negative) which…
This paper investigates the logical strength of completeness theorems for modal propositional logic within second-order arithmetic. We demonstrate that the weak completeness theorem for modal propositional logic is provable in…
In this note, by integrating ideas concerning terminating tableaux-based procedures in modal logics and finite frame property of intuitionistic modal logic IK, we provide new and simpler decidability proofs for FIK and LIK.
We investigate algebraic and topological semantics of the modal logic S4CI and obtain strong completeness of the given system in the case of local semantic consequence relations. In addition, we consider an extension of the logic S4CI with…
We consider modal logics of products of neighborhood frames. We define n-product of modal logics as the logic of all products of neighborhood frames of corresponding logics and find n-product of any two pretransitive Horn axiomatizable…