Skip to main content

Non-standard satisfaction classes

Contributed Papers

Part of the Lecture Notes in Mathematics book series (LNM,volume 537)

Keywords

  • Free Variable
  • Atomic Formula
  • Predicate Symbol
  • Induction Scheme
  • Arithmetical Formula

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   44.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   59.95
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • I. Barwise, J. Schlipf [1975], On Recursively Saturated Models or Arithmetic, preprint.

    Google Scholar 

  • C.C. Chang, H.J. Keisler [1973], Theory of Models, North Holland.

    Google Scholar 

  • A. Ehrenfeucht, G. Kreisel [1966], Strong Models of Arithmetic, Bull. Acad. Pol. Sci., 14, 107–110.

    MathSciNet  MATH  Google Scholar 

  • S. Krajewski [1974] Predicative Expansions of Axiomatic Theries, Zeitsch. Math. Log. Gr. Math. 20, 435–452.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • S. Krajewski [1974a], Mutually Inconsistent Satisfaction Classes, Bull. Acad. Pol. Sci. 22, 883–887.

    MathSciNet  MATH  Google Scholar 

  • S. Krajewski [1975], A Note on Expansions of Models for Set Theories, Proceedings of Karpacz 1974 Logic Conference.

    Google Scholar 

  • R. Montague [1961], Semantic Closure and Non-finite Axiomatizability, in: Infinistic Methods, PWN and Pergamon Press.

    Google Scholar 

  • A. Mostowski [1950], Some Impredicative Definitions in Axiomatic Set Theory, Fund. Math. 37, 111–124.

    MathSciNet  MATH  Google Scholar 

  • A. Robinson [1963], On Languages Based on Non-standard Arithmetic, Nagoya Math. J. 22, 83–107.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • S. Shelah [1971], Remark to Local Definability Theory of Reyes, Ann. Math. Log. 2, 441–448.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • A. Tarski [1933], Pojęcie Prawdy w Językach Nauk Dedukcyjnych, nakładem Towarzystwa Naukowego Warszawskiego.

    Google Scholar 

  • R.L. Vaught [1967], Axiomatizability by a Schema, J. Symb. Log. 32, 473–479.

    CrossRef  MathSciNet  MATH  Google Scholar 

  • P. Vopenka, P. Hàjek [1973], Existence of a Generalized Semantic Model of GB, Bull. Acad. Pol. Sci. 21, 1079–1086.

    MATH  Google Scholar 

  • A. Wilkie [1973], Arithmetical Parts of Strong Theories, preprint.

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1976 Springer-Verlag

About this paper

Cite this paper

Krajewski, S. (1976). Non-standard satisfaction classes. In: Marek, W., Srebrny, M., Zarach, A. (eds) Set Theory and Hierarchy Theory A Memorial Tribute to Andrzej Mostowski. Lecture Notes in Mathematics, vol 537. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0096898

Download citation

  • DOI: https://doi.org/10.1007/BFb0096898

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07856-2

  • Online ISBN: 978-3-540-38122-8

  • eBook Packages: Springer Book Archive