Skip to main content
SpringerLink
Log in
Book cover

Set Theory and Hierarchy Theory V pp 291–304Cite as

On the decidability of the theory of linear orderings in the language L(Q1)

  • Contributed Papers
  • Conference paper
  • First Online:

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

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (USA)
  • 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

  1. A. Ehrenfeucht, Decidability of the theory of the linear ordering relation, A.M.S. Notices, Vol. 6 No.3 Issue 38, June 1959, pp. 556–38.

    MathSciNet  Google Scholar 

  2. H. Läuchli and J. Leonhard, On the elementary theory of linear order, Fund. Math. 59(1966) pp. 109–116.

    MathSciNet  MATH  Google Scholar 

  3. H.J. Keisler, Logic with the quantifier "There exist uncountably many" Ann. of math. logic 1 (1970) pp. 1–93.

    Article  MathSciNet  MATH  Google Scholar 

  4. L.D. Lippner, Some aspects of generalized quantifiers, Doctoral Dissertation, University of California, Berkeley 1970.

    Google Scholar 

  5. S. Vinner, A generalization of Ehrenfeucht's game and some applications, Israel J. Math., 12 (1972), pp. 279–298.

    Article  MathSciNet  MATH  Google Scholar 

  6. A. Mostowski, On a generalization of quantifiers, Fund. Math. 44 (1957) pp. 12–36.

    MathSciNet  MATH  Google Scholar 

  7. A. Slomson, Decision problems for generalized quantifiers — a survey, Lecture Notes in Mathematics 537 (1976) pp. 249–258.

    Article  MathSciNet  MATH  Google Scholar 

  8. S. Shelah, The monadic theory of order, Preprint.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Berlin, GDR

    H. P. Tuschik

Authors
  1. H. P. Tuschik
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alistair Lachlan Marian Srebrny Andrzej Zarach

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag

About this paper

Cite this paper

Tuschik, H.P. (1977). On the decidability of the theory of linear orderings in the language L(Q1). In: Lachlan, A., Srebrny, M., Zarach, A. (eds) Set Theory and Hierarchy Theory V. Lecture Notes in Mathematics, vol 619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0067660

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08521-8

  • Online ISBN: 978-3-540-37032-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation