Rational Pavelka logic extends Lukasiewicz infinitely valued logic by adding truth constants for rationals in [0,1]. We show that this is a conservative extension. We note that this shows that provability degree can be defined in Lukasiewicz logic. We also give a counterexample to a soundness theorem of Belluce and Chang published in 1963.
|Translated title of the contribution||Rational Pavelka predicate logic is a conservative extension of Lukasiewicz predicate logic|
|Pages (from-to)||669 - 682|
|Number of pages||14|
|Journal||Journal of Symbolic Logic|
|Publication status||Published - Jun 2000|