Knaster-Tarski revisited

DOI10.1007/S001650050012zbMATH Open0929.06001OpenAlexW2021539523MaRDI QIDQ1293885FDOQ1293885

Authors: Jan Eppo Jonker 

Publication date: 15 September 1999

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s001650050012

Recommendations

• A note on the Knaster-Tarski fixpoint theorem
• \(T\)-lattices and fixed point theory
• Fixed point theorems on chain complete partially ordered sets
• Fixpoints and search in PVS
• The complexity of Tarski's fixed point theorem

zbMATH Keywords

functionally complete partial ordergeneralization of Knaster-Tarski fixpoint theorem

Mathematics Subject Classification ID

Partial orders, general (06A06) Semantics in the theory of computing (68Q55)

Cited In (8)

• The knaster-tarski fixed-point theorem is not uniformly constructive
• A generalization of Naundorf's fixpoint theorem
• Kempe Revisited
• Fixpoints for general correctness
• A general extension theorem for directed-complete partial orders
• A soft version of the Knaster-Tarski fixed point theorem with applications
• Title not available (Why is that?)
• Fixpoints and search in PVS

This page was built for publication: Knaster-Tarski revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1293885)