Skip to main content

On decomposable sentences for finite models

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

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   39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
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

  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

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