Skip to main content
SpringerLink
Log in

Finite-valued reductions of infinite-valued logics

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. ITC-IRST, Via Sommarive 18, 38050 Trento, Italy, , , , , , IT

    Stefano Aguzzoli

  2. Department of Computer Science, University of Milan, Via Comelico 39, 20135 Milano, Italy. e-mail: {aguzzoli; gerlab}@dsi.unimi.it, , , , , , IT

    Brunella Gerla

Authors
  1. Stefano Aguzzoli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Brunella Gerla
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 6 April 2000 / Published online: 27 March 2002

Rights and permissions

Reprints and permissions

About this article

Cite this article

Aguzzoli, S., Gerla, B. Finite-valued reductions of infinite-valued logics. Arch. Math. Logic 41, 361–399 (2002). https://doi.org/10.1007/s001530100118

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s001530100118

Keywords

Search

Navigation