English
Related papers

Related papers: Intuitionistic S4 is decidable

200 papers

In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete. He showed a polynomially bounded translation from full Intuitionistic Propositional Logic into…

Logic in Computer Science · Computer Science 2015-04-13 Edward Hermann Haeusler

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

Logic in Computer Science · Computer Science 2025-09-11 Alessandro Artale , Christopher Hampson , Roman Kontchakov , Andrea Mazzullo , Frank Wolter

There has been renewed interest in recent years in McKinsey and Tarski's interpretation of modal logic in topological spaces and their proof that S4 is the logic of any separable dense-in-itself metric space. Here we extend this work to the…

Logic · Mathematics 2023-11-08 Robert Goldblatt , Ian Hodkinson

The proof theory and semantics of intuitionistic modal logics have been studied by Simpson in terms of Prawitz-style labelled natural deduction systems and Kripke models. An alternative to model-theoretic semantics is provided by…

Logic · Mathematics 2025-07-10 Yll Buzoku , David. J. Pym

The decidability of axiomatic extensions of the modal logic K with modal reduction principles, i.e. axioms of the form $\Diamond^{k} p \rightarrow \Diamond^{n} p$, has remained a long-standing open problem. In this paper, we make…

Logic in Computer Science · Computer Science 2024-06-06 Piotr Ostropolski-Nalewaja , Tim S. Lyon

In this paper, we introduce a general family of sequent-style calculi over the modal language and its fragments to capture the essence of all constructively acceptable systems. Calling these calculi \emph{constructive}, we show that any…

Logic · Mathematics 2022-10-18 Amirhossein Akbar Tabatabai , Raheleh Jalali

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…

Logic · Mathematics 2015-12-01 Andrey Kudinov , Ilya Shapirovsky

In \cite{Lyon24} the question of the decidability of quasi-dense modal logics is answered, and an upper bound in $\EXPSPACE$ is given. Unfortunately, authors' intricate proof seems to contain a major flaw that cannot be fixed, leaving the…

Logic in Computer Science · Computer Science 2025-08-11 Olivier Gasquet

We define a Kripke semantics for a conditional logic based on the propositional logic $\mathsf{N4}$, the paraconsistent variant of Nelson's logic of strong negation; we axiomatize the minimal system induced by this semantics. The resulting…

Logic · Mathematics 2023-11-07 Grigory K. Olkhovikov

We study local consequence relations in modal extensions of product logic over Kripke models with either valued (fuzzy) or crisp accessibility relations. In both settings, we consider semantics over the full class of product algebras as…

Logic · Mathematics 2026-05-15 Amanda Vidal

During the last decades, a lot of effort was put into identifying decidable fragments of first-order logic. Such efforts gave birth, among the others, to the two-variable fragment and the guarded fragment, depending on the type of…

Logic in Computer Science · Computer Science 2021-10-05 Bartosz Bednarczyk , Maja Orłowska , Anna Pacanowska , Tony Tan

We study admissibility of inference rules and unification with parameters in transitive modal logics (extensions of K4), in particular we generalize various results on parameter-free admissibility and unification to the setting with…

Logic in Computer Science · Computer Science 2015-05-20 Emil Jeřábek

In the first part of this paper we analyzed finite non-deterministic matrix semantics for propositional non-normal modal logics as an alternative to the standard Kripke's possible world semantics. This kind of modal systems characterized by…

Logic · Mathematics 2021-01-08 Marcelo E. Coniglio , Luis Fariñas del Cerro , Newton M. Peron

In this paper we consider the topological products of modal logics of S4.1 and S4. We prove that it is equal to the fusion of logics S4.1 and S4 plus one additional axiom. We also show that this product is decidable. This is an example of a…

Logic · Mathematics 2024-03-12 Andrey Kudinov

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…

Logic · Mathematics 2023-05-30 Daniel Rogozin , Ilya Shapirovsky

We develop a second-order extension of intuitionistic modal logic, allowing quantification over propositions, both syntactically and semantically. A key feature of second-order logic is its capacity to define positive connectives from the…

Logic in Computer Science · Computer Science 2026-02-09 Justus Becker , Anupam Das , Sonia Marin , Paaras Padhiar

We give a new coalgebraic semantics for intuitionistic modal logic with $\Box$. In particular, we provide a colagebraic representation of intuitionistic descriptive modal frames and of intuitonistic modal Kripke frames based on image-finite…

Logic · Mathematics 2024-06-18 Rodrigo Nicolau Almeida , Nick Bezhanishvili

We explore various semantic understandings of dual intuitionistic logic by exploring the relationship between co-Heyting algebras and topological spaces. First, we discuss the relevant ideas in the setting of Heyting algebras and…

Logic · Mathematics 2024-11-26 Safal Raman Aryal

We present a logical system that combines the well-known classical epistemic concepts of belief and knowledge with a concept of evidence such that the intuitive principle \textit{`evidence yields belief and knowledge'} is satisfied. Our…

Logic in Computer Science · Computer Science 2023-04-05 Steffen Lewitzka , Vinícius Pinto

In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to…

Logic in Computer Science · Computer Science 2013-12-11 Marta Cialdea Mayer