Fixed points theorems for non-transitive relations
From MaRDI portal
Publication:5028488
Authors: Jérémy Dubut, Akihisa Yamada 
Publication date: 9 February 2022
Full work available at URL: https://arxiv.org/abs/2009.13065
Recommendations
Cites Work
- Title not available (Why is that?)
- Isabelle/jEdit – A Prover IDE within the PIDE Framework
- Nitpick: a counterexample generator for higher-order logic based on a relational model finder
- Isabelle/HOL. A proof assistant for higher-order logic
- The method of successive approximations for functional equations
- A lattice-theoretical fixpoint theorem and its applications
- Title not available (Why is that?)
- Chain-complete posets and directed sets with applications
- A Theorem on Partially Ordered Sets, With Applications to Fixed Point Theorems
- Grammar Analysis and Parsing by Abstract Interpretation
- Formal proof - the four color theorem
- Sledgehammer: judgement day
- A Brief Overview of Agda – A Functional Language with Dependent Types
- Sur le théorème de Zorn
- Title not available (Why is that?)
- Interpretation of Locales in Isabelle: Theories and Proof Contexts
- A formal proof of the Kepler conjecture
- Trellis theory
- Fixed points and common fixed points theorems in pseudo-ordered sets.
- Weak chain-completeness and fixed point property for pseudo-ordered sets
- Title not available (Why is that?)
- Some fixed point theorems for pseudo ordered sets
- Title not available (Why is that?)
Cited In (1)
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)
