Skip to main content

The complexity of Tf and omitting types in FT

Contributed Papers

  • 949 Accesses

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

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

  1. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill, 1967.

    Google Scholar 

  2. A. Macintyre, Omitting quantifier-free types in generic structures, J.S.L. 37 (1972), 512–520.

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1975 Springer-Verlag

About this paper

Cite this paper

Simons, H. (1975). The complexity of Tf and omitting types in FT . In: Saracino, D.H., Weispfenning, V.B. (eds) Model Theory and Algebra. Lecture Notes in Mathematics, vol 498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0080987

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38057-3

  • eBook Packages: Springer Book Archive