User:IssaRice/Computability and logic/Gödel's completeness theorem: Difference between revisions
No edit summary |
No edit summary |
||
| Line 2: | Line 2: | ||
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."<ref>https://math.stackexchange.com/a/436257/35525</ref> | 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."<ref>https://math.stackexchange.com/a/436257/35525</ref> | ||
if <math>\Gamma \models \phi</math> then <math>\Gamma \vdash \phi</math> | |||
==References== | ==References== | ||
<references/> | <references/> | ||
Revision as of 05:55, 21 December 2018
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]
if then
