Finite-valued reductions of infinite-valued logics

Archive for Mathematical Logic 41 (4):361-399 (2002)

Abstract
In this paper we present a method to reduce the decision problem of several infinite-valued propositional logics to their finite-valued counterparts. We apply our method to Łukasiewicz, Gödel and Product logics and to some of their combinations. As a byproduct we define sequent calculi for all these infinite-valued logics and we give an alternative proof that their tautology problems are in co-NP
Keywords Legacy
Categories (categorize this paper)
DOI 10.1007/s001530100118
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 39,545
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

Analytic Calculi for Product Logics.George Metcalfe, Nicola Olivetti & Dov Gabbay - 2004 - Archive for Mathematical Logic 43 (7):859-889.

Add more citations

Similar books and articles

Finiteness in Infinite-Valued Łukasiewicz Logic.Stefano Aguzzoli & Agata Ciabattoni - 2000 - Journal of Logic, Language and Information 9 (1):5-29.
How to Avoid Deviance (in Logic).Walter Sinnott-Armstrong & Amit Malhotra - 2002 - History and Philosophy of Logic 23 (3):215--36.
Mathematical Fuzzy Logics.Siegfried Gottwald - 2008 - Bulletin of Symbolic Logic 14 (2):210-239.

Analytics

Added to PP index
2013-11-23

Total views
16 ( #463,418 of 2,325,427 )

Recent downloads (6 months)
6 ( #267,439 of 2,325,427 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature