No label defined (Q3700870)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3926284
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3926284 |
Statements
1984
0 references
foundations of geometry
0 references
polynomial equations
0 references
0 references
0.9048125
0 references
0.90289456
0 references
0.9008203
0 references
0 references
[For the entire collection see Zbl 0545.00023.] Tarski has shown that elementary geometry is decidable and hence in principle accessible to a mechanical theorem prover. This insight has been of very little practical value so far because of the complexity of the decision algorithm. The approach under consideration deals with elementary geometry without the notion of betweenness and uses a very different method than the one of Tarski's. Geometrical problems are translated into polynomial equations, i.e. into a problem of algebraic geometry. Decidability questions of such kind have been investigated already some 60 years ago (G. Hermann). The methods developed in this direction have also turned out to be not feasable. It has been overlooked all the time that the special character of the algebraic decision problems arising from elementary geometry allow an efficient reduction to surprisingly simple problems. The theoretical background for this reduction is given in theorems 1, 2 and 3. Some examples illustrate the method very well.
0 references