Monotone Relations, Fixed Points and Recursive Definitions

DOI10.1007/978-1-4020-9084-4_7zbMath1163.06001OpenAlexW137446698MaRDI QIDQ3600566

Janusz Czelakowski

Publication date: 5 February 2009

Published in: Towards Mathematical Philosophy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4020-9084-4_7

zbMATH Keywords

fixed pointdefinabilitymonotone relationarithmetic recursionchain-\(\sigma\)-continuous

Mathematics Subject Classification ID

Partial orders, general (06A06) Computability and recursion theory (03D99) Axiom of choice and related propositions (03E25) Basic properties of first-order languages and structures (03C07)

Cites Work

• A uniform approach to inductive posets and inductive closure
• Least reflexive points of relations
• Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices
• Chain-complete posets and directed sets with applications
• Model theory
• A lattice-theoretical fixpoint theorem and its applications
• An extension of Tarski's fixed point theorem and its application to isotone complementarity problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item