English
Related papers

Related papers: Fixed-point properties for predicate modal logics

200 papers

We study the algorithmic properties of first-order monomodal logics of frames $\langle \mathbb{N}, \leq \rangle$, $\langle \mathbb{N}, < \rangle$, $\langle \mathbb{Q}, \leq \rangle$, $\langle \mathbb{Q}, < \rangle$, $\langle \mathbb{R},…

Logic in Computer Science · Computer Science 2021-05-26 Mikhail Rybakov , Dmitry Shkatov

We consider quantified pretransitive Horn modal logic. It is known that such logics are complete with respect to predicate Kripke frames with expanding domains. In this paper we prove that they are also complete with respect to…

Logic · Mathematics 2021-11-01 Andrey Kudinov

Cyclic proof theory studies proofs where cycles are allowed. This is useful for developing proof theory for logics with fixpoint operators: cycles can be used to represent the unfolding of a fixpoint. However, this cyclic character is not…

Logic · Mathematics 2025-11-05 Borja Sierra Miranda

We investigate preservation results for the independent fusion of one-variable first-order modal logics. We show that, without equality, Kripke completeness and decidability of the global and local consequence relation are preserved, under…

Logic in Computer Science · Computer Science 2026-03-09 Roman Kontchakov , Dmitry Shkatov , Frank Wolter

In this paper, we investigate arithmetical completeness with respect to finite Kripke models of quantified modal logic. We adapt the finite-model embedding techniques of Artemov and Japaridze to two settings involving finite Kripke models.…

Logic · Mathematics 2026-04-29 Haruka Kogure , Taishi Kurahashi

We prove that any finite subgroup $G \subset \Gamma_{{\boldsymbol{s}}}$ of the cluster modular group has fixed points in the cluster manifolds $\mathcal{A}_{\boldsymbol{s}}(\mathbb{R}_{>0})$ and…

Geometric Topology · Mathematics 2026-04-14 Tsukasa Ishibashi

We address the task of deriving fixpoint equations from modal logics characterizing behavioural equivalences and metrics (summarized under the term conformances). We rely on earlier work that obtains Hennessy-Milner theorems as corollaries…

Logic in Computer Science · Computer Science 2024-02-01 Harsh Beohar , Sebastian Gurke , Barbara König , Karla Messing , Jonas Forster , Lutz Schröder , Paul Wild

We construct finitely generated groups with strong fixed point properties. Let $\mathcal{X}_{ac}$ be the class of Hausdorff spaces of finite covering dimension which are mod-$p$ acyclic for at least one prime $p$. We produce the first…

Group Theory · Mathematics 2014-11-11 G. Arzhantseva , M. R. Bridson , T. Januszkiewicz , I. J. Leary , A. Minasyan , J. Swiatkowski

We give a sufficient condition for Kripke completeness of modal logics enriched with the transitive closure modality. More precisely, we show that if a logic admits what we call definable filtration (ADF), then such an expansion of the…

Logic · Mathematics 2020-11-05 Stanislav Kikot , Ilya Shapirovsky , Evgeny Zolin

In this paper, we develop an Isabelle/HOL library of order-theoretic fixed-point theorems. We keep our formalization as general as possible: we reprove several well-known results about complete orders, often with only antisymmetry or…

Logic in Computer Science · Computer Science 2023-06-22 Jérémy Dubut , Akihisa Yamada

Let F be a non-archimedean local field of characteristic zero whose residue field has at least three elements. Let G be an almost simple linear algebraic group over F, with rank_F(G) >= 2. Let X be a simply connected symmetric space of…

Group Theory · Mathematics 2026-04-17 Federico Viola

We prove a fixed point theorem for the action of certain local monodromy groups on \'etale covers and use it to deduce lower bounds in essential dimension. In particular, we give more geometric proofs of many (but not all) of the results of…

Algebraic Geometry · Mathematics 2020-07-21 Patrick Brosnan , Najmuddin Fakhruddin

This paper investigates neighborhood and algebraic models for predicate modal logics with $\omega$-rules, including non-normal cases. We establish sufficient conditions under which such logics have neighborhood models with constant domains…

Logic · Mathematics 2026-04-29 Yoshihito Tanaka

We establish Kirchberg's Local Lifting Property and Lubotzky--Shalom's Property FD for classes of finitely generated groups of central importance in geometric and combinatorial group theory: $3$-manifold groups, limit groups, and certain…

Group Theory · Mathematics 2026-04-20 Francesco Fournier-Facio , Rufus Willett

We consider constrained Horn clause solving from the more general point of view of solving formula equations. Constrained Horn clauses correspond to the subclass of Horn formula equations. We state and prove a fixed-point theorem for Horn…

Logic in Computer Science · Computer Science 2021-09-13 Stefan Hetzl , Johannes Kloibhofer

In this note we study the effect of adding fixed points to justification logics. We introduce two extensions of justification logics: extensions by fixed point (or diagonal) operators, and extensions by least fixed points. The former is a…

Logic · Mathematics 2015-02-03 Meghdad Ghari

The special linear group G=SL_n(Z[x1,...,xk]) (n at least 3 and k finite) is called the universal lattice. Let n be at least 4, p be any real number in (1,\infty). The main result is the following: any finite index subgroup of G has the…

Group Theory · Mathematics 2011-06-08 Masato Mimura

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Logic · Mathematics 2026-02-24 Anupam Das , Tikhon Pshenitsyn

It is well known that for transitive unimodal logics, finite height is both necessary and sufficient for local tabularity. It is also well known that for intermediate logics, finite height is sufficient (but not necessary) for local…

Logic · Mathematics 2026-03-24 Ilya B. Shapirovsky

We introduce a generic expression language describing behaviours of finite coalgebras over sets; besides relational systems, this covers, e.g., weighted, probabilistic, and neighbourhood-based system types. We prove a generic Kleene-type…

Logic in Computer Science · Computer Science 2018-05-21 Ulrich Dorsch , Stefan Milius , Lutz Schröder , Thorsten Wißmann