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:17, 21 December 2018 by IssaRice (talk | contribs) (Created page with "Semantic completeness is sometimes written as: if <math>T \models \phi</math>, then <math>T \vdash \phi</math>.")

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

Semantic completeness is sometimes written as: if $T ⊨ ϕ$ , then $T ⊢ ϕ$ .

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