Advertisement

Compactness

  • Raymond M. Smullyan
Part of the Ergebnisse der Mathematik und ihrer Grenzgebiete book series (MATHE2, volume 43)

Abstract

Let us consider a finite or denumerable set S of formulas. We recall that a Boolean valuation v is said to satisfy S iff all the elements of S are true under v, and that S is satisfiable iff S is satisfied by at least one Boolean valuation.

Keywords

Finite Subset Compactness Theorem Propositional Variable Disjunctive Normal Form Analytic Proof 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin · Heidelberg 1968

Authors and Affiliations

  • Raymond M. Smullyan
    • 1
  1. 1.Lehman CollegeCity University of New YorkUSA

Personalised recommendations