English
Related papers

Related papers: A Finitely Supported Frame for the Turing Schmerl …

200 papers

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…

Logic · Mathematics 2018-02-23 Katsuhiko Sano , Jonni Virtema

We give a new formulation of Turing reducibility in terms of higher modalities, inspired by an embedding of the Turing degrees in the lattice of subtoposes of the effective topos discovered by Hyland. In this definition, higher modalities…

Logic · Mathematics 2024-06-11 Andrew W Swan

It is well-known that the basic modal logic of all topological spaces is $S4$. However, the structure of basic modal and hybrid logics of classes of spaces satisfying various separation axioms was until present unclear. We prove that modal…

Logic · Mathematics 2007-06-13 Dmitry Sustretov

I investigate the modal commitments of various conceptions of the philosophy of arithmetic potentialism. Specifically, I shall consider the potentialist conceptions arising from a model-theoretic view of the models of arithmetic as possible…

Logic · Mathematics 2025-12-23 Joel David Hamkins

We explore the theory of illfounded and cyclic proofs for the propositional modal $\mu$-calculus. A fine analysis of provability for classical and intuitionistic modal logic provides a novel bridge between finitary, cyclic and illfounded…

Logic · Mathematics 2025-09-03 Bahareh Afshari , Graham E. Leigh , Guillermo Menèndez Turata

It is known [DemriSchnoebelen02] that both satisfiability and model-checking problems for propositional Linear-time Temporal Logic, LTL, with only a single propositional variable in the language are PSPACE-complete, which coincides with the…

Logic in Computer Science · Computer Science 2018-11-27 Mikhail Rybakov , Dmitry Shkatov

Provability logic concerns the study of modality $\Box$ as provability in formal systems such as Peano arithmetic. Natural, albeit quite surprising, topological interpretation of provability logic has been found in the 1970's by Harold…

Logic · Mathematics 2012-10-30 Lev Beklemishev , David Gabelaia

Recent research has applied modal substitution calculus (MSC) and its variants to characterize various computational frameworks such as graph neural networks (GNNs) and distributed computing systems. For example, it has been shown that the…

Logic in Computer Science · Computer Science 2025-12-12 Veeti Ahvonen , Reijo Jaakkola , Antti Kuusisto

In previous work [Lewitzka, Log. J. IGPL 2017], we presented a hierarchy of classical modal systems, along with algebraic semantics, for the reasoning about intuitionistic truth, belief and knowledge. Deviating from G\"odel's interpretation…

Logic in Computer Science · Computer Science 2019-01-01 Steffen Lewitzka

The present dissertation introduces the research project on HOLMS (\textbf{HOL} Light Library for \textbf{M}odal \textbf{S}ystems), a growing modular framework for modal reasoning within the HOL Light proof assistant. To provide an…

Logic in Computer Science · Computer Science 2025-06-13 Antonella Bilotta

In this paper we study frame definability in finitely-valued modal logics and establish two main results via suitable translations: (1) in finitely-valued modal logics one cannot define more classes of frames than are already definable in…

Logic · Mathematics 2022-06-28 Guillermo Badia , Xavier Caicedo , Carles Noguera

A famous result, conjectured by G\"odel in 1932 and proved by McKinsey and Tarski in 1948, says that $\varphi$ is a theorem of intuitionistic propositional logic IPC iff its G\"odel-translation $\varphi'$ is a theorem of modal logic S4. In…

Logic in Computer Science · Computer Science 2015-08-05 Steffen Lewitzka

We extend the geometric approach to vertex algebras developed by the first author to twisted modules, allowing us to treat orbifold models in conformal field theory. Let $V$ be a vertex algebra, $H$ a finite group of automorphisms of $V$,…

Algebraic Geometry · Mathematics 2007-05-23 Edward Frenkel , Matthew Szczesny

This work presents a formalized proof of modal completeness for G\"odel-L\"ob provability logic (GL) in the HOL Light theorem prover. We describe the code we developed, and discuss some details of our implementation, focusing on our choices…

Logic in Computer Science · Computer Science 2023-10-10 Marco Maggesi , Cosimo Perini Brogi

Term modal logics (TML) are modal logics with unboundedly many modalities, with quantification over modal indices, so that we can have formulas of the form $\exists y. \forall x. (\Box_x P(x,y) \supset\Diamond_y P(y,x))$. Like First order…

Logic in Computer Science · Computer Science 2019-06-28 Anantha Padmanabha , R. Ramanujam

Modal probabilistic logics provide a framework for reasoning about probability in modal contexts, involving notions such as knowledge, belief, time, and action. In this paper, we study a particular family of these logics, extending the…

Logic in Computer Science · Computer Science 2025-12-01 Daniil Kozhemiachenko , Igor Sedlár

We introduce and develop propositional continuous intuitionistic logic and propositional continuous affine logic via complete algebraic semantics. Our approach centres on AC-algebras, which are algebras $USC(\mathcal{L})$ of sup-preserving…

Logic in Computer Science · Computer Science 2026-02-06 Guillaume Geoffroy

We develop a general noncommutative version of Balmer's tensor triangular geometry that is applicable to arbitrary monoidal triangulated categories (M$\Delta$Cs). Insight from noncommutative ring theory is used to obtain a framework for…

Category Theory · Mathematics 2021-05-13 Daniel K. Nakano , Kent B. Vashaw , Milen T. Yakimov

Universal continuous calculi are defined and it is shown that for every finite tuple of pairwise commuting Hermitian elements of a Su*-algebra (an ordered *-algebra that is symmetric, i.e. "strictly" positive elements are invertible, and…

Functional Analysis · Mathematics 2020-12-01 Matthias Schötz

This paper studies Linear Temporal Logic over Finite Traces (LTLf) where proposition letters are replaced with first-order formulas interpreted over arbitrary theories, in the spirit of Satisfiability Modulo Theories. The resulting logic,…

Logic in Computer Science · Computer Science 2022-05-25 Luca Geatti , Alessandro Gianola , Nicola Gigante