Complete Non-Orders and Fixed Points

MaRDI QIDQ7361647FDO

Authors Akihisa Yamada, Jérémy Dubut

Publication date 27 June 2019

Cites work

• A Brief Overview of Agda – A Functional Language with Dependent Types
• A Brief Overview of HOL4
• A formal proof of the Kepler conjecture
• A lattice-theoretical fixpoint theorem and its applications
• An invitation to general algebra and universal constructions.
• Certification of Termination Proofs Using CeTA
• Chain-complete posets and directed sets with applications
• Continuous Lattices and Domains
• Fixed points and common fixed points theorems in pseudo-ordered sets.
• Fixed points theorems for non-transitive relations
• Formal proof - the four color theorem
• Formalizing results on directed sets in isabelle/HOL (proof pearl)
• HOL Light: An Overview
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• Unnamed Publication
• 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
• Posets and generalized lattices
• 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
• The Tarski–Kantorovitch prinicple and the theory of iterated function systems
• Trellis theory
• Weak chain-completeness and fixed point property for pseudo-ordered sets

Cited in

(3)

• Sorted Terms
• Formalizing Results on Directed Sets
• Galois Energy Games

This page was built for software: Complete Non-Orders and Fixed Points