Embedding logics into product logic

Studia Logica 61 (1):35-47 (1998)
  Copy   BIBTEX


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



    Upload a copy of this work     Papers currently archived: 92,075

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

64 (#253,401)

6 months
11 (#239,725)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

On n -contractive fuzzy logics.Rostislav Horčík, Carles Noguera & Milan Petrík - 2007 - Mathematical Logic Quarterly 53 (3):268-288.
Analytic Calculi for Product Logics.George Metcalfe, Nicola Olivetti & Dov Gabbay - 2004 - Archive for Mathematical Logic 43 (7):859-889.

Add more citations

References found in this work

Bounded arithmetic, propositional logic, and complexity theory.Jan Krajíček - 1995 - New York, NY, USA: Cambridge University Press.
A complete many-valued logic with product-conjunction.Petr Hájek, Lluis Godo & Francesc Esteva - 1996 - Archive for Mathematical Logic 35 (3):191-208.
Fuzzy logic and arithmetical hierarchy, II.Petr Hájek - 1997 - Studia Logica 58 (1):129-141.

Add more references