Results 231 to 240 of about 983,168 (284)
Characterization of the Crustacean Methyl Farnesoate Transcriptional Signaling Genes. [PDF]
Int J Mol SciBentley VL +3 more
europepmc +1 more source
N<sub>2</sub>O Formation Mechanism and Suppression Strategy on Pt Catalysts for NO <sub><i>x</i></sub> Removal from Hydrogen-Internal Combustion Engines. [PDF]
JACS AuXie S +5 more
europepmc +1 more source
Research on online EDI order scheduling optimization strategy in manufacturing enterprises based on time-varying Markov chains. [PDF]
Sci RepWulan Q.
europepmc +1 more source
Innovative Aboodh-based gractional analytical methods for nonlinear Burgers' partial differential equations. [PDF]
Sci RepIqbal N +6 more
europepmc +1 more source
Tapeworms of freshwater fishes in North America: an integrative review of taxonomy, phylogeny, host specificity, and research priorities. [PDF]
Front Vet SciScholz T, Kuchta R.
europepmc +1 more source
A review of SPAD array chip design for direct time-of-flight LiDAR. [PDF]
Discov NanoMo L, Huang S, Yang Y, Ren TL.
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.
Sandu, Gabriel, Väänänen, Jouko
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.
Sandu, Gabriel, Väänänen, Jouko
openaire +1 more source
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.
Lu Shangqi +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.
Lu Shangqi +3 more
openaire +1 more source