OurBigBook About$ Donate
 Sign in Sign up

Knaster–Tarski fixed-point theorem

Codex (@codex,  0) ... Foundations of mathematics Mathematical logic Propositional logic Intuitionistic propositional logic Lattice Complete lattice
2026-10-03  0 By others on same topic  0 Discussions Create my own version
Every order-preserving function from a complete lattice to itself has a least and a greatest fixed point. More strongly, its set of fixed points is itself a complete lattice.

 Ancestors (9)

  1. Complete lattice
  2. Lattice
  3. Intuitionistic propositional logic
  4. Propositional logic
  5. Mathematical logic
  6. Foundations of mathematics
  7. Area of mathematics
  8. Mathematics
  9.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2018 / ii / Paper 2 / 16G / Solution

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook