A Lattice-Theoretical Fixpoint Theorem and Its Applications.¶
Tarski, A. (1955). A Lattice-Theoretical Fixpoint Theorem and Its Applications. Pacific Journal of Mathematics, 5(2), 285-309.
Cited by¶
3 citations across 3 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Fixed Point
- Order
- or fixed-point analysis (the Knaster-Tarski theorem on monotone maps over complete lattices, which Tarski (1955) generalized into the form now used in denotational semantics and abstract interpretation)
This sourceSource of the Knaster-Tarski fixed-point theorem as now formulated. Precursor: Knaster, Bronisław, and Alfred Tarski. "Un théorème sur les fonctions d'ensembles." Annales de la Société Polonaise de Mathématique 6 (1928): 133–134.
- or fixed-point analysis (the Knaster-Tarski theorem on monotone maps over complete lattices, which Tarski (1955) generalized into the form now used in denotational semantics and abstract interpretation)
- Relation
- Similarly, a partial order is characterized by reflexivity, antisymmetry, and transitivity; these properties together license the Hasse-diagram visualization, the least-upper-bound construction, and the order-theoretic fixed-point theorems (Knaster-Tarski
This sourceSource of the Knaster-Tarski fixed-point theorem as now formulated. Precursor: Knaster, Bronisław, and Alfred Tarski. "Un théorème sur les fonctions d'ensembles." Annales de la Société Polonaise de Mathématique 6 (1928): 133–134.
- Similarly, a partial order is characterized by reflexivity, antisymmetry, and transitivity; these properties together license the Hasse-diagram visualization, the least-upper-bound construction, and the order-theoretic fixed-point theorems (Knaster-Tarski
Verification¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:65ef1c00036a · see in the full table