Results 11 to 20 of about 983,168 (284)
Pseudo o-Minimality for Double Stone Algebras [PDF]
Pseudo o-minimality is a generalization of o-minimality of linear orders to partial orders. Recently Lei Chen, Niandong Shi and Guohua Wu provided pseudo o-minimality for the class of Stone algebras. In this note we use quantifier elimination property to
Farhad Jahanian, Jafar Sadegh Eivazloo
doaj +1 more source
Partially Ordered Models [PDF]
54 pages, 11 figures, 6 simulations.
Fernandez, R., Deveaux, V.
openaire +4 more sources
A new partial order based on core partial order and star partial order
Summary: In this paper, we introduce a new partial order called CS partial order, which is based on the core partial order and star partial order. We give some characteristics of CS partial order by using polar decomposition. Then we apply the polar-like decomposition to introduce another new partial order called WC (weak CS) partial order, which is an
Zhang, Yang, Jiang, Zongyang
openaire +1 more source
Orders between Channels and Implications for Partial Information Decomposition
The partial information decomposition (PID) framework is concerned with decomposing the information that a set of random variables has with respect to a target variable into three types of components: redundant, synergistic, and unique.
André F. C. Gomes +1 more
doaj +1 more source
Ordering Strict Partial Orders to Model Behavioral Refinement [PDF]
Software is now ubiquitous and involved in complex interactions with the human users and the physical world in so-called cyber-physical systems where the management of time is a major issue.
Mathieu Montin, Marc Pantel
doaj +1 more source
On Information Orders on Metric Spaces
Information orders play a central role in the mathematical foundations of Computer Science. Concretely, they are a suitable tool to describe processes in which the information increases successively in each step of the computation.
Oliver Olela Otafudu, Oscar Valero
doaj +1 more source
We continue the presentation of new results in the calculus for interval-valued functions of a single real variable. We start here with the results presented in part I of this paper, namely, a general setting of partial orders in the space of compact ...
Luciano Stefanini +2 more
doaj +1 more source
Partial Order Rank Features in Colour Space
Partial orders are the natural mathematical structure for comparing multivariate data that, like colours, lack a natural order. We introduce a novel, general approach to defining rank features in colour spaces based on partial orders, and show that it is
Fabrizio Smeraldi +3 more
doaj +1 more source
Comparison of partial orders clustering techniques
In this paper, we compare three approaches of clustering partial ordered subsets of a set of items. First approach was k-medoids clustering algorithm with distance function based on Levenshtein distance.
A. Raskin
doaj +1 more source
Category forcings, $MM^{+++}$, and generic absoluteness for the theory of strong forcing axioms [PDF]
We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient.
Viale, Matteo
core +2 more sources

