Results 281 to 290 of about 1,115,339 (315)
Some of the next articles are maybe not open access.
Completions of Partially Ordered Sets
SIAM Journal on Computing, 1982We show, for any subset system Z (as defined in Wright, Wagner, and Thatcher, T.C.S. 7 (1978), pp. 57–77) and any order preserving map $f:Q \to P$ of posets, the existence of a universal map $u_f :P \to P_f $ where $P_f $ is Z-complete and $u_f f$ is Z-continuous. This generalizes to arbitrary subset systems the result of Markowsky (T.C.S. 4 (1977), pp.
Bernhard Banaschewski, Evelyn Nelson
openaire +1 more source
Journal of Mathematical Sciences, 2018
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
On congruences and partial orders
1995Mazurkiewicz trace theory is not powerful enough to describe concurrency paradigms as, for instance, the “Producer / Consumer”. We propose in this paper a generalization of Mazurkiewicz trace monoids which allows to model such problems. We consider quotients of the free monoids by congruences which preserve the commutative images of words.
Serge Bauget, Paul Gastin
openaire +1 more source
Partially ordered groups and partially ordered linear spaces.
1951zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kantorovich, L. V. +2 more
openaire +2 more sources
Logic Journal of IGPL, 1997
There are in the literature a number of different ``possible worlds'' semantics for nonmonotonic reasoning, but they all rest on one or other of two basic intuitions. One intuition is to evaluate an inference by asking whether its conclusion is true in ``the most normal'' among the worlds satisfying the premises.
openaire +2 more sources
There are in the literature a number of different ``possible worlds'' semantics for nonmonotonic reasoning, but they all rest on one or other of two basic intuitions. One intuition is to evaluate an inference by asking whether its conclusion is true in ``the most normal'' among the worlds satisfying the premises.
openaire +2 more sources
Endomorphisms of Partially Ordered Sets
Combinatorics, Probability and Computing, 1998It is shown that every partially ordered set with n elements admits an endomorphism with an image of a size at least n1/7 but smaller than n. We also prove that there exists a partially ordered set with n elements such that each of its non-trivial endomorphisms has an image of size O((n log n)1/3).
Dwight Duffus +3 more
openaire +3 more sources
Partial higher-order specifications
1991Summary: The classes of extensional models of higher-order partial conditional specifications are studied, with the emphasis on the closure properties of these classes. Further it is shown that any equationally complete inference system for partial conditional specifications may be extended to an inference system for partial higher-order conditional ...
ASTESIANO, EGIDIO, CERIOLI, MAURA
openaire +4 more sources
1978
The approach of characterising certain properties of concurrent structures by traces, i.e. partial orders of event occurrences has already been used by several authors in particular by S. Patil, A.W. Holt, P.E. Lauer. The approach also has a close connection to causal-nets introduced by C.A. Petri.
openaire +1 more source
The approach of characterising certain properties of concurrent structures by traces, i.e. partial orders of event occurrences has already been used by several authors in particular by S. Patil, A.W. Holt, P.E. Lauer. The approach also has a close connection to causal-nets introduced by C.A. Petri.
openaire +1 more source
Partially ordered interpretations
Journal of Symbolic Logic, 1977In this paper, we shall define the “partially ordered interpretation” of a first order theory in another first order theory and state some recent results. Although an exact definition will be given in §4 below, we now give a brief outline. First of all, let us recall the “interpretations” defined by A. Tarski et al.
openaire +2 more sources
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