Skip to main content

Gödel’s Compactness Theorem

  • Chapter
  • 2790 Accesses

Part of the book series: UNITEXT ((UNITEXTMAT))

Abstract

So far we have considered only finite sets of clauses. But as we will see in the second part of this course, infinite sets play an important rôle. Therefore we extend the notion of satisfiability as follows: Satisfaction of an infinite set of clauses. Let S be a (finite or infinite) set of clauses. Let V ar (S) denote the set of variables that occur in the clauses of S. Then an assignment α is suitable for S if the domain of α contains V ar (S). We say that α satisfies S, and write

$$\alpha \vDash S,$$

if it satisfies each clause of S; S is unsatisfiable if no assignment satisfies it.

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

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 EPUB and 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

Learn about institutional subscriptions

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Italia

About this chapter

Cite this chapter

Mundici, D. (2012). Gödel’s Compactness Theorem. In: Logic: A Brief Course. UNITEXT(). Springer, Milano. https://doi.org/10.1007/978-88-470-2361-1_6

Download citation

Publish with us

Policies and ethics