The following pages link to Automating Coherent Logic (Q5387843):
Displayed 17 items.
- Theorem proving as constraint solving with coherent logic (Q2102932) (← links)
- A Kripke model for simplicial sets (Q2257308) (← links)
- Automated generation of machine verifiable and readable proofs: a case study of Tarski's geometry (Q2354917) (← links)
- On the mechanization of the proof of Hessenberg's theorem in coherent logic (Q2471743) (← links)
- From informal to formal proofs in Euclidean geometry (Q2631958) (← links)
- Geometry constructions language (Q2655329) (← links)
- Subsumption Algorithms for Three-Valued Geometric Resolution (Q2817925) (← links)
- A Coherent Logic Based Geometry Theorem Prover Capable of Producing Formal and Readable Proofs (Q3102745) (← links)
- Intuitionistic Decision Procedures Since Gentzen (Q3305556) (← links)
- Exploring Theories with a Model-Finding Assistant (Q3454114) (← links)
- Invited Talk: Coherentisation of First-Order Logic (Q3455757) (← links)
- An intuitionistic formula hierarchy based on high‐school identities (Q5108846) (← links)
- Spectral Spaces Versus Distributive Lattices: A Dictionary (Q5119701) (← links)
- A Vernacular for Coherent Logic (Q5495937) (← links)
- Automated generation of illustrated proofs in geometry and beyond (Q6185789) (← links)
- Valuative Lattices and Spectra (Q6190905) (← links)
- Valuative dimension, constructive points of view (Q6203783) (← links)