Hostname: page-component-cd9895bd7-gvvz8 Total loading time: 0 Render date: 2024-12-25T18:48:29.605Z Has data issue: false hasContentIssue false
  • English
  • Français

Satisfaction relations for proper classes: Applications in logic and set theory

Published online by Cambridge University Press:  12 March 2014

Robert A. Van Wesep
Robert A. Van Wesep*
Affiliation:
1402 Bolton Street, Baltimore, MD, 21217, USA, E-mail:rvanwesep@verizon.net
Get access Rights & Permissions [Opens in a new window]

Abstract

We develop the theory of partial satisfaction relations for structures that may be proper classes and define a satisfaction predicate (⊨*) appropriate to such structures. We indicate the utility of this theory as a framework for the development of the metatheory of first-order predicate logic and set theory, and we use it to prove that for any recursively enumerable extension Θ of ZF there is a finitely axiomatizable extension *Θ′ of GB that is a conservative extension of Θ. We also prove a conservative extension result that justifies the use of ⊨* to characterize ground models for forcing constructions.

Keywords

satisfactionproper classclass theoryconservative extensionconservationforcing
Type
Research Article
Information
The Journal of Symbolic Logic , Volume 78 , Issue 2 , June 2013 , pp. 345 - 368
Copyright
Copyright © Association for Symbolic Logic 2013

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

[1]Bernays, P., A system of axiomatic set theory—Part I, this Journal, vol. 2 (1937), pp. 65–77.Google Scholar
[2]Craig, W. and Vaught, R. L., Finite axiomatizability using additional predicates, this Journal, vol. 23 (1958), pp. 289–308.Google Scholar
[3]Jech, T., Set theory, third ed., Springer Monographs in Mathematics, Springer-Verlag, Berlin, 2003.Google Scholar
[4]Kleene, S. C., Finite axiomatizability of theories in the predicate calculus using additional predicate symbols, Memoirs of the American Mathematical Society, vol. 1952 (1952), no. 10, pp. 27–68.Google Scholar
[5]Lévy, A., Basic set theory, first ed., Springer-Verlag, New York, 1979.CrossRefGoogle Scholar
[6]Montague, R., Semantical closure and non-finite axiomatizability. I, Infinitistic Methods, Pergamon, Oxford; Państwowe Wydawnictwo Naukowe, Warsaw, 1961, pp. 45–69.Google Scholar
[7]Mostowski, A., Some impredicative definitions in the axiomatic set-theory, Fundamenta Mathematicae, vol. 37 (1950), pp. 111–124.CrossRefGoogle Scholar
[8]Mostowski, A., On models of axiomatic systems. Fundamenta Mathematicae, vol. 39 (1952), pp. 133–158.CrossRefGoogle Scholar
[9]Parsons, C., Sets and classes, Noûs, vol. 8 (1974), no. 1, pp. 1–12.CrossRefGoogle Scholar
[10]Ryll-Nardzewski, C., The role of the axiom of induction in elementary arithmetic, Fundamenta Mathematicae, vol. 39 (1952), pp. 239–263.CrossRefGoogle Scholar
[11]Shoenfield, J. R., A relative consistency proof, this Journal, vol. 19 (1954), pp. 21–28.Google Scholar
[12]Simpson, S. G., Subsystems of second order arithmetic, second ed., Perspectives in Logic, Association for Symbolic Logic and Cambridge University Press, 2009.CrossRefGoogle Scholar
[13]Solovay, R. M., Reinhardt, W. N., and Kanamori, A., Strong axioms of infinity and elementary embeddings, Annals of Mathematical Logic, vol. 13 (1978), no. 1, pp. 73–116.CrossRefGoogle Scholar
[14]Takeuti, G., Proof theory, Elsevier, New York, 1975, Studies in Logic and the Foundations of Mathematics, Vol. 81.Google Scholar
[15]Wesep, R. A. Van, Foundations of Mathematics, www.mathetal.net/books.php.Google Scholar