Results 171 to 180 of about 101,990 (219)
Alkaline Decomposition Kinetics in Ca(OH)<sub>2</sub> Medium of Mercury Jarosite. [PDF]
ToxicsOrdoñez S +8 more
europepmc +1 more source
Genomic Footprints of Multiple Host Lineages in the Mitochondrial and Nuclear Genomes of the Holoparasite <i>Prosopanche americana</i>. [PDF]
Plants (Basel)Garcia LE +3 more
europepmc +1 more source
Reaction Pathways over ZnZrO<sub>2</sub>‑Based Catalysts and Catalytic Sorbents. [PDF]
ACS CatalProaño L, Wielang J, Jones CW.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Mathematical Logic Quarterly, 1992
AbstractWe show that a coherent theory of partially ordered connectives can be developed along the same line as partially ordered quantification. We estimate the expressive power of various partially ordered connectives and use methods like Ehrenfeucht games and infinitary logic to get various undefinability results.
Gabriel Sandu, Jouko Väänänen
openaire +1 more source
AbstractWe show that a coherent theory of partially ordered connectives can be developed along the same line as partially ordered quantification. We estimate the expressive power of various partially ordered connectives and use methods like Ehrenfeucht games and infinitary logic to get various undefinability results.
Gabriel Sandu, Jouko Väänänen
openaire +1 more source
Partial Orderings in Chemistry
Journal of Chemical Information and Computer Sciences, 1997The cosmopolitan relevance of partially ordered mathematical structures in chemistry is argued. Many examples are briefly noted, including those involving chemical periodicities, reactivities, aromaticities, electronegativities, molecular branching, molecular shapes, symmetries, complexities, curve fittings, and more.
Douglas J. Klein, Darko Babic
openaire +3 more sources
Canadian Journal of Mathematics, 1968
Let n be an ordinal. A partial ordering P of the ordinals T = T(n) = {w: w < n} is called natural if x P y implies x ⩽ y.A natural partial ordering, hereafter abbreviated NPO, of T(n) is thus a coarsening of the natural total ordering of the ordinals. Every partial ordering of a finite set 5 is isomorphic to a natural partial ordering.
Dean, R. A., Keller, G.
openaire +2 more sources
Let n be an ordinal. A partial ordering P of the ordinals T = T(n) = {w: w < n} is called natural if x P y implies x ⩽ y.A natural partial ordering, hereafter abbreviated NPO, of T(n) is thus a coarsening of the natural total ordering of the ordinals. Every partial ordering of a finite set 5 is isomorphic to a natural partial ordering.
Dean, R. A., Keller, G.
openaire +2 more sources
ACM Transactions on Database Systems, 2023
Partial order multiway search(POMS) is a fundamental problem that finds applications in crowdsourcing, distributed file systems, software testing, and more. This problem involves an interaction between an algorithm 𝒜 and an oracle, conducted on a directed acyclic graph 𝒢 known to both parties.
Shangqi Lu +3 more
openaire +1 more source
Partial order multiway search(POMS) is a fundamental problem that finds applications in crowdsourcing, distributed file systems, software testing, and more. This problem involves an interaction between an algorithm 𝒜 and an oracle, conducted on a directed acyclic graph 𝒢 known to both parties.
Shangqi Lu +3 more
openaire +1 more source
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings., 2003
We investigate partial orders that are computable, in a precise sense, by finite automata. Our emphasis is on trees and linear orders. We study the relationship between automatic linear orders and trees in terms of rank functions that are versions of Cantor-Bendixson rank. We prove that automatic linear orders and automatic trees have finite rank.
Bakhadyr Khoussainov +2 more
openaire +1 more source
We investigate partial orders that are computable, in a precise sense, by finite automata. Our emphasis is on trees and linear orders. We study the relationship between automatic linear orders and trees in terms of rank functions that are versions of Cantor-Bendixson rank. We prove that automatic linear orders and automatic trees have finite rank.
Bakhadyr Khoussainov +2 more
openaire +1 more source
The Partial Ordering on the Automorphism Group of the Countable Generic Partial Order
Order, 2009The countable generic partial order \((P,\leq)\) is defined by using the well-known Fraïssé's Theorem. This paper deals with the structure \((G,\circ,\leq)\), where \((G,\circ)=\text{Aut}(P,\leq)\) and \(\leq\) is the pointwise ordering on \(G\). It is shown that \((G,\leq)\) is elementarily equivalent to \((P,\leq)\) itself and, more generally, that \(
openaire +2 more sources