Hostname: page-component-848d4c4894-pftt2 Total loading time: 0 Render date: 2024-05-11T03:00:55.727Z Has data issue: false hasContentIssue false
  • English
  • Français

Alfred Tarski and undecidable theories

Published online by Cambridge University Press:  12 March 2014

George F. McNulty
George F. McNulty*
Affiliation:
Department of Mathematics, University Of South Carolina, Columbia, South Carolina 29208
Get access Rights & Permissions [Opens in a new window]

Extract

Alfred Tarski identified decidability within various logical formalisms as one of the principal themes for investigation in mathematical logic. This is evident already in the focus of the seminar he organized in Warsaw in 1926. Over the ensuing fifty-five years, Tarski put forth a steady stream of theorems concerning decidability, many with far-reaching consequences. Just as the work of the 1926 seminar reflected Tarski's profound early interest in decidability, so does his last work, A formalization of set theory without variables, a monograph written in collaboration with S. Givant [8−m]. An account of the Warsaw seminar can be found in Vaught [1986].

Tarski's work on decidability falls into four broad areas: elementary theories which are decidable, elementary theories which are undecidable, the undecidability of theories of various restricted kinds, and what might be called decision problems of the second degree. An account of Tarski's work with decidable elementary theories can be found in Doner and van den Dries [1987] and in Monk [1986] (for Boolean algebras). Vaught [1986] discusses Tarski's contributions to the method of quantifier elimination. Our principal concern here is Tarski's work in the remaining three areas.

We will say that a set of elementary sentences is a theory provided it is closed with respect to logical consequence and we will say that a theory is decidable or undecidable depending on whether it is a recursive or nonrecursive set. The notion of a theory may be restricted in a number of interesting ways. For example, an equational theory is just the set of all universal sentences, belonging to some elementary theory, whose quantifier-free parts are equations between terms.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 51 , Issue 4 , December 1986 , pp. 890 - 898
Copyright
Copyright © Association for Symbolic Logic 1986

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

