English
Related papers

Related papers: Fixpoint Theory -- Upside Down

200 papers

We present a fixed point theorem for a class of (potentially) non-monotonic functions over specially structured complete lattices. The theorem has as a special case the Knaster-Tarski fixed point theorem when restricted to the case of…

Logic in Computer Science · Computer Science 2015-02-10 Zoltán Ésik , Panos Rondogiannis

We prove a fixed point theorem that combines the contraction mapping principle and some Knaster-Tarski-like theorem. As a consequence we obtain an existence theorem to initial value problem for ordinary differential equation with…

Classical Analysis and ODEs · Mathematics 2023-01-18 Oleg Zubelevich

Fixpoints are ubiquitous in computer science as they play a central role in providing a meaning to recursive and cyclic definitions. Bisimilarity, behavioural metrics, termination probabilities for Markov chains and stochastic games are…

Logic in Computer Science · Computer Science 2025-07-23 Paolo Baldan , Richard Eggert , Barbara König , Timo Matt , Tommaso Padoan

Let $X$ be a partially ordered set with the property that each family of order intervals of the form $[a,b],[a,\rightarrow )$ with the finite intersection property has a nonempty intersection. We show that every directed subset of $X$ has a…

General Topology · Mathematics 2018-09-25 Rafael Espínola , Andrzej Wiśnicki

The concept of convex compactness, weaker than the classical notion of compactness, is introduced and discussed. It is shown that a large class of convex subsets of topological vector spaces shares this property and that is can be used in…

Functional Analysis · Mathematics 2010-06-02 Gordan Zitkovic

The Knaster-Tarski theorem, also known as Tarski's theorem, guarantees that every monotone function defined on a complete lattice has a fixed point. We analyze the query complexity of finding such a fixed point on the $k$-dimensional grid…

Computational Complexity · Computer Science 2025-07-16 Simina Brânzei , Reed Phillips , Nicholas Recker

We present methods to compute least fixed points of multiple monotone inflationary functions in parallel and distributed settings. While the classic Knaster-Tarski theorem addresses a single function with sequential iteration, modern…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-12 Vijay K. Garg , Rohan Garg

We investigate some Weihrauch problems between $\mathsf{ATR}_2$ and $\mathsf{C}_{\omega^\omega}$ . We show that the fixed point theorem for monotone operators on the Cantor space (a weaker version of the Knaster-Tarski theorem) is not…

Logic · Mathematics 2024-06-11 Yudai Suzuki , Keita Yokoyama

We prove a fixpoint theorem for contractions on Cauchy-complete quantale-enriched categories. It holds for any quantale whose underlying lattice is continuous, and applies to contractions whose control function is sequentially…

Category Theory · Mathematics 2022-11-04 Arij Benkhadra , Isar Stubbe

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

In reductive proof search, proofs are naturally generalized by solutions, comprising all possibly infinite structures generated by locally correct, bottom-up application of inference rules. We propose an extension of the Curry-Howard…

Logic in Computer Science · Computer Science 2021-07-30 José Espírito Santo , Ralph Matthes , Luís Pinto

While exploring dynamical systems, we often come across the principle of contraction mapping, or better known as the Banach fixed point theorem. It is an essential concept based on successive approximation, whose utility comes from two main…

Dynamical Systems · Mathematics 2025-12-09 Shamanth Sreekanth

The use of monotonicity and Tarski's theorem in existence proofs of equilibria is very widespread in economics, while Tarski's theorem is also often used for similar purposes in the context of verification. However, there has been…

Computational Complexity · Computer Science 2019-09-10 Kousha Etessami , Christos Papadimitriou , Aviad Rubinstein , Mihalis Yannakakis

Building on the theory of quantum posets, we introduce a non-commutative version of suplattices, i.e., complete lattices whose morphisms are supremum-preserving maps, which form a step towards a new notion of quantum topological spaces. We…

Discrete Mathematics · Computer Science 2023-09-01 Gejza Jenča , Bert Lindenhovius

The classical Kantorovich-Rubinstein duality theorem establishes a significant connection between Monge optimal transport and maximization of a linear form on the set of 1-Lipschitz functions. This result has been widely used in various…

Optimization and Control · Mathematics 2025-11-04 Karol Bołbotowski , Guy Bouchitté

We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…

Discrete Mathematics · Computer Science 2026-04-28 Julian Müller

Contraction theory is an analytical tool to study differential dynamics of a non-autonomous (i.e., time-varying) nonlinear system under a contraction metric defined with a uniformly positive definite matrix, the existence of which results…

Machine Learning · Computer Science 2026-03-18 Hiroyasu Tsukamoto , Soon-Jo Chung , Jean-Jacques E. Slotine

In this paper we present mutual coinduction as a dual of mutual induction and also as a generalization of standard coinduction. In particular, we present a precise formal definition of mutual induction and mutual coinduction. In the process…

Logic in Computer Science · Computer Science 2019-07-30 Moez A. AbdelGawad

This paper first proves two fixed point theorems in complete random normed modules, which are respectively the random generalizations of the classical Banach's contraction mapping principle and Browder--Kirk's fixed point theorem. As…

Functional Analysis · Mathematics 2018-11-29 Tiexin Guo , Erxin Zhang , Yachao Wang , ZiChen Guo

For a given partially ordered set (poset) and a given family of mappings of the poset into itself, we study the problem of the description of joint fixed points of this family. Well-known Tarski's theorem gives the structure of the set of…

Logic · Mathematics 2016-02-05 Dmitrii Serkov
‹ Prev 1 2 3 10 Next ›