scholarly journals When does a semiring become a residuated lattice?

2016 ◽  
Vol 09 (04) ◽  
pp. 1650088
Author(s):  
Ivan Chajda ◽  
Helmut Länger
Keyword(s):  
Residuated Lattice ◽  
Residuated Lattices ◽  
The Other ◽  
Natural Question ◽  
Double Negation ◽  
Complete Distributivity ◽  
Completely Distributive ◽  
Double Negation Law ◽  
The Given ◽  
Converse Assertion

It is an easy observation that every residuated lattice is in fact a semiring because multiplication distributes over join and the other axioms of a semiring are satisfied trivially. This semiring is commutative, idempotent and simple. The natural question arises if the converse assertion is also true. We show that the conversion is possible provided the given semiring is, moreover, completely distributive. We characterize semirings associated to complete residuated lattices satisfying the double negation law where the assumption of complete distributivity can be omitted. A similar result is obtained for idempotent residuated lattices.

scholarly journals Residuation in non-associative MV-algebras

2018 ◽  
Vol 68 (6) ◽  
pp. 1313-1320
Author(s):  
Ivan Chajda ◽  
Helmut Länger
Keyword(s):  
Binary Operation ◽  
Residuated Lattice ◽  
Natural Question ◽  
Natural Conditions ◽  
Double Negation ◽  
Mv Algebra ◽  
Residuated Poset ◽  
Double Negation Law ◽  
Mv Algebras

Abstract It is well known that every MV-algebra can be converted into a residuated lattice satisfying divisibility and the double negation law. In a previous paper the first author and J. Kühr introduced the concept of an NMV-algebra which is a non-associative modification of an MV-algebra. The natural question arises if an NMV-algebra can be converted into a residuated structure, too. Contrary to MV-algebras, NMV-algebras are not based on lattices but only on directed posets and the binary operation need not be associative and hence we cannot expect to obtain a residuated lattice but only an essentially weaker structure called a conditionally residuated poset. Considering several additional natural conditions we show that every NMV-algebra can be converted in such a structure. Also conversely, every such structure can be organized into an NMV-algebra. Further, we study an a bit more stronger version of an algebra where the binary operation is even monotone. We show that such an algebra can be organized into a residuated poset and, conversely, every residuated poset can be converted in this structure.

State hyperstructures of tree automata based on lattice-valued logic

2018 ◽  
Vol 52 (1) ◽  
pp. 23-42 ◽  
Author(s):  
Maryam Ghorani
Keyword(s):  
Residuated Lattice ◽  
Residuated Lattices ◽  
The Other ◽  
Equivalence Relations ◽  
Tree Automaton ◽  
Tree Automata ◽  
Other Hand ◽  
Complete Residuated Lattice ◽  
The Creation ◽  
The Given

In this paper, an association is organized between the theory of tree automata on one hand and the hyperstructures on the other hand, over complete residuated lattices. To this end, the concept of order of the states of a complete residuated lattice-valued tree automaton (simply L-valued tree automaton) is introduced along with several equivalence relations in the set of the states of an L-valued tree automaton. We obtain two main results from this study: one of the relations can lead to the creation of Kleene’s theorem for L-valued tree automata, and the other one leads to the creation of a minimal v-valued tree automaton that accepts the same language as the given one.

scholarly journals Adjoint Operations in Twist-Products of Lattices

Symmetry ◽  
2021 ◽  
Vol 13 (2) ◽  
pp. 253
Author(s):  
Ivan Chajda ◽  
Helmut Länger
Keyword(s):  
Residuated Lattice ◽  
Sufficient Conditions ◽  
Residuated Lattices ◽  
Double Negation ◽  
Antitone Involution ◽  
Binary Operations ◽  
Double Negation Law ◽  
Commutative Residuated Lattice

