Alfred Tarski and decidable theories

Any list of Alfred Tarski's achievements would mention his decision procedure for real-closed fields. He proved a number of other less publicized decidability results too. We shall survey these results. After surveying them we shall ask what Tarski had in mind when he proved them. Today our emphases and concepts are sometimes different from those of Tarski in the early 1930s. Some of these changes are the direct result of Tarski's own fundamental work in model theory during the intervening years. Tarski's work on decidable theories is important not just for the individual decidability theorems themselves. His method for all these decidability results was elimination of quantifiers, and he systematically used this method to prove a range of related theorems about completeness and definability. He also led several of his students to do important work using this same method. Tarski's use of quantifier elimination has had a deep and cumulative influence on model theory and the logical treatment of algebraic theories. We thank Solomon Feferman, Steven Givant, Haragauri Gupta, Yuri Gurevich. Angus Macintyre, Gregory Moore, Robert Vaught and the referee for helpful discussions and comments. Also we thank Madame Maria Mostowska and Roman Murawski for sending us material from Polish libraries.

[1]  Grete Hermann,et al.  Die Frage der endlich vielen Schritte in der Theorie der Polynomideale , 1926 .

[2]  A. Pillay,et al.  Definable sets in ordered structures , 1984 .

[3]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[4]  L. W. Szczerba.  Tarski and Geometry , 1986, J. Symb. Log..

[5]  Leopold Löwenheim.  Über Möglichkeiten im Relativkalkül , 1915 .

[6]  A. Church.  An Unsolvable Problem of Elementary Number Theory , 1936 .

[7]  C. H. Langford.  Some Theorems on Deducibility , 1926 .

[8]  Wanda Szmielew.  Elementary properties of Abelian groups , 1955 .

[9]  S. Kleene.  Recursive predicates and quantifiers , 1943 .

[10]  F. F. Husser.  ZUR GENEALOGIE DER ZAHL , 1958 .

[11]  George F. McNulty,et al.  Alfred Tarski and undecidable theories , 1986, Journal of Symbolic Logic.

[12]  Abraham Adolf Fraenkel.  Einleitung in die Mengenlehre , 1919 .

[13]  M. Fischer,et al.  SUPER-EXPONENTIAL COMPLEXITY OF PRESBURGER ARITHMETIC , 1974 .

[14]  Verena Huber Dyson.  On the decision problem for theories of finite models , 1964 .

[15]  C. H. Langford.  Theorems on Deducibility , 1926 .

[16]  Ю.Л. Ершов,et al.  Разрешимость элементарной теории дистрибутивных структур с относительными дополнениями и теории фильтров , 1964 .

[17]  A. Pillay,et al.  DEFINABLE SETS IN ORDERED STRUCTURES. I , 1986 .

[18]  S. Feferman,et al.  The first order properties of products of algebraic systems , 1959 .

[19]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[20]  Abraham Robinson.  RELATIVE MODEL-COMPLETENESS AND THE ELIMINATION OF QUANTIFIERS1 , 1958 .

[21]  M. Morley.  Categoricity in power , 1965 .

[22]  Robert L. Vaught,et al.  Alfred Tarski's work in model theory , 1986, Journal of Symbolic Logic.

[23]  J. Donald Monk,et al.  The contributions of Alfred Tarski to algebraic logic , 1986, Journal of Symbolic Logic.

[24]  Saharon Shelah,et al.  Classification theory - and the number of non-isomorphic models, Second Edition , 1990, Studies in logic and the foundations of mathematics.

[25]  Lou van den Dries,et al.  Alfred Tarski's Elimination Theory for Real Closed Fields , 1988, J. Symb. Log..

[26]  W. Ackermann,et al.  Grundzuge der Theoretischen Logik , 1928 .

[27]  Alan H. Mekler.  Stationary logic of ordinals , 1984, Ann. Pure Appl. Log..

[28]  J. Ferrante,et al.  The computational complexity of logical theories , 1979 .