It is not the case that Henkin's theorem establishes that every consistent set of formulas has a model, making syntactic consistency and semantic satisfiability equivalent (assuming soundness).
?Set your confidence on the premises below to see your aggregate.
No one has weighed in yet. Be the first to share reasons for or against this statement.