The Strong Completeness Theorem for n-Valued Sentential Logic

  • Lea Ann Mawler
  • Published 2007

Abstract

Classical logic has just two truth values, namely true and false. Any sentence symbol or well-formed formula will take one of these two truth values in any interpretation. Although we are familiar with 2-valued sentential logic, there is no inherent restriction on the number of truth values that can be assigned to a statement. There are other logics with… (More)

Topics

Cite this paper

@inproceedings{Mawler2007TheSC, title={The Strong Completeness Theorem for n-Valued Sentential Logic}, author={Lea Ann Mawler}, year={2007} }