Results 81 to 90 of about 612 (145)
Universal recursion theoretic properties of r.e. preordered structures
The paper studies the natural version of m-reducibility between recursively enumerable preordered structures, and shows that many recursively enumerable preordered structures arising from logic are universal with respect to this ...
Sorbi, Andrea, Montagna, Franco
core +1 more source
Computing a Possibility Theory Repair for Partially Preordered Inconsistent Ontologies
International audienceWe address the problem of handling inconsistency in uncertain knowledge bases that are specified in the lightweight fragments of Description Logics DL-Lite.
Belabbes, Sihem, Benferhat, Salem
core +1 more source
Sequences suffice for pointfree uniform completions
Abstract Completions of metric spaces are usually constructed using Cauchy sequences. However, this does not work for general uniform spaces, where Cauchy filters or nets must be used instead. The situation in pointfree topology is more straightforward: the correct completion of uniform locales can indeed be obtained as a quotient of a locale of Cauchy
Graham Manuell
wiley +1 more source
Quotient-reflective and bireflective subcategories of the category of preordered sets [PDF]
In previous papers, the notions of “closedness” and “strong closedness” in set-based topological categories were introduced. In this paper, we give the characterization of closed and strongly closed subobjects of an object in the category Prord of ...
Jomana Al-Safar +3 more
core +1 more source
ABSTRACT Background and Aim Injection solution is important for achieving submucosal elevation in endoscopic submucosal dissection (ESD) and various viscous solutions categorized as low‐concentration injection solution (LCS) or high‐concentration injection solution (HCS) are used.
Naohisa Yoshida +11 more
wiley +1 more source
A Logical Characterization of Efficiency Preorders [PDF]
In this paper we present logical characterizations of two preorders, within the framework of Hennessy-Milner Logics. The two preorders (loosely termed bisimulation-based efficiency preorders) are on processes represented as labelled transition systems. The characterizations are particularly interesting as they explore preorders lying between strong and
Neelesh Korade, S. Arun-Kumar
openaire +2 more sources
Let X be a dendroid and x* X. 0(X, x*) will denote the preordered set of arc-components of X \ {x*}, where the preorder is defined by if cl(). In this paper we investigate conditions under which there exists a pair (X,x*) such that 0(X, x*) is isomorphic to a given preordered set.
Neumann-Lara, Víctor +2 more
openaire +2 more sources
Continuous Multi-Utility Representations of Preorders and the Chipman Approach
Chipman contended, in stark contrast to the conventional view, that, utility is not a real number but a vector, and that it is inherently lexicographic in nature.
Gianni Bosi +2 more
doaj +1 more source
The stable category of preordered groups
In this article, we present the stable category of preordered groups associated with some Z-pretorsion theory. We first define such a category as well as the related functor, and then study their properties.
Michel, Aline
core
Some utility theorems on inductive limits of preordered topological spaces
We prove the existence of an order-preserving function on a class of preordered topological spaces that are inductive limits of preordered spaces.
J.C.Candeal J.C.CandealJ.C.Candeal J.CandealJ. C.https://api.elsevier.com/content/author/author_id/6701602216
core +1 more source

