ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Studia logica 61 (1998), S. 35-47 
    ISSN: 1572-8730
    Keywords: fuzzy logic ; Łukasiewicz logic ; Gödel logic ; product logic ; computational complexity ; arithmetical hierarchy
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Philosophy
    Notes: Abstract 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. We also prove NP-completeness of the set of propositional formulas satisfiable in product logic (resp. in Gödel's logic).
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...