Skip to main content
SpringerLink
Log in

On decomposable sentences for finite models

  • Chapter
  • First Online:
Around Classification Theory of Models

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

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

Access this chapter

Log in via an institution
eBook
USD 16.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 16.99
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. C. Cang and H. J. Keisler, Model Theory, North Holland Publ. Co.

    Google Scholar 

  2. L. Deneberg, Y. Gurevich and S. Shelah, Cardinalities definable by constant depth polynomial size circuits. Information and Control.

    Google Scholar 

Download references

Authors
  1. Saharon Shelah
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this chapter

Cite this chapter

Shelah, S. (1986). On decomposable sentences for finite models. In: Around Classification Theory of Models. Lecture Notes in Mathematics, vol 1182. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0098516

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16448-7

  • Online ISBN: 978-3-540-39788-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation