Homeomorphism between semi- spaces
K. K. Dube, R. K. Sengar (1980)
Matematički Vesnik
Similarity:
K. K. Dube, R. K. Sengar (1980)
Matematički Vesnik
Similarity:
S. P. Arya, M. P. Bhamini (1982)
Matematički Vesnik
Similarity:
M. Jelić (1982)
Matematički Vesnik
Similarity:
Ya-Ming Wang, Hang Zhan, Yuan-Yuan Zhao (2024)
Kybernetika
Similarity:
This work explores commutative semi-uninorms on finite chains by means of strictly increasing unary functions and the usual addition. In this paper, there are three families of additively generated commutative semi-uninorms. We not only study the structures and properties of semi-uninorms in each family but also show the relationship among these three families. In addition, this work provides the characterizations of uninorms in and that are generated by additive generators. ...
Enrique Castañeda-Alvarado, Ivon Vidal-Escobar (2017)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In this paper we construct a Kelley continuum such that is not semi-Kelley, this answers a question posed by J.J. Charatonik and W.J. Charatonik in A weaker form of the property of Kelley, Topology Proc. 23 (1998), 69–99. In addition, we show that the hyperspace is not semi- Kelley. Further we show that small Whitney levels in are not semi-Kelley, answering a question posed by A. Illanes in Problemas propuestos para el taller de Teoría de continuos y sus hiperespacios, Queretaro,...
Barry James Gardner (2022)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
Malt’tsev–Neumann products of semi-simple classes of associative rings are studied and some conditions which ensure that such a product is again a semi-simple class are obtained. It is shown that both products, and of semi-simple classes and are semi-simple classes if and only if they are equal.
D. Andrijević (1984)
Matematički Vesnik
Similarity:
Richard Valent (1973)
Colloquium Mathematicae
Similarity:
Deepa Sinha, Pravin Garg (2011)
Discussiones Mathematicae Graph Theory
Similarity:
A signed graph (or sigraph in short) is an ordered pair , where is a graph G = (V,E), called the underlying graph of S and σ:E → +, - is a function from the edge set E of into the set +,-, called the signature of S. The ×-line sigraph of S denoted by is a sigraph defined on the line graph of the graph by assigning to each edge ef of , the product of signs of the adjacent edges e and f in S. In this paper, first we define semi-total line sigraph and semi-total point sigraph...
Vladimír Slezák (2001)
Discussiones Mathematicae - General Algebra and Applications
Similarity:
In this paper the context of independent sets is assigned to the complete lattice (P(M),⊆) of all subsets of a non-empty set M. Some properties of this context, especially the irreducibility and the span, are investigated.
Emile Le Page, Marc Peigne (1994)
Publications mathématiques et informatique de Rennes
Similarity:
Funda Karaçal, Ümit Ertuğrul, M. Nesibe Kesicioğlu (2019)
Kybernetika
Similarity:
In this paper, a construction method on a bounded lattice obtained from a given t-norm on a subinterval of the bounded lattice is presented. The supremum distributivity of the constructed t-norm by the mentioned method is investigated under some special conditions. It is shown by an example that the extended t-norm on from the t-norm on a subinterval of need not be a supremum-distributive t-norm. Moreover, some relationships between the mentioned construction method and the other...
Kamila Kliś-Garlicka (2016)
Czechoslovak Mathematical Journal
Similarity:
The notion of a bilattice was introduced by Shulman. A bilattice is a subspace analogue for a lattice. In this work the definition of hyperreflexivity for bilattices is given and studied. We give some general results concerning this notion. To a given lattice we can construct the bilattice . Similarly, having a bilattice we may consider the lattice . In this paper we study the relationship between hyperreflexivity of subspace lattices and of their associated bilattices. Some examples...