Adjan, S. I. [1958] On algorithmic problems in effectively complete classes of groups, Doklady Akademii Nauk SSSR, vol. 123, pp. 13–16. (Russian)Google Scholar
Boone, W. W. [1954] Certain simple unsolvable problems of group theory, Indagationes Mathematicae, vol. 16, pp. 231–237.CrossRefGoogle Scholar
Burris, S. and McKenzie, R. [1981] Decidability and Boolean representations, Memoirs of the American Mathematical Society, no. 246, American Mathematical Society, Providence, Rhode Island.CrossRefGoogle Scholar
Church, A. [1936] A note on the Entscheidungsproblem, this Journal, vol. 1, pp. 40–41, 101-102.Google Scholar
Church, A. [1936a] An unsolvable problem of elementary number theory, American Journal of Mathematics, vol. 58, pp. 345–363.CrossRefGoogle Scholar
Doner, J. and van den Dries, L. [1987] This Journal, vol. 52 (to appear).Google Scholar
Ershov, Yu. L., Lavrov, I. A., Taǐmanov, A. D. and Taǐtslin, M. A. [1965] Elementary theories, Uspehi Matematičeskih Nauk, vol. 20, no. 4 (124), pp. 37–108; English translation, Russian Mathematical Surveys, vol. 20, no. 4, pp. 35–105.Google Scholar
Freese, R. [1980] Free modular lattices, Transactions of the American Mathematical Society, vol. 261, pp. 81–92.CrossRefGoogle Scholar
Garcia, O. and Taylor, W. [1984] The lattice of interpretability types of varieties, Memoirs of the American Mathematical Society, no. 305, American Mathematical Society, Providence, Rhode Island.CrossRefGoogle Scholar
Gödel, K. [1931] Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme. I, Monatshefte für Mathematik und Physik, vol. 38, pp. 173–198.Google Scholar
Jónsson, B. [1986] The contributions of Alfred Tarski to general algebra, this Journal, vol. 51, pp. 883–889.Google Scholar
Linial, S. and Post, E. [1949] Recursive unsolvability of the deducibility, Tarski 's completeness and independence of axioms problems of prepositional calculus, Bulletin of the American Mathematical Society, vol. 55, p. 50.Google Scholar
Lyndon, R. C. [1950] The representation of relational algebras, Annals of Mathematics, ser. 2, vol. 51, pp. 707–729.CrossRefGoogle Scholar
Maddux, R. [1978] Topics in relation algebras, Ph.D. Thesis, University of California, Berkeley, California.Google Scholar
Maddux, R. [1978a] Some sufficient conditions for the representability of relation algebras, Algebra Universalis, vol. 8, pp. 162–172.CrossRefGoogle Scholar
Maddux, R. [1980] The equational theory of CA3 is undecidable, this Journal, vol. 45, pp. 311–316.Google Scholar
Mal'cev, A. I. [1966] Identical relations on varieties of quasigroups, Matematičeskiǐ Sbornik, vol. 69 (111), pp. 3–12; English translation, [1971], Chapter XXIX, pp. 384–395.Google Scholar
Mal'cev, A. I. [1971] The metamathematics of algebraic systems: collected papers 1936–1967 (Wells, B. F. III, editor), North-Holland, Amsterdam.Google Scholar
Markov, A. A. [1947] On the impossibility of certain algorithms in the theory of associative systems. I, II, Doklady Akademii Nauk SSSR, vol. 55, pp. 587–590; vol. 58, pp. 353–356; English translation of I, Comptes Rendus (Doklady) de l'Académie des Sciences de l'URSS, vol. 55, pp. 583–586.Google Scholar
Markov, A. A. [1951a] Impossibility of certain algorithms in the theory of associative systems, Doklady Akademii Nauk SSSR, vol. 77, pp. 19–20. (Russian)Google Scholar
Markov, A. A. [1951b] The impossibility of algorithms for the recognition of certain properties of associative systems, Doklady Akademii Nauk SSSR, vol. 77, pp. 953–956. (Russian)Google Scholar
McKenzie, R. [1975] On spectra, and the negative solution of the decision problem for identities having a finite nontrivial model, this Journal, vol. 40, pp. 186–196.Google Scholar
McKenzie, R. [1982] Subdirect powers of nonabelian groups, Houston Journal of Mathematics, vol. 8, pp. 389–399.Google Scholar
McNulty, G. [1972] The decision problem for equational bases of algebras, Ph.D. Thesis, University of California, Berkeley, California.Google Scholar
Monk, J. D. [1986] The contributions of Alfred Tarski to algebraic logic, this Journal, vol. 51, pp. 899–906.Google Scholar
Murskiǐ, V. L. [1971] Nondiscernible properties of finite systems of identity relations, Doklady Akademii Nauk SSSR, vol. 196, pp. 520–522; English translation, Soviet Mathematics Doklady, vol. 12, pp. 183–186.Google Scholar
Mycielski, J. [1977] A lattice of interpretability types of theories, this Journal, vol. 42, pp. 297–305.Google Scholar
Novikov, P. S. [1955] On the algorithmic undecidability of the word problem in groups, Trudy Matematičeskogo Instituta imeni V. A. Steklova, vol. 44, Izdatel'stvo Akademii Nauk SSSR, Moscow, 1955; English translation, American Mathematical Society Translations, ser. 2, vol. 9, American Mathematical Society, Providence, Rhode Island, 1958, pp. 1–122.Google Scholar
Paris, J. B. and Harrington, L. [1977] A mathematical incompleteness in Peano's arithmetic, Handbook of mathematical logic (Barwise, J., editor), North-Holland, Amsterdam, pp. 1113–1142.Google Scholar
Perkins, P. [1966] Decision problems for equational theories of semigroups and general algebras, Ph.D. Thesis, University of California, Berkeley, California.Google Scholar
Pigozzi, D. [1976] Base-undecidable properties of universal varieties, Algebra Universalis, vol. 6, pp. 193–223.CrossRefGoogle Scholar
Post, E. L. [1947] Recursive unsolvability of a problem of Thue, this Journal, vol. 12, pp. 1–11.Google Scholar
Rabin, M. [1958] Recursive unsolvability of group theoretic problems, Annals of Mathematics, ser. 2, vol. 67, pp. 172–194.CrossRefGoogle Scholar
Rabin, M. [1965] A simple method for undecidability proofs and some applications, Logic, methodology and philosophy of science (proceedings, Jerusalem, 1964; Bar-Hillel, Y., editor), North-Holland, Amsterdam, pp. 58–68.Google Scholar
Robinson, J. [1950] General recursive functions, Proceedings of the American Mathematical Society, vol. 1, pp. 703–718.CrossRefGoogle Scholar
Rosser, J. B. [1936] Extensions of some theorems of Gödel and Church, this Journal, vol. 1, pp. 87–91.Google Scholar
Singletary, W. [1968] Results regarding the axiomatization of partial propositional calculi, Notre Dame Journal of Formal Logic, vol. 9, pp. 193–221.CrossRefGoogle Scholar
Szczerba, L. [1977] Interpretability of elementary theories, Logic, foundations of mathematics, and computability theory (proceedings, London, Ontario, 1975; Butts, R. E. and Hintikka, J., editors), Reidel, Dordrecht, pp. 129–145.Google Scholar
Vaught, R. L. [1986] Alfred Tarski's work in model theory, this Journal, vol. 51, pp. 869–882.Google Scholar
Yntema, M. [1964] A detailed argument for the Post-Linial theorems, Notre Dame Journal of Formal Logic, vol. 5, pp. 37–51.CrossRefGoogle Scholar
Zamjatin, A. P. [1978] A nonabelian variety of groups has an undecidable elementary theory, Algebra i Logika, vol. 17, pp. 20–27; English translation, Algebra and Logic, vol. 17, pp. 13–17.Google Scholar