Results 1 to 10 of about 28,313 (214)
The complexity of random ordered structures
"Vegeu el resum a l'inici del document del fitxer adjunt."
Joel H. Spencer, Katherine St. John
core +5 more sources
Reduction of Order Structures [PDF]
Relational order structures are used to describe and investigate properties of concurrent systems. To reduce the complexity of order structures, one typically considers only their essential components, which, in the case of partial orders, leads to the notion of Hasse diagrams.
Lukasz Mikulski +2 more
openaire +1 more source
Coding and Ordering Kekulé Structures [PDF]
The concept of numerical Kekulé structures is used for coding and ordering geometrical (standard) Kekulé structures of several classes of polycyclic conjugated molecules: catacondensed, pericondensed, and fully arenoid benzenoid hydrocarbons, thioarenoids, and [N]phenylenes. It is pointed out that the numerical Kekulé structures can be obtained for any
Ante Milicevic +2 more
openaire +4 more sources
Model-Checking on Ordered Structures [PDF]
We study the model-checking problem for first- and monadic second-order logic on finite relational structures. The problem of verifying whether a formula of these logics is true on a given structure is considered intractable in general, but it does become tractable on interesting classes of structures, such as on classes whose Gaifman graphs have ...
Kord Eickmeyer +8 more
openaire +5 more sources
Ordered Structures and Projections [PDF]
We associate a covering relation to the usual order relation defined in the set of all idempotent endomorphisms (projections) of a finite‐dimensional vector space. A characterization is given of it. This characterization makes this order an order verifying the Jordan‐Dedekind chain condition.
openaire +3 more sources
The structure of the Mitchell order – II [PDF]
We isolate here a wide class of well founded orders called tame orders and show that each such order of cardinality at most $κ$ can be realized as the Mitchell order on a measurable cardinal $κ$, from a consistency assumption weaker than $o(κ) = κ^+$.
openaire +4 more sources
On the Structure of Order Domains
The idea of an order function originated with the second author [\textit{R. Pellikaan}, J. Stat. Plann. Inference 94, No.~2, 287-301 (2001; Zbl 0981.94055)] as a way to consider one-point Goppa codes using ring theory, without using algebraic geometry. An order function generalizes the order of pole of a rational function along a prime divisor.
Geil, Olav; id_orcid 0000-0002-9666-3399 +1 more
openaire +4 more sources
Structural order in glassy water [PDF]
submitted
Giovambattista, Nicolas +3 more
openaire +3 more sources
The structure of first-order causality [PDF]
Game semantics describe the interactive behaviour of proofs by interpreting formulas as games on which proofs induce strategies. Such a semantics is introduced here for capturing dependencies induced by quantifications in first-order propositional logic.
openaire +4 more sources
ABSTRACT Background Wilms tumor (WT) treatment imposes a significant time burden on patients and their families. Time toxicity is a patient‐centered metric that quantifies the burden of healthcare interaction. We sought to define time toxicity in the first year after diagnosis of WT and hypothesized that it would increase as tumor stage and treatment ...
Caleb Q. Ashbrook +6 more
wiley +1 more source

