Switch to: Citations

Add references

You must login to add references.
  1. An elementary proof of Chang's completeness theorem for the infinite-valued calculus of Lukasiewicz.Roberto Cignoli & Daniele Mundici - 1997 - Studia Logica 58 (1):79-97.
    The interpretation of propositions in Lukasiewicz's infinite-valued calculus as answers in Ulam's game with lies--the Boolean case corresponding to the traditional Twenty Questions game--gives added interest to the completeness theorem. The literature contains several different proofs, but they invariably require technical prerequisites from such areas as model-theory, algebraic geometry, or the theory of ordered groups. The aim of this paper is to provide a self-contained proof, only requiring the rudiments of algebra and convexity in finite-dimensional vector spaces.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Zum intuitionistischen aussagenkalkül.K. Gödel - 1932 - Anzeiger der Akademie der Wissenschaften in Wien 69:65--66.
    Download  
     
    Export citation  
     
    Bookmark   60 citations  
  • Fragments of Many-valued Statement Calculi.Alan Rose & John Barkley Rosser - 1958 - [S.N.].
    Download  
     
    Export citation  
     
    Bookmark   37 citations  
  • Fuzzy logic and fuzzy set theory.Gaisi Takeuti & Satoko Titani - 1992 - Archive for Mathematical Logic 32 (1):1-32.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.
    Download  
     
    Export citation  
     
    Bookmark   480 citations  
  • Fuzzy logic and arithmetical hierarchy, II.Petr Hájek - 1997 - Studia Logica 58 (1):129-141.
    A very simple many-valued predicate calculus is presented; a completeness theorem is proved and the arithmetical complexity of some notions concerning provability is determined.
    Download  
     
    Export citation  
     
    Bookmark   10 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  
  • An algebraic treatment of quantifier-free systems of arithmetic.Franco Montagna - 1996 - Archive for Mathematical Logic 35 (4):209-224.
    By algebraic means, we give an equational axiomatization of the equational fragments of various systems of arithmetic. We also introduce a faithful semantics according to which, for every reasonable system T for arithmetic, there is a model where exactly the theorems of T are true.
    Download  
     
    Export citation  
     
    Bookmark   1 citation