Jump to content

Want site search autocompletion? See here
Encountering 429 Too Many Requests errors when browsing the site? See here

User:IssaRice/Computability and logic/Semantic completeness

From Machinelearning

< User:IssaRice

Revision as of 05:18, 21 December 2018 by IssaRice (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Semantic completeness is sometimes written as: if $T\models \phi$ , then $T\vdash \phi$ .

Semantic completeness differs from negation completeness.

Retrieved from "https://machinelearning.subwiki.org/w/index.php?title=User:IssaRice/Computability_and_logic/Semantic_completeness&oldid=1147"