Tarski's algorithm

Authors

  • Yuri Matiyasevich

Keywords:

quantors elimination, solvability of elementary algebra and geometry, Tarski's algorithm

Abstract

Tarskis algorithm allows to determine whether a given statement about a finite set of real numbers is true of false. Together with the Cartesian coordinate system, it allows to prove automatically a large class of theorems of elementary geometry. The version of the algorithm presented here is suitable for introduction to the subject - it is not difficult to understand the algorithm, it is easy to write a program, but it would be extremely inefficient.

Downloads

Published

2008-12-31

Issue

Section

Computer science

How to Cite

[1]
“Tarski’s algorithm”, Comput. Tools Educ., no. 6, Dec. 2008, Accessed: Oct. 23, 2026. Available: http://cte.eltech.ru/ojs/index.php/kio/article/view/1157

Most read articles by the same author(s)