| 单词 | Tarski's Theorem |
| 释义 | Tarski's TheoremTarski's theorem states that the first-order theory of the Field of Real Numbers is Decidable. However, the best-known Algorithm foreliminating Quantifiers is doubly exponential in the number of Quantifier blocks (Heintzet al. 1989).
Heintz, J.; Roy, R.-F.; and Solerno, P. ``Complexité du principe de Tarski-Seidenberg.'' C. R. Acad. Sci. Paris Sér. I Math. 309, 825-830, 1989. Marker, D. ``Model Theory and Exponentiation.'' Not. Amer. Math. Soc. 43, 753-759, 1996. Tarski, A. ``Sur les ensembles définissables de nombres réels.'' Fund. Math. 17, 210-239, 1931. Tarski, A. ``A Decision Method for Elementary Algebra and Geometry.'' RAND Corp. monograph, 1948. |
| 随便看 |
|
数学辞典收录了8975条数学词条，基本涵盖了常用数学知识及数学英语单词词组的翻译及用法，是数学学习的有利工具。