Back to Search Start Over

Soundness and Completeness Results

Authors :
Hannes Leitgeb
Source :
Applied Logic Series ISBN: 9789048166695
Publication Year :
2004
Publisher :
Springer Netherlands, 2004.

Abstract

Now we can relate the semantical systems of sections 9.1, 9.2 and 9.3 to the syntactical systems of chapter 10 by means of soundness and completeness theorems. We are going to present three kinds of such theorems: (“strong”) soundness and completeness concerning derivability on the syntactical side and entailment on the semantical side, (“weak”) soundness and completeness concerning provability on the syntactical side and validity on the semantical side, and (“strong”) soundness and completeness concerning conditional theories on the syntactical side and conditional theories that are associated with models on the semantical side. The completeness parts of the theorems of the latter kind correspond to the type of completeness theorem by which a consistent classical theory is shown to have a non-empty set of classical models; in the case of probability semantics, such a kind of theorem is of course only available if the probability semantics considered includes the notion of a model.

Details

ISBN :
978-90-481-6669-5
ISBNs :
9789048166695
Database :
OpenAIRE
Journal :
Applied Logic Series ISBN: 9789048166695
Accession number :
edsair.doi...........db640c046f2d56d5f294f1690bbfb574