Skip to search formSkip to main contentSkip to account menu

Knaster–Tarski theorem

Known as: Tarski–Knaster theorem, Tarski's fixed point theorem, Tarski fixed point theorem 
In the mathematical areas of order and lattice theory, the Knaster–Tarski theorem, named after Bronisław Knaster and Alfred Tarski, states the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Abstract interpretationBisimulationComputer scienceFixed point (mathematics)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
2 The Brouwer Fixed Point Theorem and its Relatives 2
Many existence problems in economics – for example existence of competitive equilibrium in general equilibrium theory, existence… 
2007
2007
Finding Most Probable Worlds of Probabilistic Logic Programs
Probabilistic logic programs have primarily studied the problem of entailment of probabilistic atoms. However, there are some… 
2006
2006
A discrete Nash Theorem with low complexity and dynamic equilibria
Nash's Theorem guarantees the existence of Nash equilibria for strategic-form games. The typical proof of the result uses Brouwer… 
2005
2005
Solving the Paradoxes , Escaping Revenge Hartry Field
It is “the received wisdom” that any intuitively natural and consistent resolution of a class of semantic paradoxes immediately… 
2003
2003
Fuzzy logic programming based on α-cuts
This research provides found ations to Fuzzy Logic Programming based on 0' cuts. This is done via a sound and complete formal… 
2001
2001
Homotopy and Dynamics for Homeomorphisms of Solenoids and Knaster Continua
We describe homotopy classes of self-homeomorphisms of solenoids and Knaster continua. In particular, we demonstrate that… 
1998
1998
Fixed points of the bucket handle
If a homeomorphism on the bucket handle has an invariant composant, it has a fixed point in that composant. It follows that a… 
1993
1993
Nonwandering structures at the period-doubling limit in dimensions 2 and 3
A Cantor set supporting an adding machine is the simplest non-wandering structure that can occur at the conclusion of a sequence… 
1989
1989
Horn equational theories and paramodulation
A language of equational programs together with an inference system, based on paramodulation is defined. The semantics of the… 
1974
1974
Dynamic Programming Schemata
In this paper we give a model of dynamic programming based on functional equations. A general method for solving these equations… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)