Related papers: Visser frames for sublogics of $\mathbf{IL}$
In this paper, we study the Hilbert$-$Schmidt frame (HS-frame) theory for separable Hilbert spaces. We first present some characterizations of HS-frames and prove that HS-frames share many important properties with frames. Then, we show how…
A finite-dimensional Hilbert space is usually described in terms of an orthonormal basis, but in certain approaches or applications a description in terms of a finite overcomplete system of vectors, called a finite tight frame, may offer…
The paper proves finite model property and decidability for a family of modal logics. A binary relation $R$ is called pretransitive, if $R^*=\cup_{i\leq m} R^i$ for some $m\geq 0$, where $R^*$ is the transitive reflexive closure of $R$. By…
We introduce a framework for reasoning about the security of computer systems using modal logic. This framework is sufficiently expressive to capture a variety of known security properties, while also being intuitive and independent of…
De Rijke introduced a unary interpretability logic $\mathbf{il}$, and proved that $\mathbf{il}$ is the unary counterpart of the binary interpretability logic $\mathbf{IL}$. In this paper, we find the unary counterparts of the sublogics of…
We determine the ZF-provable modal logic of the modality $\Box_{\mathrm{sym}}$, where $\Box_{\mathrm{sym}}\varphi$ means '$\varphi$ holds in every finite symmetry-preserving iteration' of the symmetric method. We prove that the exact logic…
We study different representation theorems for various reducts of Heyting polyadic algebras. Superamalgamation is proved for several (natural reducts) and our results are compared to the finitizability problem in classical algebraic logic…
In this note the smooth (i.e. with open stabilizers) linear and {\sl semilinear} representations of certain permutation groups (such as infinite symmetric group or automorphism group of an infinite-dimensional vector space over a finite…
Given a class C of finite Kripke frames, we consider the uniform distribution on the frames from C with n states. A formula is almost surely valid in C if the probability that it is valid in a random C-frame with n states tends to 1 as n…
Let ML(U^+) denote the fragment of modal logic extended with the universal modality in which the universal modality occurs only positively. We characterize the relative definability of ML(U^+) relative to finite transitive frames in the…
We propose a novel logic, called Frame Logic (FL), that extends first-order logic (with recursive definitions) using a construct Sp(.) that captures the implicit supports of formulas -- the precise subset of the universe upon which their…
We discuss certain effective improvements on superrigidity for $SL_n(\mathbb{Z})$ for finite $n>2$. Using these ideas we then use superrigidity to prove a representation stability theorem about pointwise finite dimensional…
In this paper we describe the Fra\"iss\'e limit of finite MV-algebras and then prove that finite MV-algebras verify the Ramsey property. Then we show that MV-algebras are just a special case of a more general situation. In fact, under…
We establish decidability for the infinitely many axiomatic extensions of the commutative Full Lambek logic with weakening FLew (i.e. IMALLW) that have a cut-free hypersequent proof calculus (specifically: every analytic structural rule…
We study the modal logic of the closure algebra $P_2$, generated by the set of all polygons in the Euclidean plane $\mathbb{R}^2$. We show that this logic is finitely axiomatizable, is complete with respect to the class of frames we call…
The logics CS4 and IS4 are intuitionistic variants of the modal logic S4. Whether the finite model property holds for each of these logics has been a long-standing open problem. In this paper we introduce two logics closely related to IS4:…
In this paper, we present controlled finite continuous frames in a finite dimensional Hilbert space and we study some properties of them. Parseval controlled integral frames are presented and we characterize operators that construct…
We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame. As a consequence we…
We present a completeness result for the implicit fragment of justification stit logic. Although this fragment allows for no strongly complete axiomatization, we show that a restricted form of strong completeness (subsuming weak…
For each natural number $n$ we study the modal logic determined by the class of transitive Kripke frames in which there are no cycles of length greater than $n$ and no strictly ascending chains. The case $n=0$ is the G\"odel-L\"ob…