I'm having trouble with a section of the Completeness Proof for First-Order Predicate Logic, which depends on if [MATH]\Phi[/MATH] is a
set of consistent [MATH]\mathcal L[/MATH]-formulas, then [MATH]\Phi[/MATH] is satisfiable.
How is that constructed? There are a large number of Lemmas working from Machover's text Set theory, Logic and Their Limitations but I'm having trouble with which are most relevant and how it comes together.
set of consistent [MATH]\mathcal L[/MATH]-formulas, then [MATH]\Phi[/MATH] is satisfiable.
How is that constructed? There are a large number of Lemmas working from Machover's text Set theory, Logic and Their Limitations but I'm having trouble with which are most relevant and how it comes together.