English
Related papers

Related papers: Topological Semantics and Decidability

200 papers

We prove that every topological space (T0-space, T1-space) can be embedded in a pseudoradial space (in a pseudoradial T0-space, T1space). This answers the Problem 3 in [Arhangelskii, A.V. - Isler, R. - Tironi, G: On pseudo-radial spaces,…

General Topology · Mathematics 2011-08-18 Martin Sleziak

We study multimodal logics over universally first-order definable classes of frames. We show that even for bimodal logics, there are universal Horn formulas that define set of frames such that the satisfiability problem is undecidable, even…

Logic in Computer Science · Computer Science 2018-09-11 Jakub Michaliszyn

The Alexandrov topology affords a well-known semantics of modal necessity and possibility. This paper develops an Alexandrov topological semantics of intuitionistic propositional modal logic internally in any elementary topos. This is done…

Category Theory · Mathematics 2024-10-18 Michael J. Lambert

The study of various decision problems for logic fragments has a long history in computer science. This paper is on the membership problem for a fragment of first-order logic over infinite words; the membership problem asks for a given…

Formal Languages and Automata Theory · Computer Science 2015-09-22 Manfred Kufleitner , Tobias Walter

We show that strict deterministic propositional dynamic logic with intersection is highly undecidable, solving a problem in the Stanford Encyclopedia of Philosophy. In fact we show something quite a bit stronger. We introduce the…

Logic in Computer Science · Computer Science 2023-11-08 Robert Goldblatt , Marcel Jackson

We present an automated verification of the well-known modal logic cube in Isabelle/HOL, in which we prove the inclusion relations between the cube's logics using automated reasoning tools. Prior work addresses this problem but without…

Logic in Computer Science · Computer Science 2015-08-03 Christoph Benzmüller , Maximilian Claus , Nik Sultana

Motivated by the Hilbert-space model for quantum mechanics, we define a pre-Hilbert space logic to be a pair $(S,\el)$, where $S$ is a pre-Hilbert space and $\el$ is an orthocomplemented poset of orthogonally closed linear subspaces of $S$,…

Functional Analysis · Mathematics 2018-12-12 David Buhagiar , Emmanuel Chetcuti , Hans Weber

From a logical point of view, Stone duality for Boolean algebras relates theories in classical propositional logic and their collections of models. The theories can be seen as presentations of Boolean algebras, and the collections of models…

Logic · Mathematics 2013-07-01 Steve Awodey , Henrik Forssell

We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…

Logic · Mathematics 2014-04-16 Lauri Hella , Antti Kuusisto

There has been a significant interest in extending various modal logics with intersection, the most prominent examples being epistemic and doxastic logics with distributed knowledge. Completeness proofs for such logics tend to be…

Logic in Computer Science · Computer Science 2020-04-07 Yì N. Wáng , Thomas Ågotnes

In this paper, we consider the well-known modal logics $\mathbf{K}$, $\mathbf{T}$, $\mathbf{K4}$, and $\mathbf{S4}$, and we study some of their sub-propositional fragments, namely the classical Horn fragment, the Krom fragment, the…

Logic in Computer Science · Computer Science 2023-06-22 Davide Bresolin , Emilio Muñoz-Velasco , Guido Sciavicco

We study in this paper the rational homotopy type of the space of symplectic embeddings of the standard ball $B^4(c) \subset \R^4$ into 4-dimensional rational symplectic manifolds. We compute the rational homotopy groups of that space when…

Symplectic Geometry · Mathematics 2011-04-26 Francois Lalonde , Martin Pinsonnault

Cathoristic logic is a multi-modal logic where negation is replaced by a novel operator allowing the expression of incompatible sentences. We present the syntax and semantics of the logic including complete proof rules, and establish a…

Logic in Computer Science · Computer Science 2014-11-27 Richard Prideaux Evans , Martin Berger

We prove that, similarly to known PSpace-completeness of recognising FO(<)-definability of the language L(A) of a DFA A, deciding both FO(<,C)- and FO(<,MOD)-definability are PSpace-complete. (Here, FO(<,C) extends the first-order logic…

Logic in Computer Science · Computer Science 2021-08-03 Agi Kurucz , Vladislav Ryzhikov , Yury Savateev , Michael Zakharyaschev

We investigate the expressivity and computational complexity of two modal logics on finite forests equipped with operators to reason on submodels. The logic ML(|) extends the basic modal logic ML with the composition operator | from static…

Logic in Computer Science · Computer Science 2020-07-20 Bartosz Bednarczyk , Stéphane Demri , Raul Fervari , Alessio Mansutti

In various articles, it is said that the class of all soft topologies on a common universe forms a complete lattice, but in this paper, we prove that it is a complete lattice. Some soft topologies are maximal and some are minimal with…

General Topology · Mathematics 2022-10-18 Samer Al Ghour , Zanyar A. Ameen

Equivalences between conformal foliations on Euclidean $3$-space, Hermitian structures on Euclidean $4$-space, shear-free ray congruences on Minkowski $4$-space, and holomorphic foliations on complex $4$-space are explained geometrically…

dg-ga · Mathematics 2008-02-03 P. Baird , J. C. Wood

In this paper we introduce congruence spaces, which are topological spaces that are canonically attached to monoid schemes and that reflect closed topological properties. This leads to satisfactory topological characterizations of closed…

Algebraic Geometry · Mathematics 2023-05-23 Oliver Lorscheid , Samarpita Ray

We axiomatize the provability logic of $\HA$ and prove its decidability. Furthermore, we axiomatize the preservativity and relative admissibility relations for several modal logics extending iK4. A principal technical tool is the…

Logic · Mathematics 2026-01-05 Mojtaba Mojtahedi

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…

Logic · Mathematics 2025-01-01 Vladislav Sliusarev
‹ Prev 1 8 9 10 Next ›