User:IssaRice/Computability and logic/Gödel's completeness theorem

From Machinelearning
< User:IssaRice
Revision as of 05:49, 21 December 2018 by IssaRice (talk | contribs) (Created page with "I'm confused about the following framing: "The completeness theorem says that, if a bunch of sentences is consistent in the sense of not entailing a contradiction [in a standa...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

I'm confused about the following framing: "The completeness theorem says that, if a bunch of sentences is consistent in the sense of not entailing a contradiction [in a standard system of first-order logic] then it has a model."[1]

  1. ↑ https://math.stackexchange.com/a/436257/35525
Retrieved from "https://machinelearning.subwiki.org/w/index.php?title=User:IssaRice/Computability_and_logic/Gödel%27s_completeness_theorem&oldid=1154"