Compactness

This document provides definitions and concepts related to logic, languages, structures, and the compactness theorem. It defines logical symbols and objects for propositional and first-order logic. A first-order language consists of function symbols, relation symbols, and constant symbols. A structure assigns interpretations to these symbols. The compactness theorem states that a theory is satisfiable if and only if every finite subset of the theory is satisfiable.