Abstract: . Some functional representation theorems for monadic n -valued Lukasiewicz algebras (qLk n -algebras, for short) are given. Bearing in mind some of the results established by G. Georgescu and C. Vraciu (Algebre Boole monadice si algebre Lukasiewicz monadice, Studii Cercet. Mat. 23 (1971), 1027–1048) and P. Halmos (Algebraic Logic, Chelsea, New York, 1962), two functional representation theorems for qLk n -algebras are obtained. Be-sides, rich qLk n -algebras are introduced and characterized. In addition, a third theorem for these algebras is presented and the relationship between the three theorems is shown.
TL;DR: For a finite n-element set X, n ≥ 1, let N [X] denote the number of elements of X and p(n) denote theNumber of all partitions of X, and the following recursive formula can be found in [5].
Abstract: For a finite n-element set X, n ≥ 1, let N [X] denote the number of elements of X and let p(n) denote the number of all partitions of X. If Bn is a Boolean algebra with n atoms, let A(Bn) be the set of all atoms of Bn. It is known that there exists a bijective correspondence between the set S(Bn) of all subalgebras of Bn and the set of all partitions of A(Bn), i.e., N [S(Bn)] = p(n). The following recursive formula for p(n) can be found in [5]: if we define p(0) = 1, then
TL;DR: In this paper, the authors enlarge the language of MTL-algebras by a unary operation ''forall'' equationally described so as to abstract algebraic properties of the universal quantifier ''for any'' in its original meaning.
Abstract: In this paper, we enlarge the language of MTL-algebras by a unary operation $\forall$ equationally described so as to abstract algebraic properties of the universal quantifier "for any" in its original meaning. The resulting class of algebras will be called \emph{MTL-algebras with universal quantifiers} (UMTL-algebras for short). After discussing some basic algebraic properties of UMTL-algebras, we start a systematic study of the main subclasses of UMTL-algebras, some of which constitute well known algebras: UMV-algebras and monadic Boolean algebra. Then we give some characterizations of representable, simple, semsimple UMTL-algebras, and obtain some representations of UMTL-algebras. Finally, we establish modal monoidal t-norm based logic and prove that is completeness with respect to the variety of UMTL-algebras, and then obtain that a necessary and sufficient condition for the modal monoidal t-norm based logic to be semilinear.
TL;DR: The construction of a monadic three-valued Łukasiewicz algebra from a Boolean algebra B where two quantification operations ∃ and ∃* are defined such that ∃∀*x= ∀*∃x (where ∄*x=-∃*-x) is given.
Abstract: The notion of monadic three-valued Łukasiewicz algebras was introduced by L. Monteiro ([12], [14]) as a generalization of monadic Boolean algebras. A. Monteiro ([9], [10]) and later L. Monteiro and L. Gonzalez Coppola [17] obtained a method for the construction of a three-valued Łukasiewicz algebra from a monadic Boolea algebra. In this note we give the construction of a monadic three-valued Łukasiewicz algebra from a Boolean algebra B where we have defined two quantification operations ∃ and ∃* such that ∃∀*x=∀*∃x (where ∀*x=-∃*-x). In this case we shall say that ∃ and ∃* commutes. If B is finite and ∃ is an existential quantifier over B, we shall show how to obtain all the existential quantifiers ∃* which commute with ∃. Taking into account R. Mayet [3] we also construct a monadic three-valued Łukasiewicz algebra from a monadic Boolean algebra B and a monadic ideal I of B.
The most essential results of the present paper will be submitted to the XXXIX Annual Meeting of the Union Matematica Argentina (October 1989, Rosario, Argentina).