The following pages link to Archive Formal Proofs (Q40327):
Displaying 32 items.
- QED Reloaded: Towards a Pluralistic Formal Library of Mathematical Knowledge (Q5195275) (← links)
- Extending Sledgehammer with SMT Solvers (Q5200019) (← links)
- Combining Source, Content, Presentation, Narration, and Relational Representation (Q5200120) (← links)
- (Q5219926) (← links)
- MECHANIZING <i>PRINCIPIA LOGICO-METAPHYSICA</i> IN FUNCTIONAL TYPE-THEORY (Q5221294) (← links)
- Taming Multirelations (Q5278188) (← links)
- A FORMAL PROOF OF THE KEPLER CONJECTURE (Q5280247) (← links)
- Stone Relation Algebras (Q5283207) (← links)
- Reasoning About Cardinalities of Relations with Applications Supported by Proof Assistants (Q5283218) (← links)
- Shared-Memory Multiprocessing for Interactive Theorem Proving (Q5327360) (← links)
- Verified decision procedures for MSO on words based on derivatives of regular expressions (Q5371957) (← links)
- Set Theory or Higher Order Logic to Represent Auction Concepts in Isabelle? (Q5495927) (← links)
- (Q5856420) (← links)
- Higher-Order Tarski Grothendieck as a Foundation for Formal Proof. (Q5875415) (← links)
- (Q5875419) (← links)
- (Q5875421) (← links)
- (Q5875423) (← links)
- Nine Chapters of Analytic Number Theory in Isabelle/HOL. (Q5875424) (← links)
- (Q5875427) (← links)
- (Q5875428) (← links)
- (Q5875430) (← links)
- (Q5875431) (← links)
- (Q5875432) (← links)
- (Q5875439) (← links)
- Psi-calculi in Isabelle (Q5890661) (← links)
- Verified analysis of random binary tree structures (Q5916263) (← links)
- A comprehensive framework for saturation theorem proving (Q5918558) (← links)
- Verified analysis of random binary tree structures (Q5919010) (← links)
- Formalizing Bachmair and Ganzinger's ordered resolution prover (Q5919011) (← links)
- A formal proof of the expressiveness of deep learning (Q5919583) (← links)
- Cardinality of relations and relational approximation algorithms (Q5963086) (← links)
- A comprehensive framework for saturation theorem proving (Q5970776) (← links)
