Proof and computation in geometry
From MaRDI portal
Recommendations
Cited in
(18)- Modular algebraic specification of some basic geometrical constructions
- Formalization of the arithmetization of Euclidean plane geometry and applications
- Proofs and surfaces
- Automated generation of machine verifiable and readable proofs: a case study of Tarski's geometry
- A synthetic proof of Pappus' theorem in Tarski's geometry
- Foreword. Formalization of geometry, automated and interactive geometric reasoning
- From informal to formal proofs in Euclidean geometry
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries
- scientific article; zbMATH DE number 994742 (Why is no real title available?)
- Enthymemathical Proofs and Canonical Proofs in Euclid’s Plane Geometry
- Formalized proof, computation, and the construction problem in algebraic geometry
- scientific article; zbMATH DE number 1263331 (Why is no real title available?)
- scientific article; zbMATH DE number 2160466 (Why is no real title available?)
- scientific article; zbMATH DE number 790271 (Why is no real title available?)
- A constructive version of Tarski's geometry
- A Geometric Procedure with Prover9
- Constructive geometry and the parallel postulate
- Nonrealizability proofs in computational geometry
This page was built for publication: Proof and computation in geometry
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2849504)