Hostname: page-component-848d4c4894-cjp7w Total loading time: 0 Render date: 2024-06-28T20:19:43.578Z Has data issue: false hasContentIssue false
  • English
  • Français

Sentences true in all constructive models

Published online by Cambridge University Press:  12 March 2014

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

Extract

Let P0, …,Pq be predicates, of which at least one has two or more places. By a formula in P0, …, Pq (or simply a formula, when the list P0, …, Pq is fixed, as in this section) is meant any formula whose only symbols, other than sentential connectives, quantifiers, and (individual) variables, are among P0, …, Pq. A realization (or possible model) of such a formula is a system where A is a non-empty set and each Pk is a relation among the elements of A, having the same number of places as Pk.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 25 , Issue 1 , March 1960 , pp. 39 - 53
Copyright
Copyright © Association for Symbolic Logic 1960

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

[I]Church, A., Introduction to mathematical logic, vol. 1, Princeton, 1956.Google Scholar
[2]Cobham, A., Effectively decidable theories, Summaries of talks at the Summer Institute of Symbolic Logic at Cornell University 1957, (mimeographed), vol. 1, pp. 391–395.Google Scholar
[3]Cobham, A., Some results concerning theories with recursively enumerable complements, to appear in this Journal.Google Scholar
[4]Ehrenfeucht, A., Two theories with axioms built by means of pleonasms, this Journal, vol. 22 (1957), pp. 36–38.Google Scholar
[5]Hasenjaeger, G., Eine Bemerkung zu Henkin's Beweis für die Vollständigkeit des Prädikatenkalküls der erster Stufe, this Journal, vol. 18 (1953), pp. 42–48.Google Scholar
[6]Henkin, L., The completeness of the first-order functional calculus, this Journal, vol. 14 (1949), pp. 159–166.Google Scholar
[7]Kalmár, L., Contributions to the reduction theory of the decision problem. Fourth paper. Reduction to the case of a finite set of individuals. Acta mathematica Aca-demiae Scientiarum Hungaricae, vol. 2 (1951), pp. 125–141.CrossRefGoogle Scholar
[8]Kleene, S. C., A symmetric form of Gödel's theorem, Indagationes mathematicae, vol. 12 (1950), pp. 244–246.Google Scholar
[9]Kreisel, G., Note on arithmetic models for consistent formulae of the predicate calculus II, Proceedings of the XI-th International Congress of Philosophy Amsterdam (North Holland Publ. Co.) and Louvain (Ed. Nauwelaerts, E.) 1953, vol. 14, pp. 39–49.Google Scholar
[10]Mostowski, A., On a system of axioms which has no recursively enumerable model, Fundamenta Mathematicae, vol. 40 (1953), pp. 56–61.CrossRefGoogle Scholar
[11]Mostowski, A., A formula with no recursively enumerable model, Fundamenta mathematicae, vol. 42 (1955), pp. 125–140.CrossRefGoogle Scholar
[12]Mostowski, A., On recursive models of formalized arithmetic, Bulletin de l'Académie Polonaise des Sciences, cl. III, vol. 5 (1957), pp. 705–710.Google Scholar
[13]Putnam, H., Decidability and essential undecidability, this Journal, vol. 22 (1957), pp. 39–54.Google Scholar
[14]Szmielew, W. and Tarski, A., Theorems common to all complete and axiomatizable theories, Bulletin of the American Mathematical Society, vol. 55 (1949), p. 1075.Google Scholar
[15]Tarski, A., Mostowski, A., and Robinson, R. M., Undecidable theories, Amsterdam, 1953.Google Scholar
[16]Trahténbrot, B. A., Névozmožnost' algorifma dlá problémy razréšimosti na konéčnyh klassah (Impossibility of an algorithm for the decision problem in finite classes), Doklady Akadémii Nauk SSSR, vol. 70 (1950), pp. 569–572.Google Scholar
[17]Trahténbrot, B. A., O rékursivnoj otdélimosti (On recursive separability), Doklady Akadémii Nauk SSSR, vol. 88 (1953), pp. 953–956.Google Scholar
[18]Trahténbrot, B. A., Definition of finite sets and deductive incompleteness of the theory of sets, Izvéstiya Akadémii Nauk SSSR, ser. mat., vol. 20 (1956), pp. 569–582.Google Scholar
[19]Vaught, R. L., Non-recursive-enumerability of the set of sentences true in all constructive models, Bulletin of the American Mathematical Society, vol. 63 (1957), p. 230.Google Scholar
[20]Vaught, R. L., Sentences true in all constructive models, Summaries of talks at the Summer Institute of Symbolic Logic at Cornell University 1957 (mimeographed), vol. 1, pp. 51–55.Google Scholar