Rational Pavelka predicate logic is a conservative extension of łukasiewicz predicate logic

Journal of Symbolic Logic 65 (2):669-682 (2000)
  Copy   BIBTEX

Abstract

Rational Pavelka logic extends Lukasiewicz infinitely valued logic by adding truth constants r̄ 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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,290

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
94 (#221,439)

6 months
4 (#1,232,162)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeffrey Paris
University of Manchester

References found in this work

Logic, Semantics, Metamathematics.Atwell Turquette - 1958 - Philosophical Review 67 (1):113.
On Fuzzy Logic III. Semantical completeness of some many-valued propositional calculi.Jan Pavelka - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (25-29):447-464.
Fuzzy logic and arithmetical hierarchy, II.Petr Hájek - 1997 - Studia Logica 58 (1):129-141.

Add more references