User:IssaRice/Computability and logic/Gödel's completeness theorem: Difference between revisions
(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...") |
No edit summary |
||
| Line 1: | Line 1: | ||
[[../Semantic completeness|semantic completeness]] | |||
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> | ||
==References== | |||
<references/> | |||
Revision as of 05:50, 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]