Proof and computation in geometry
From MaRDI portal
Publication:2849504
DOI10.1007/978-3-642-40672-0_1zbMATH Open1397.03018OpenAlexW960198383MaRDI QIDQ2849504FDOQ2849504
Authors: Michael Beeson 
Publication date: 20 September 2013
Published in: Automated Deduction in Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-40672-0_1
Recommendations
Foundations of classical theories (including reverse mathematics) (03B30) Mechanization of proofs and logical operations (03B35)
Cited In (16)
- Constructive geometry and the parallel postulate
- A synthetic proof of Pappus' theorem in Tarski's geometry
- Foreword. Formalization of geometry, automated and interactive geometric reasoning
- Title not available (Why is that?)
- Modular algebraic specification of some basic geometrical constructions
- Enthymemathical Proofs and Canonical Proofs in Euclid’s Plane Geometry
- Proofs and surfaces
- Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries
- From informal to formal proofs in Euclidean geometry
- Formalization of the arithmetization of Euclidean plane geometry and applications
- Nonrealizability proofs in computational geometry
- Automated generation of machine verifiable and readable proofs: a case study of Tarski's geometry
- A constructive version of Tarski's geometry
- A Geometric Procedure with Prover9
- Title not available (Why is that?)
- Formalized proof, computation, and the construction problem in algebraic geometry
Uses Software
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)
