Results 41 to 50 of about 1,290 (174)

A Semi-lattice of Four-valued Literal-paraconsistent-paracomplete Logics

open access: yesBulletin of the Section of Logic, 2021
In this paper, we consider the class of four-valued literal-paraconsistent-paracomplete logics constructed by combination of isomorphs of classical logic CPC. These logics form a 10-element upper semi-lattice with respect to the functional embeddinig one
Natalya Tomova
doaj   +1 more source

On distances and metrics in discrete ordered sets [PDF]

open access: yesMathematica Bohemica, 2021
Discrete partially ordered sets can be turned into distance spaces in several ways. The distance functions may or may not satisfy the triangle inequality and restrictions of the distance to finite chains may or may not coincide with the natural ...
Stephan Foldes, Sándor Radeleczki
doaj   +1 more source

Trees as semilattices

open access: yesDiscrete Mathematics, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Leonid Libkin, Vladimir Gurvich
openaire   +1 more source

Permutability of Semilattice Congruences on Lattices [PDF]

open access: yes, 1967
Many authors have studied lattice congruences on lattices, but it seems that there are few studies concerning semilattice congruences on lattices. However, it seems that the semilattice congruences on lattices are closely connected with their structure ...
Tsuyoshi Fujiwara
core   +1 more source

Multi-argument specialization semilattices [PDF]

open access: yesMathematica Bohemica
If $X$ is a closure space with closure $K$, we consider the semilattice $(\mathcal P(X), \cup)$ endowed with a further relation $ x \sqsubseteq\{ y_1, y_2, \dots, y_n\} $ between elements of $\mathcal P(X)$ and finite subsets of $\mathcal P(X)$, whose ...
Paolo Lipparini
doaj   +1 more source

The endomorphism semiring of a semilattice [PDF]

open access: yes, 2009
We prove that the endomorphism semiring of a nontrivial semilattice is always subdirectly irreducible and describe its monolith. The endomorphism semiring is congruence simple if and only if the semilattice has both a least and a largest ...
Maróti, Miklós, Jezek, J., Kepka, T.
core   +1 more source

The Existence and Stability of Solutions for Vector Quasiequilibrium Problems in Topological Order Spaces

open access: yesJournal of Applied Mathematics, 2013
In a topological sup-semilattice, we established a new existence result for vector quasiequilibrium problems. By the analysis of essential stabilities of maximal elements in a topological sup-semilattice, we prove that for solutions of each vector quasi ...
Qi-Qing Song
doaj   +1 more source

Embedding a demonic semilattice in a relation algebra [PDF]

open access: yes, 1995
We present a refinement ordering between binary relations, viewed as programs or specifications. This ordering induces a complete join semilattice that can be embedded in a relation algebra.
Jaoua, Ali   +6 more
core   +1 more source

Revisiting Semilattice Semantics [PDF]

open access: yes, 2021
The operational semantics of Urquhart is a deep and important part of the development of relevant logics. In this paper, I present an overview of work on Urquhart’s operational semantics. I then present the basics of collection frames.
Standefer, Shawn
core  

Compatibilities between continuous semilattices

open access: yesKarpatsʹkì Matematičnì Publìkacìï, 2021
We define compatibilities between continuous semilattices as Scott continuous functions from their pairwise cartesian products to $\{0,1\}$ that are zero preserving in each variable.
O.Ya. Mykytsey, K.M. Koporkh
doaj   +1 more source

Home - About - Disclaimer - Privacy