Proof and Computation in Geometry
From MaRDI portal
Publication:2849504
DOI10.1007/978-3-642-40672-0_1zbMath1397.03018OpenAlexW960198383MaRDI QIDQ2849504
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
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
A synthetic proof of Pappus' theorem in Tarski's geometry ⋮ Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries ⋮ Formalization of the arithmetization of Euclidean plane geometry and applications ⋮ CONSTRUCTIVE GEOMETRY AND THE PARALLEL POSTULATE ⋮ A constructive version of Tarski's geometry ⋮ Automated generation of machine verifiable and readable proofs: a case study of Tarski's geometry
Uses Software
This page was built for publication: Proof and Computation in Geometry
