Switch to: Citations

Add references

You must login to add references.
  1. Finite-valued reductions of infinite-valued logics.Aguzzoli Stefano & Gerla Brunella - 2002 - Archive for Mathematical Logic 41 (4):361-399.
    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.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The method of hypersequents in the proof theory of propositional non-classical logics.Arnon Avron - 1977 - In Wilfrid Hodges (ed.), Logic. New York: Penguin Books. pp. 1-32.
    Until not too many years ago, all logics except classical logic (and, perhaps, intuitionistic logic too) were considered to be things esoteric. Today this state of a airs seems to have completely been changed. There is a growing interest in many types of nonclassical logics: modal and temporal logics, substructural logics, paraconsistent logics, non-monotonic logics { the list is long. The diversity of systems that have been proposed and studied is so great that a need is felt by many researchers (...)
    Download  
     
    Export citation  
     
    Bookmark   59 citations  
  • A complete many-valued logic with product-conjunction.Petr Hájek, Lluis Godo & Francesc Esteva - 1996 - Archive for Mathematical Logic 35 (3):191-208.
    A simple complete axiomatic system is presented for the many-valued propositional logic based on the conjunction interpreted as product, the coresponding implication (Goguen's implication) and the corresponding negation (Gödel's negation). Algebraic proof methods are used. The meaning for fuzzy logic (in the narrow sense) is shortly discussed.
    Download  
     
    Export citation  
     
    Bookmark   34 citations  
  • Fragments of Many-valued Statement Calculi.Alan Rose & John Barkley Rosser - 1958 - [S.N.].
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • The logic of inexact concepts.J. A. Goguen - 1969 - Synthese 19 (3-4):325-373.
    Download  
     
    Export citation  
     
    Bookmark   117 citations  
  • (1 other version)Proof Theory for Propositional Fuzzy Logic.D. M. Gabbay, G. Metcalfe & N. Olivetti - 2005 - Logic Journal of the IGPL 13:561-585.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A Constructive Analysis of $mathbf{RM}$.Arnon Avron - 1987 - Journal of Symbolic Logic 52 (4):939-951.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Embedding logics into product logic.Matthias Baaz, Petr Hájek, David Švejda & Jan Krajíček - 1998 - Studia Logica 61 (1):35-47.
    We construct a faithful interpretation of ukasiewicz's logic in product logic (both propositional and predicate). Using known facts it follows that the product predicate logic is not recursively axiomatizable.We prove a completeness theorem for product logic extended by a unary connective of Baaz [1]. We show that Gödel's logic is a sublogic of this extended product logic.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A constructive analysis of RM.Arnon Avron - 1987 - Journal of Symbolic Logic 52 (4):939 - 951.
    Download  
     
    Export citation  
     
    Bookmark   35 citations