Laboratory of Mathematical Logic at PDMI

Пятница, 27 декабря, комната 106. Начало в 16:30.

Докладчик: Ю. В. Матиясевич.

AN EASY TO UNDERSTAND PROOF OF TARSKI'S THEOREM ON THE DECIDABILITY OF THE THEORY OF REAL NUMBERS
I will present a proof of the famous theorem from the title which 1) is easy to understand; 2) is easy to implement 3) but the resulting algorithm is very inefficient, alas!
My presentation will be based on the talk given by Hoon Hong at ACA'2002 with some improvements.