ISSN:
1572-8730
Schlagwort(e):
fuzzy logic
;
Łukasiewicz logic
;
Gödel logic
;
product logic
;
computational complexity
;
arithmetical hierarchy
Quelle:
Springer Online Journal Archives 1860-2000
Thema:
Mathematik
,
Philosophie
Notizen:
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).
Materialart:
Digitale Medien
URL:
http://dx.doi.org/10.1023/A:1005026229560
Permalink
