Results 221 to 230 of about 99,568 (264)
Some of the next articles are maybe not open access.
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
2000
Partial order reductions are a family of techniques for diminishing the statespace explosion problem for model-checking concurrent programs. They are based on the Observation that execution sequences of a concurrent program can be grouped together into equivalence classes that are indistinguishable by the property to be checked.
openaire +1 more source
Partial order reductions are a family of techniques for diminishing the statespace explosion problem for model-checking concurrent programs. They are based on the Observation that execution sequences of a concurrent program can be grouped together into equivalence classes that are indistinguishable by the property to be checked.
openaire +1 more source
1999
Many of the semirings originally studied, such as ℕ and ideal(R), have a partial-order structure in addition to their algebraic structure and, indeed, the most interesting theorems concerning them make use of the interplay between these two structures.
openaire +1 more source
Many of the semirings originally studied, such as ℕ and ideal(R), have a partial-order structure in addition to their algebraic structure and, indeed, the most interesting theorems concerning them make use of the interplay between these two structures.
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.
Klein, D.J, Babić, Darko
openaire +3 more sources
Uncountable Homogeneous Partial Orders
MLQ, 2002A partially ordered set is called \(k\)-homogeneous if any isomorphism between \(k\)-element subsets extends to an automorphism. In this paper the \(k\)-homogeneous but not \((k+1)\)-homogeneous partially ordered sets are studied.
Droste, Manfred +2 more
openaire +2 more sources
Partially Ordered Abelian Groupoids
Siberian Mathematical JournalzbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. A. Pervukhin +2 more
openaire +2 more sources
1997
Abstract We explore several connections between graphs and partially ordered sets. We define various graphs and digraphs associated with a partially ordered set, and explore how the properties of the partial order are reflected in these graphs.
openaire +1 more source
Abstract We explore several connections between graphs and partially ordered sets. We define various graphs and digraphs associated with a partially ordered set, and explore how the properties of the partial order are reflected in these graphs.
openaire +1 more source
Correlation Among Partial Orders
SIAM Journal on Algebraic Discrete Methods, 1983If A is a poset and P is a (finite) poset whose underlying set contains the elements of A, then A is said to occur in a linear extension L of P if each relation in A is realized in L; if L is chose...
openaire +2 more sources