English
Related papers

Related papers: Characterizing Relative Frame Definability in Team…

200 papers

We consider the operation of sum on Kripke frames, where a family of frames-summands is indexed by elements of another frame. In many cases, the modal logic of sums inherits the finite model property and decidability from the modal logic of…

Logic · Mathematics 2022-07-06 Ilya B. Shapirovsky

Motivated by classical facts concerning closed manifolds, we introduce a strong finiteness property in K-homology. We say that a C*-algebra has uniformly summable K-homology if all its K-homology classes can be represented by Fredholm…

Operator Algebras · Mathematics 2015-12-16 Heath Emerson , Bogdan Nica

The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…

Logic · Mathematics 2025-10-06 Mikhail Rybakov

We outline a general procedure that builds classifying spaces for generalized Thompson groups $\Gamma$. The construction depends on a small number of choices: (1) an inverse semigroup $S$ of partial transformations that ``locally determine"…

Group Theory · Mathematics 2024-09-12 Daniel Farley

In this paper, we prove the semantic incompleteness of the Hilbert-style system for the minimal normal term-modal logic with equality and non-rigid terms that was proposed in Liberman et al. (2020) "Dynamic Term-modal Logics for First-order…

Logic in Computer Science · Computer Science 2025-01-03 Takahiro Sawasaki

The coalgebraic approach to modal logic provides a uniform framework that captures the semantics of a large class of structurally different modal logics, including e.g. graded and probabilistic modal logics and coalition logic. In this…

Logic in Computer Science · Computer Science 2016-11-23 Corina Cirstea , Clemens Kupke , Dirk Pattinson

We study the positive logic FO+ on finite words, and its fragments, pursuing and refining the work initiated in [Kuperberg 2023]. First, we transpose notorious logic equivalences into positive first-order logic: FO+ is equivalent to LTL+ ,…

Logic in Computer Science · Computer Science 2024-06-26 Denis Kuperberg , Quentin Moreau

Ever since the introduction of motivic homotopy theory, as a well-proposed approximation of Grothendieck's dream, algebraic geometers then have the chance to study schemes via a homotopy theory. However topologists also found that lifting…

Algebraic Geometry · Mathematics 2025-12-09 Xin Tong

Kripke frames (and models) provide a suitable semantics for sub-classical logics, for example Intuitionistic Logic (of Brouwer and Heyting) axiomatizes the reflexive and transitive Kripke frames (with persistent satisfaction relations), and…

Logic · Mathematics 2019-07-02 Parvin Safari , Saeed Salehi

We study elementary modal logics, i.e. modal logic considered over first-order definable classes of frames. The classical semantics of modal logic allows infinite structures, but often practical applications require to restrict our…

Logic in Computer Science · Computer Science 2012-10-10 Jakub Michaliszyn , Jan Otop , Piotr Witkowski

We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness,…

Logic · Mathematics 2019-01-11 Krzysztof Krupinski , Anand Pillay

We study the expressive power of various modal logics with team semantics. We show that exactly the properties of teams that are downward closed and closed under team k-bisimulation, for some finite k, are definable in modal logic extended…

Logic in Computer Science · Computer Science 2014-06-25 Lauri Hella , Kerkko Luosto , Katsuhiko Sano , Jonni Virtema

We present a novel automata-based approach to address linear temporal logic modulo theory (LTL-MT) as a specification language for data words. LTL-MT extends LTL_f by replacing atomic propositions with quantifier-free multi-sorted…

Logic in Computer Science · Computer Science 2024-08-19 Marco Faella , Gennaro Parlato

Thomason \cite{Thomason74} showed that a certain modal logic $\mathbf{L}\subset \mathbf{S4}$ is incomplete with respect to Kripke semantics. Later Gerson \cite{Gerson75} showed that $\mathbf{L}$ is also incomplete with respect to…

Logic · Mathematics 2012-02-16 Jacob Vosmaer

In this paper, we take first steps toward developing defeasible reasoning on concepts in KLM framework. We define generalizations of cumulative reasoning system C and cumulative reasoning system with loop CL to conceptual setting. We also…

Artificial Intelligence · Computer Science 2024-09-10 Yiwen Ding , Krishna Manoorkar , Ni Wayan Switrayni , Ruoding Wang

We study the logic FO(~), the extension of first-order logic with team semantics by unrestricted Boolean negation. It was recently shown axiomatizable, but otherwise has not yet received much attention in questions of computational…

Logic in Computer Science · Computer Science 2018-04-16 Martin Lück

In this paper, we study a new Kripke-style semantics for classical modal logic, named as provability models. We study provability models for the propositional modal logics K, K4, S4 GL, GLP and the interpretability logic ILM. Provability…

Logic · Mathematics 2025-11-20 Mojtaba Mojtahedi , Borja Sierra Miranda

The Kripke semantics of various logics arises via categorical dualities between a category of relational frames and their maps, and a category of algebras and logical homomorphisms. When the relational frames are considered as computational…

Logic in Computer Science · Computer Science 2026-05-08 Piotr Kozicki , Alex Kavvos

Motivated by team semantics and existential second-order logic, we develop a model-theoretic framework for studying second-order objects such as sets and relations. We introduce a notion of abstract elementary team categories that…

Logic · Mathematics 2026-05-08 Tapani Hyttinen , Joni Puljujärvi , Davide Emilio Quadrellaro

In arXiv:1604.08705 we introduced the propositional modal logic $\textbf{TSC}$ (which stands for Turing Schmerl Calculus) which adequately describes the provable interrelations between different kinds of Turing progressions. In…

Logic · Mathematics 2018-04-30 Eduardo Hermo Reyes
‹ Prev 1 4 5 6 7 8 10 Next ›