Given an integral commutative residuated lattices L=(L,∨,∧), its full twist-product (L2,⊔,⊓) can be endowed with two binary operations ⊙ and ⇒ introduced formerly by M. Busaniche and R. Cignoli as well as by C. Tsinakis and A. M. Wille such that it becomes a commutative residuated lattice. For every a∈L we define a certain subset Pa(L) of L2. We characterize when Pa(L) is a sublattice of the full twist-product (L2,⊔,⊓). In this case Pa(L) together with some natural antitone involution ′ becomes a pseudo-Kleene lattice. If L is distributive then (Pa(L),⊔,⊓,′) becomes a Kleene lattice. We present sufficient conditions for Pa(L) being a subalgebra of (L2,⊔,⊓,⊙,⇒) and thus for ⊙ and ⇒ being a pair of adjoint operations on Pa(L). Finally, we introduce another pair ⊙ and ⇒ of adjoint operations on the full twist-product of a bounded commutative residuated lattice such that the resulting algebra is a bounded commutative residuated lattice satisfying the double negation law, and we investigate when Pa(L) is closed under these new operations.

Separation axioms in \(L\)-fuzzifying supra-topology

2017 ◽  
Vol 8 (1) ◽  
pp. 67
Author(s):  
A. K. Mousa
Keyword(s):  
Residuated Lattice ◽  
Double Negation ◽  
Completely Distributive ◽  
Separation Axioms ◽  
Complete Residuated Lattice ◽  
Distributive Law ◽  
Double Negation Law ◽  
The Relationship

In this paper, we define and investigate the notions of \(L\)-separation axioms in \(L\)-fuzzifying supra-topology. Also, some of their characterizations and a systematic discussion on the relationship among these notions is gave in \(L\)-fuzzifying supra-topology where \(L\) is a complete residuated lattice. Sometimes we need more conditions on \(L\) such as the completely distributive law or that the "\(\wedge\)" is distributive over arbitrary joins or the double negation law as we illustrate through this paper. As applications of our work the corresponding results (see \cite{2, 13}) are generalized and new consequences are obtained.

scholarly journals Laterally complete and projective hulls of semilinear residuated lattices

10.29007/mmts ◽  
2018 ◽  
Author(s):  
José Gil-Férez ◽  
Antonio Ledda ◽  
Constantine Tsinakis
Keyword(s):  
Wide Class ◽  
Existence And Uniqueness ◽  
Residuated Lattice ◽  
Direct Limit ◽  
Residuated Lattices ◽  
Double Negation ◽  
Vector Lattices ◽  
Complete Vector ◽  
The Given ◽  
Mv Algebras

The existence of lateral completions of ℓ-groups is an old problem that was first solved, for conditionally complete vector lattices, by Nakano. The existence and uniqueness of lateral completions of representable ℓ-groups was first obtained as a consequence of the orthocompletions of Bernau, and later the proofs were simplified by Conrad, who also proved the existence and uniqueness of lateral completions of ℓ-groups with zero radical. Finally, Bernau solved the problem for ℓ-groups in general.In this work, we address the problem of the existence and uniqueness of lateral, projectable, and strongly projectable completions of residuated lattices. In particular, we push the methods of Conrad through to the case of the representable GMV-algebras.The leading idea is to construct, for any given semilinear residuated lattice, an orthocomplete extension such that the former is dense in the latter. This extension is obtained as the direct limit of a family of residuated lattices that are constructed using maximal partitions of the algebra of polars of the original residuated lattice.In order to complete the proof we still need another hypothesis, which is an abstraction of the condition of double negation in which commutativity and integrality have been dropped, and determines the wide class of Generalized MV-algebras. This, together with the density, allows us to obtain the completions of the given residuated lattice.

scholarly journals Left residuated lattices induced by lattices with a unary operation

2019 ◽  
Vol 24 (2) ◽  
pp. 723-729
Author(s):  
Ivan Chajda ◽  
Helmut Länger
Keyword(s):  
Orthomodular Lattice ◽  
Residuated Lattice ◽  
Unary Operation ◽  
Residuated Lattices ◽  
Boolean Algebras ◽  
Natural Question ◽  
Similar Technique ◽  
Orthomodular Lattices

Abstract In a previous paper, the authors defined two binary term operations in orthomodular lattices such that an orthomodular lattice can be organized by means of them into a left residuated lattice. It is a natural question if these operations serve in this way also for more general lattices than the orthomodular ones. In our present paper, we involve two conditions formulated as simple identities in two variables under which this is really the case. Hence, we obtain a variety of lattices with a unary operation which contains exactly those lattices with a unary operation which can be converted into a left residuated lattice by use of the above mentioned operations. It turns out that every lattice in this variety is in fact a bounded one and the unary operation is a complementation. Finally, we use a similar technique by using simpler terms and identities motivated by Boolean algebras.

