Hostname: page-component-784d4fb959-nxbs6 Total loading time: 0 Render date: 2025-07-15T10:59:02.109Z Has data issue: false hasContentIssue false
  • English
  • Français

Axiomatizability by a schema

Published online by Cambridge University Press:  12 March 2014

Robert L. Vaught
Robert L. Vaught*
Affiliation:
University of California, Berkeley
Get access Rights & Permissions [Opens in a new window]

Extract

A theory T is axiomatizable by a schema if there is a formula Γ, involving symbols of T plus a new relation symbol R, such that the set of all (universal closures of) instances of Γ in T is a set of axioms for T. (It is understood that, if R has n places, an instance of Γ in T is obtained by properly substituting for R in Γ a formula of T which has n selected free variables and is allowed to have any number of other free variables as parameters.) Obviously, the notion is unchanged if finitely many Γ's, each involving several new R's, are allowed instead. All theories we consider are assumed to be theories in the first-order logic with equality (as in [8]), to have finitely many nonlogical symbols, and to be recursively axiomatizable.

Information

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 32 , Issue 4 , February 1968 , pp. 473 - 479
Copyright
Copyright © Association for Symbolic Logic 1968

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.)

Article purchase

Temporarily unavailable

References

[1]Craig, W. and Vaught, R., Finite axiomatizability using additional predicates, this Journal, vol. 23 (1958), pp. 289–308.Google Scholar
[2]Feferman, S., Transfinite recursive progressions of axiomatic theories, this Journal, vol. 27 (1962), pp. 259–316.Google Scholar
[3]Janiszak, A., Undecidability of some formalized theories, Fundamenta Mathematicae, vol. 40 (1953), pp. 131–139.CrossRefGoogle Scholar
[4]Kleene, S. C., Quantification of number-theoretic functions, Compositio Mathematica, vol. 14 (1959), pp. 23–40.Google Scholar
[5]Lévy, A., Axiomatizability of induced theories, Proceedings of the American Mathematical Society, vol. 12 (1960), pp. 251–253.Google Scholar
[6]Lévy, A., Principles of reflection in axiomatic set theory, Fundamenta Mathematicae, vol. 49 (1960), pp. 1–10.CrossRefGoogle Scholar
[7]Montague, R., Semantical closure and non-finite axiomatizability, I. Proceedings of the Symposium on Logic: Infinitistic methods, Warsaw, 1959, Pergamon Press, New York, 1961, pp. 45–69.Google Scholar
[8]Tarski, A., Mostowski, A., and Robinson, R. M., Undecidable theories, North-Holland Publishing Company, Amsterdam, 1953.Google Scholar
[9]Thompson, F. B., Some contributions to abstract algebra and metamathematics. Doctoral Thesis, University of California, Berkeley, 1952.Google Scholar
[10]Vaught, R., On a theorem of Cobham concerning undecidable theories, Logic, Methodology, and Philosophy of Science, Proceedings of the International Congress, Stanford, California, 1960, Stanford University Press, Stanford, California, 1962, pp. 14–25.Google Scholar
[11 ]Vaught, R., Axiomatizability by a schema, Notices of the American Mathematical Society, vol. 11 (1964), p. 590.Google Scholar