On Affine Logic and Łukasiewicz Logic

نویسندگان

  • Rob Arthan
  • Paulo Oliva
چکیده

The multi-valued logic of Lukasiewicz is a substructural logic that has been widely studied and has many interesting properties. It is classical, in the sense that it admits the axiom schema of double negation elimination, [DNE]. However, our understanding of Lukasiewicz logic can be improved by separating its classical and intuitionistic aspects. The intuitionistic aspect of Lukasiewicz logic is captured in an axiom schema, [CWC], which asserts the commutativity of a weak form of conjunction. We explain how this axiom is equivalent to a restricted form of contraction. We then show how Lukasiewicz Logic can be viewed both as an extension of classical affine logic with [CWC], or as an extension of what we call intuitionistic Lukasiewicz logic with [DNE], intuitionistic Lukasiewicz logic being the extension of intuitionistic affine logic by the schema [CWC]. At first glance, intuitionistic Lukasiewicz logic seems to be a very weak fragment of intuitionistic logic. We show that [CWC] is a surprisingly powerful (restricted) form of contraction, implying for instance all the intuitionistically valid De Morgan’s laws. However the proofs can be very intricate. These results are presented using derived connectives to clarify and motivate the proofs. Applications include: a simpler proof of the Ferreirim-Veroff-Spinks theorem, proof that idempotent elements of a hoop form a sub-hoop, proof that double negation is a hoop homomorphism, and proofs for the above mentioned De Morgan dualities. We conclude by showing that our homomorphism result on the doublenegation mapping in particular implies that all negative translations of classical into intuitionistic Lukasiewicz coincide (as they do in full intuitionistic logic). This is in contrast with affine logic for which we show, by appeal to results on semantics proved in a companion paper, that both the Gentzen and the Glivenko translations fail.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Computational Logic Approach to the Suppression Task

A novel approach to human conditional reasoning based on the three-valued Łukasiewicz logic is presented. We will demonstrate that the Łukasiewicz logic overcomes problems the sofar proposed Fitting logic has in reasoning with the suppression task. The approach can be implemented by an appropriate connectionist network. While adequately solving the suppression task, the approach gives rise to a...

متن کامل

Complexity of Fuzzy Probability Logics

The satisfiability problem for the logic FP(Ł) (fuzzy probability logic over Łukasiewicz logic) is shown to be NP-complete; satisfiability in FP(ŁΠ) (the same over the logic joining Łukasiewicz and product logic) is shown to be in PSPACE.

متن کامل

Łukasiewicz μ-calculus

The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...

متن کامل

Compactness of fuzzy logics

This contribution is concerned with the compactness of fuzzy logics, where we concentrate on the three standard fuzzy logics—Łukasiewicz logic, Gödel logic, and product logic.

متن کامل

Łukasiewicz μ - calculus Matteo Mio

The paper explores properties of Łukasiewicz μ-calculus, a version of the quantitative/probabilistic modal μ-calculus containing both weak and strong conjunctions and disjunctions from Łukasiewicz (fuzzy) logic. We show that this logic encodes the well-known probabilistic temporal logic PCTL. And we give a model-checking algorithm for computing the rational denotational value of a formula at an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1404.0570  شماره 

صفحات  -

تاریخ انتشار 2014