Rational Pavelka Predicate Logic is a Conservative Extension of Lukasiewicz 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 \bar{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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

The liar paradox and fuzzy logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (1):339-346.
The liar paradox and fuzzy logic.Petr Hájek, Jeff Paris & John Shepherdson - 2000 - Journal of Symbolic Logic 65 (1):339-346.
A Note On Hájek, Paris And Shepherdson's Theorem.Shunsuke Yatabe - 2005 - Logic Journal of the IGPL 13 (2):261-266.
Logic: an introduction.Greg Restall - 2006 - New York: Routledge.
On witnessed models in fuzzy logic II.Petr Hájek - 2007 - Mathematical Logic Quarterly 53 (6):610-615.
CE is not a conservative extension of E.Edwin D. Mares - 2000 - Journal of Philosophical Logic 29 (3):263-275.

Analytics

Added to PP
2017-02-21

Downloads
9 (#1,232,561)

6 months
1 (#1,506,218)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Jeffrey Paris
University of Manchester

References found in this work

No references found.

Add more references