Skip to main content

Recursive Equivalence

  • Chapter
Combinatorial Functors

Part of the book series: Ergebnisse der Mathematik und ihrer Grenzgebiete ((MATHE2,volume 81))

  • 228 Accesses

Abstract

Let L be a complete effectively presented countable first order language with identity. Let L(C) be the extension of L obtained by adding a fully effective countably infinite set of individual constants. If T′ is a complete theory in L(C) and T a theory in L then T′ is said to be a witness completion of T if T′ ⊇ T and whenever ∃ υ n φ (υ n ) is in T, then φ (c) is in T′ for some cC. The Henkin-Hasenjaeger proof of completeness of first order logic has an obvious effective version obtained by simply making all listings effective (see Mendelson [1964] exercise p. 65 and Proposition 2.12). There is also an obvious relativized version.

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

Access this chapter

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

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Crossley, J.N., Nerode, A. (1974). Recursive Equivalence. In: Combinatorial Functors. Ergebnisse der Mathematik und ihrer Grenzgebiete, vol 81. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-85933-5_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-85933-5_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-85935-9

  • Online ISBN: 978-3-642-85933-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics