Results 151 to 160 of about 619 (166)
Some of the next articles are maybe not open access.
Chinese Annals of Mathematics, Series B, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Wenfeng, Xu, Xiaoquan
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zhang, Wenfeng, Xu, Xiaoquan
openaire +1 more source
Wilcox posets and parallelism in posets
Asian-European Journal of Mathematics, 2015In this paper, we have shown that any complemented modular poset of finite length can be reduced to a weakly modular [Formula: see text]-symmetric poset called Wilcox poset. The concept of parallelism has been generalized to posets. The properties of singular elements, modularity and parallelism are studied in a Wilcox poset.
Shewale, R. S., Kharat, Vilas
openaire +1 more source
Order, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Order, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Mathematical Logic Quarterly, 1992
AbstractIn this paper we give new criterions for left distributive posets to have neatest representations. We also illustrate a construction that would embed left distributive posets into representable semilattices.
Cheng, Yungchen, Kemp, Paula
openaire +2 more sources
AbstractIn this paper we give new criterions for left distributive posets to have neatest representations. We also illustrate a construction that would embed left distributive posets into representable semilattices.
Cheng, Yungchen, Kemp, Paula
openaire +2 more sources
Order, 2003
A basic result in the theory of continuous lattices is that in a distributive continuous lattice, the way-below relation is multiplicative if and only if every weak prime element is prime if and only if the set of weak primes is closed in the Lawson topology. The authors generalize these results to the case of \(Z\)-semicontinuous posets, which include
Powers, R. C., Riedel, T.
openaire +1 more source
A basic result in the theory of continuous lattices is that in a distributive continuous lattice, the way-below relation is multiplicative if and only if every weak prime element is prime if and only if the set of weak primes is closed in the Lawson topology. The authors generalize these results to the case of \(Z\)-semicontinuous posets, which include
Powers, R. C., Riedel, T.
openaire +1 more source
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 1999
This paper discusses three types of fuzzy quantum posets, states and observables on these posets, representations of fuzzy quantum posets, representation of observables, and joint observables.
openaire +2 more sources
This paper discusses three types of fuzzy quantum posets, states and observables on these posets, representations of fuzzy quantum posets, representation of observables, and joint observables.
openaire +2 more sources
Order, 2005
The authors introduce the notion of homomorphism and of a congruence relation for arbitrary partially ordered set (poset). Let \(P\) be a poset and \(Q\) a subposet of \(P\). Then \(Q\) is said to be an \(l\)-subposet of \(P\) if the identity map \(Q\to P\) is a homomorphism.
Haviar, Alfonz, Lihová, Judita
openaire +2 more sources
The authors introduce the notion of homomorphism and of a congruence relation for arbitrary partially ordered set (poset). Let \(P\) be a poset and \(Q\) a subposet of \(P\). Then \(Q\) is said to be an \(l\)-subposet of \(P\) if the identity map \(Q\to P\) is a homomorphism.
Haviar, Alfonz, Lihová, Judita
openaire +2 more sources
Order, 2001
A graded poset \(P\) is called Eulerian if the number of elements of even rank equals the number of elements of odd rank in every interval of \(P\). A poset \(P\) is called \(k\)-Eulerian if every interval of \(P\) of rank \(k\) is Eulerian. If \(P\) is a \(2k\)-Eulerian poset then \(P\) is also \((2k+1)\)-Eulerian.
openaire +1 more source
A graded poset \(P\) is called Eulerian if the number of elements of even rank equals the number of elements of odd rank in every interval of \(P\). A poset \(P\) is called \(k\)-Eulerian if every interval of \(P\) of rank \(k\) is Eulerian. If \(P\) is a \(2k\)-Eulerian poset then \(P\) is also \((2k+1)\)-Eulerian.
openaire +1 more source
Fundamenta Informaticae, 2019
Rozenberg and Ehrenfeucht has shown a duality between 2-structures (a.k.a. transition systems) and (elementary) Petri nets. The tool has been the notion of a region of a 2-structure, the regions then define a Petri net. Bernardinello et al. has observed that the regions of a 2-structure form an orthomodular poset and there is a similar relation ...
openaire +2 more sources
Rozenberg and Ehrenfeucht has shown a duality between 2-structures (a.k.a. transition systems) and (elementary) Petri nets. The tool has been the notion of a region of a 2-structure, the regions then define a Petri net. Bernardinello et al. has observed that the regions of a 2-structure form an orthomodular poset and there is a similar relation ...
openaire +2 more sources