Results 71 to 80 of about 443 (167)
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
ABSTRACT Background Residual confounding presents a persistent challenge in observational studies, particularly in high‐dimensional settings. High‐dimensional proxy adjustment methods, such as the high‐dimensional propensity score (hdPS), are widely used to address confounding bias by incorporating proxies for unmeasured confounders. Extensions of hdPS
Mohammad Ehsanul Karim, Yang Lei
wiley +1 more source
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
On iterating semiproper preorders
AbstractLet T be an ω1-Souslin tree. We show the property of forcing notions; “is {ω1}-semi-proper and preserves T” is preserved by a new kind of revised countable support iteration of arbitrary length. As an application we have a forcing axiom which is compatible with the existence of an ω1 -Souslin tree for preorders as wide as possible.
openaire +3 more sources
Abstract In this paper, we extend the theory of minimal limit key polynomials of valuations on the polynomial ring K[x]$K[x]$. Minimal key polynomials are useful to describe, for instance, the defect of an extension of valued fields. We use the theory of cuts on ordered abelian groups to show that the previous results on bounded sets of key polynomials
Enric Nart, Josnei Novacoski
wiley +1 more source
On the parameterized Tate construction
Abstract We introduce and study a genuine equivariant refinement of the Tate construction associated to an extension Ĝ$\widehat{G}$ of a finite group G$G$ by a compact Lie group K$K$, which we call the parameterized Tate construction (−)tGK$(-)^{t_G K}$.
J. D. Quigley, Jay Shah
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 +1 more source
Preorders on Monads and Coalgebraic Simulations [PDF]
We study the construction of preorders on Set-monads by the semantic ⊤⊤-lifting. We show the universal property of this construction, and characterise the class of preorders on a monad as a limit of a Cardop-chain. We apply these theoretical results to identifying preorders on some concrete monads, including the powerset monad, maybe monad, and their ...
Shin-ya Katsumata, Tetsuya Sato 0001
openaire +1 more source
Paper bags to food relief: Whither the tuckshop?
Geographical Research, Volume 63, Issue 2, Page 174-178, May 2025.
Miriam J. Williams
wiley +1 more source
Compliance and Testing Preorders Differ [PDF]
Contracts play an essential role in the Service Oriented Computing, for which they need to be equipped with a sub-contract relation. We compare two possible formulations, one based on compliance and the other on the testing theory of De Nicola and Hennessy.
Giovanni Bernardi 0001, Matthew Hennessy
openaire +1 more source

