Fixed points theorems for non-transitive relations
From MaRDI portal
Publication:5028488
Recommendations
Cites work
- scientific article; zbMATH DE number 1614689 (Why is no real title available?)
- scientific article; zbMATH DE number 3830849 (Why is no real title available?)
- scientific article; zbMATH DE number 6296049 (Why is no real title available?)
- scientific article; zbMATH DE number 3423547 (Why is no real title available?)
- scientific article; zbMATH DE number 7649979 (Why is no real title available?)
- A Brief Overview of Agda – A Functional Language with Dependent Types
- A Theorem on Partially Ordered Sets, With Applications to Fixed Point Theorems
- A formal proof of the Kepler conjecture
- A lattice-theoretical fixpoint theorem and its applications
- Chain-complete posets and directed sets with applications
- Fixed points and common fixed points theorems in pseudo-ordered sets.
- Formal proof - the four color theorem
- Grammar Analysis and Parsing by Abstract Interpretation
- Interpretation of Locales in Isabelle: Theories and Proof Contexts
- Isabelle/HOL. A proof assistant for higher-order logic
- Isabelle/jEdit – A Prover IDE within the PIDE Framework
- Nitpick: a counterexample generator for higher-order logic based on a relational model finder
- Sledgehammer: judgement day
- Some fixed point theorems for pseudo ordered sets
- Sur le théorème de Zorn
- The method of successive approximations for functional equations
- Trellis theory
- Weak chain-completeness and fixed point property for pseudo-ordered sets
Describes a project that uses
Uses Software
This page was built for publication: Fixed points theorems for non-transitive relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5028488)