scholarly journals Residuation in orthomodular lattices

2017 ◽  
Vol 5 (1) ◽  
pp. 1-5 ◽  
Author(s):  
Ivan Chajda ◽  
Helmut Länger
Keyword(s):  
Orthomodular Lattice ◽  
Residuated Lattice ◽  
Orthomodular Lattices ◽  
Double Negation ◽  
Converse Statement ◽  
One To One ◽  
Double Negation Law

Abstract We show that every idempotent weakly divisible residuated lattice satisfying the double negation law can be transformed into an orthomodular lattice. The converse holds if adjointness is replaced by conditional adjointness. Moreover, we show that every positive right residuated lattice satisfying the double negation law and two further simple identities can be converted into an orthomodular lattice. In this case, also the converse statement is true and the corresponence is nearly one-to-one.

The acquisition of Hungarian recursive PPs

2018 ◽  
Vol 4 (1) ◽  
pp. 105-123
Author(s):  
Ágnes Langó-Tóth
Keyword(s):  
Language Acquisition ◽  
Functional Element ◽  
The Other ◽  
Functional Head ◽  
Experiment Subject ◽  
The Given

Abstract In this study an experiment is presented on how Hungarian children interpret two word orders of recursive PPs (subject-PP-verb and PP-subject-verb order). According to the research of Roeper (2011) and Hollebrandse and Roeper (2014), children tend to give conjunctive interpretation to multiple embedded sentences at the beginning of language acquisition. This interpretation later turns into an adult-like, recursive interpretation. Our aim is to discover (i) whether Hungarian children start with conjunction as well, and whether (ii) the apparently more salient functional head lévő appearing in Hungarian recursive PPs can help them to acquire the correct, recursive interpretation early. We also want to find out whether (iii) the word orders in recursive PPs have an influence on the acquisition of children. In this paper two experiments are presented conducted with 6 and 8-year-olds and adults, in which the participants were asked to choose between two pictures. One of the pictures depicted recursive and the other one depicted conjunctive interpretation of the given sentence. In the first experiment subject-PP-verb order was tested, but in the second one sentences were tested with PP-subject-verb order. We will claim that lévő, which is (arguably) a more salient Hungarian functional element than -i, does not help children to acquire the embedded reading of recursive sentences, because both of them are overt functional heads. However, the two types of word orders affect the acquisition of recursive PPs. PP-subject-verb order is easier to compute because the order of the elements in the sentences and the order of the elements in the pictures matches.

Growth Characteristics of Activated Sludges Acclimated to para-Nitrophenol in Batch and Continuous Modes

1994 ◽  
Vol 29 (7) ◽  
pp. 327-333
Author(s):  
Y. Matsui ◽  
F. Yamaguchi ◽  
Y. Suwa ◽  
Y. Urushigawa
Keyword(s):  
Growth Characteristics ◽  
The Other ◽  
Operational Mode ◽  
Continuous Mode ◽  
Relative Resistance ◽  
Batch Mode ◽  
The Given ◽  
Operational Modes ◽  
Very High ◽  
Sensitive Group

Activated sludges were acclimated to p-nitrophenol (PNP) in two operational modes, a batch and a continuous. The operational mode of the PNP acclimation of activated sludges strongly affected the physiological characteristics of predominant microorganisms responsible for PNP degradation. Predominant PNP degraders in the sludge in batch mode (Sludge B) had lower PNP affinity and were relatively insensitive to PNP concentration. Those of the sludge in continuous mode (Sludge C), on the other hand, had very high PNP affinity and were sensitive to PNP. MPN enumeration of PNP degraders in sludge B and C using media with different PNP concentrations (0.05, 0.2,0.5 and 2.0 mM) supported the above results. Medium with 0.2 mM of PNP did not recover PNP degraders in sludge C well, while it recovered PNP degraders in sludge B as well as the medium with 0.05 mM did. When switching from one operational mode to the other, the predominant population in sludge B shifted to the sensitive group, but that of sludge C did not shift at the given loading of PNP, showing relative resistance to inhibitive concentration.

Sign in / Sign up

Export Citation Format

Share Document