English
Related papers

Related papers: Fixed-point properties for predicate modal logics

200 papers

Let $(\omega^n,\preceq)$ be the direct power of $n$ instances of $(\omega,\leq)$, natural numbers with the standard ordering, $(\omega^n,\prec)$ the direct power of $n$ instances of $(\omega,<)$. We show that for all finite $n$, the modal…

Logic · Mathematics 2019-03-13 Ilya Shapirovsky

We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is an FO-definable language that is monotone in monadic predicates but not definable in FO+. This…

Formal Languages and Automata Theory · Computer Science 2024-02-14 Denis Kuperberg

The first-order theory of MALL (multiplicative, additive linear logic) over only equalities is an interesting but weak logic since it cannot capture unbounded (infinite) behavior. Instead of accounting for unbounded behavior via the…

Logic in Computer Science · Computer Science 2010-12-02 David Baelde

We formalise the self-referential definition of physical laws using monotone operators on a lattice of theories, resolving the pathologies of naive set-theoretic formulations. By invoking Tarski fixed point theorem, we identify physical…

History and Philosophy of Physics · Physics 2026-02-04 Eren Volkan Küçük

We develop a fixed-point extension of quantitative equational logic and give semantics in one-bounded complete quantitative algebras. Unlike previous related work about fixed-points in metric spaces, we are working with the notion of…

Logic in Computer Science · Computer Science 2021-07-01 Radu Mardare , Prakash Panangaden , Gordon Plotkin

We prove a generic completeness result for a class of modal fixpoint logics corresponding to flat fragments of the two-way mu-calculus, extending earlier work by Santocanale and Venema. We observe that Santocanale and Venema's proof that…

Logic in Computer Science · Computer Science 2017-10-13 Sebastian Enqvist

Gromov showed that for fixed, arbitrarily large C, any uniformly C-Lipschitz affine action of a random group in his graph model on a Hilbert space has a fixed point. We announce a theorem stating that more general affine actions of the same…

Group Theory · Mathematics 2017-05-09 Shin Nayatani

Based on the recently developed theory of random sequential compactness, we prove the random Kakutani fixed point theorem in random normed modules: if G is a random sequentially compact L0-convex subset of a random normed module, then every…

Functional Analysis · Mathematics 2025-10-07 Qiang Tu , Xiaohuan Mu , Tiexin Guo , Guang Yang , Yuanyuan Sun

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

Let $k$ be a finitely generated field, let $X$ be an algebraic variety and $G$ a linear algebraic group, both defined over $k$. Suppose $G$ acts on $X$ and every element of a Zariski-dense semigroup $\Gamma \subset G(k)$ has a rational…

Number Theory · Mathematics 2007-08-16 Pietro Corvaja

We show that the following conditions on a C*-algebra are equivalent: (i) it has the fixed point property for nonexpansive mappings, (ii) the spectrum of every self adjoint element is finite, (iii) it is finite dimensional. We prove that…

Operator Algebras · Mathematics 2009-01-26 S. Dhompongsa , W. Fupinwong , W. Lawton

Inductive and coinductive specifications are widely used in formalizing computational systems. Such specifications have a natural rendition in logics that support fixed-point definitions. Another useful formalization device is that of…

Logic in Computer Science · Computer Science 2012-04-30 David Baelde , Gopalan Nadathur

Frick and Grohe [J. ACM 48 (2006), 1184-1206] introduced a notion of graph classes with locally bounded tree-width and established that every first order logic property can be decided in almost linear time in such a graph class. Here, we…

Data Structures and Algorithms · Computer Science 2011-08-30 Tomas Gavenciak , Daniel Kral , Sang-il Oum

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

This paper is focused on the study of modal logics defined from valued Kripke frames, and particularly, on computability and expressibility questions of modal logics of transitive Kripke frames evaluated over certain residuated lattices. It…

Logic in Computer Science · Computer Science 2019-04-03 Amanda Vidal

In this oaper, we prove some fixed point theorems in metric vector spaces, in which the continuity is not required for the considered mappings to satisfy. We provide some concrete examples to demonstrate these theorems. We also give some…

Functional Analysis · Mathematics 2022-11-08 Jinlu Li

Hybrid logic extends modal logic with support for reasoning about individual states, designated by so-called nominals. We study hybrid logic in the broad context of coalgebraic semantics, where Kripke frames are replaced with coalgebras for…

Logic in Computer Science · Computer Science 2010-02-03 Lutz Schroeder , Dirk Pattinson

In this article, we investigate some fixed point results satisfying a new generalized $\Delta$-implicit contractive condition in ordered complete multiplicative $\mathbf{G}_\mathcal{M}-$metric space. Also, some new definitions and fixed…

Functional Analysis · Mathematics 2022-06-14 Mohamed Gamal , Fu-Gui Shi

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

A fundamental result from Boolean modal logic states that a first-order definable class of Kripke frames defines a logic that is validated by all of its canonical frames. We generalise this to the level of non-distributive logics that have…

Logic · Mathematics 2020-02-11 Robert Goldblatt