Skip to main content

Maximally Consistent Extensions

  • Chapter
  • First Online:
  • 1609 Accesses

Abstract

Throughout this chapter, we require that all formulae are written in Polish notation and that the variables are among v0; v1; v2; : : : Notice that the former requirement is just another notation which does not involve brackets, and that by the Variable Substitution Theorem 2.12, the latter requirement gives us semantically equivalent formulae.

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

Buying options

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
Hardcover Book
USD   69.99
Price excludes VAT (USA)
  • Durable hardcover 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.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Halbeisen, L., Krapf, R. (2020). Maximally Consistent Extensions. In: Gödel's Theorems and Zermelo's Axioms. Birkhäuser, Cham. https://doi.org/10.1007/978-3-030-52279-7_4

Download citation

Publish with us

Policies and ethics