This HTML5 document contains 1 embedded RDF statements represented using HTML+Microdata notation.
The embedded RDF content will be recognized by any processor of HTML5 Microdata.
| Prefix | Namespace IRI |
| rdfs | http://www.w3.org/2000/01/rdf-schema# |
| rdf | http://www.w3.org/1999/02/22-rdf-syntax-ns# |
| xsdh | http://www.w3.org/2001/XMLSchema# |
| dbpedia | http://dbpedia.org/resource/ |
- Subject Item
- dbpedia:Consistency
- rdfs:comment
-
In classical deductive logic, a consistent theory is one that does not contain a contradiction. The lack of contradiction can be defined in either semantic or syntactic terms. The semantic definition states that a theory is consistent if and only if it has a model, i.e. there exists an interpretation under which all formulas in the theory are true. This is the sense used in traditional Aristotelian logic, although in contemporary mathematical logic the term satisfiable is used instead.