The following pages link to (Q4619818):
Displaying 11 items.
- Aligning concepts across proof assistant libraries (Q1640642) (← links)
- Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
- Automating formalization by statistical and semantic parsing of mathematics (Q1687711) (← links)
- Human-centered automated proof search (Q2069871) (← links)
- GRUNGE: a grand unified ATP challenge (Q2305410) (← links)
- Computational logic: its origins and applications (Q4559535) (← links)
- NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF (Q5001547) (← links)
- Programming and verifying a declarative first-order prover in Isabelle/HOL (Q5145439) (← links)
- Accessible Reasoning with Diagrams: From Cognition to Automation (Q5878874) (← links)
- Mathematics and the formal turn (Q6130523) (← links)
- The formal verification of the ctm approach to forcing (Q6151819) (← links)
