On Decidability of T-norm-Based Equational Theories

نویسنده

  • Enrico Marchioni
چکیده

The aim of this work is to show that the universal theory R of real closed fields [1] is interpretable in the equational theory of LPi1/2-algebras [2,3,6,7,8], and viceversa. Since R enjoys quantifier elimination, we will obtain that the full theory of R is interpretable in LPi1/2. This will also yield that any function definable in R is definable in LPi1/2. As a consequence of this construction we provide a description of (leftcontinuous) t-norms [5] definable in LPi1/2. In particular we can find a complete characterization of definable continuous t-norms. Theorem A continuous t-norm is definable iff it can be represented as a finite ordinal sum. This is due to the fact that since the set of idempotent elements of a tnorm is definable, by the properties of real closed fields it must be a Boolean combination of semialgebraic sets [1]. Negative results are also given for the definability of left continuous tnorms, i.e.: a definable left continuous t-norm cannot have a dense set or an infinite discrete set of discontinuities. However, many well-known leftcontinuous t-norms obtained by some construction methods [4] are definable in LPi1/2. Hence, we directly have the following theorem. Theorem The class of definable (left-continuous) t-norms is closed under (finite) ordinal sum, rotation, annihilation and rotation-annihilation. Now, let ∗ be a definable left-continuous t-norm, and →∗ its residuum. Then [0, 1]A∗ = ([0, 1], ∗,→∗,∧,∨) is a commutative, bounded, integral, residuated lattice. Suppose that the class of A∗-algebras is generated by [0, 1]A∗ . Lemma Let ∗ be a definable left-continuous t-norm. Then in [0, 1]LPi1/2 there is a definable structure isomorphic to [0, 1]A∗ . The left-continuous t-norm ∗ is definable in LPi1/2, and so is its residuum, hence they have as corresponding LPi1/2-functions ∗′ and →∗′ . Then, we can define a translation ◦ from [0, 1]A∗-terms into LPi1/2-terms so that • (x ∗ y)◦ is x ∗′ y • (x →∗ y)◦ is x →∗′ y.

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

ثبت نام

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

منابع مشابه

Combining Equational Tree Automata over AC and ACI Theories

In this paper, we study combining equational tree automata in two different senses: (1) whether decidability results about equational tree automata over disjoint theories E1 and E2 imply similar decidability results in the combined theory E1 ∪ E2; (2) checking emptiness of a language obtained from the Boolean combination of regular equational tree languages. We present a negative result for the...

متن کامل

Combining Algorithms for Deciding Knowledge in Security Protocols

In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic functions (encryption, exclusive or, . . . ). The analysis of cryptographic protocols requires a precise understanding of the attacker knowledge. Two standard notions are usually used: deducibility and indistinguishability. Those no...

متن کامل

Decidability and Complexity of Finitely Closable Linear Equational Theories

We deene a subclass of the class of linear equational theories, called nitely closable linear theories. We consider uniication problems with no repeated variables. We show the decidability of this subclass, and give an algorithm in PSPACE. If all function symbols are monadic, then the running time is in NP, and quadratic for unitary monadic nitely closable linear theories.

متن کامل

On Equational Theories, Unification and Decidability

The following classes of equational theories, which are important in unification theory, are presented: permutative, finite, Noetherian, simple, almost collapse free, collapse free, regular, and ~-free theories. The relationships between the particular theories are shown and the connection between these classes and the unification hierarchy is pointed out. We give an equational theory that alwa...

متن کامل

A New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics

Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics—which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equa...

متن کامل

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


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

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

ثبت نام

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

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

دوره   شماره 

صفحات  -

تاریخ انتشار 2006