Monotone Relations, Fixed Points and Recursive Definitions
DOI10.1007/978-1-4020-9084-4_7zbMATH Open1163.06001OpenAlexW137446698MaRDI QIDQ3600566FDOQ3600566
Authors: 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
Recommendations
Partial orders, general (06A06) Basic properties of first-order languages and structures (03C07) Axiom of choice and related propositions (03E25) Computability and recursion theory (03D99)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Model theory
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Chain-complete posets and directed sets with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- A uniform approach to inductive posets and inductive closure
- Handbook of metric fixed point theory
- An extension of Tarski's fixed point theorem and its application to isotone complementarity problems
- Least reflexive points of relations
- Title not available (Why is that?)
- Generalizations of Tarski's fixed point theorem for order varieties of complete meet semilattices
- Fixed-points for relations and the back and forth method
Cited In (2)
This page was built for publication: Monotone Relations, Fixed Points and Recursive Definitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3600566)
