Partially ordered sets representable by recursively enumerable classes

1969 ◽  
Vol 34 (1) ◽  
pp. 8-12
Author(s):  
J. B. Florence
Keyword(s):  
Partially Ordered Sets ◽  
Ordered Sets ◽  
Inclusion Relation ◽  
Natural Numbers ◽  
Partially Ordered ◽  
Recursively Enumerable

A partially ordered (p.o.) set (P, ≼) is represented by the recursively enumerable (r.e.) class C if (P, ≼) is order isomorphic to (C, ⊆), that is to the p.o. set consisting of C ordered by the inclusion relation. (P, ≼.) is representable if it is represented by some r.e. class. N will denote the set of natural numbers.

Partially ordered sets of 1-degrees, contained in recursively enumerable m-degrees

1976 ◽  
Vol 15 (3) ◽  
pp. 153-164 ◽  
Author(s):  
A. N. Degtev
Keyword(s):  
Partially Ordered Sets ◽  
Ordered Sets ◽  
Partially Ordered ◽  
Recursively Enumerable

Lattice embeddings into the recursively enumerable degrees

1986 ◽  
Vol 51 (2) ◽  
pp. 257-272 ◽  
Author(s):  
K. Ambos-Spies ◽  
M. Lerman
Keyword(s):  
Elementary Theory ◽  
Partially Ordered Sets ◽  
Ordered Sets ◽  
Classification Problems ◽  
Partially Ordered ◽  
Recursively Enumerable ◽  
Existential Theory ◽  
Finite Lattices ◽  
Binary Relation Symbol

The classification of algebraic structures which can be embedded into ℛ, the uppersemilattice of recursively enumerable degrees, is the key to answering certain questions about Th(ℛ), the elementary theory of ℛ. In particular, these classification problems are important for answering decidability questions about fragments of Th(ℛ). Thus the solutions of Fried berg [F] and Mučnik [M] to Post's problem were easily extended to show that all finite partially ordered sets are embeddable into ℛ, and hence that ∃1 ∩ Th(ℛ), the existential theory of ℛ, is decidable. (The language used is ℒ′, the pure predicate calculus together with a binary relation symbol ≤ to be interpreted as the ordering of ℛ) The problem of determining which finite lattices are embeddable into ℛ has been a long-standing open problem, and is one of the major obstacles to determining whether ∀2 ∩ Th(ℛ), the universal-existential theory of ℛ, is decidable. Shore has obtained some nice partial results in this direction. Embeddings also played a central role in showing that Th(ℛ) is not ℵ0-categorical (Lerman, Shore and Soare [LeShSo]), thus resolving a problem posed by Jockusch. Harrington and Shelah [HS] embedded all 0′-presentable partially ordered sets into ℛ in such a way that the partially ordered sets can be uniformly recovered from four parameters. They used these embeddings to show that Th(ℛ) is undecidable.The first nontrivial extension of the embeddings of Friedberg and Mučnik to lattice embeddings was obtained independently by Lachlan [La1] and Yates [Y] who showed that the four-element Boolean algebra can be embedded into ℛ. Thomason [T] and Lerman independently extended this result to include all finite distributive lattices. The nondistributive case, however, was much more difficult. Lachlan [La2] embedded the two five-element nondistributive lattices M5 and N5 (see Figures 1 and 2) into ℛ, and his proof could easily have been extended to include a larger class of lattices.

To the spectral theory of partially ordered sets

2018 ◽  
Vol 60 (3) ◽  
pp. 578-598
Author(s):  
Yu. L. Ershov ◽  
M. V. Schwidefsky
Keyword(s):  
Spectral Theory ◽  
Partially Ordered Sets ◽  
Ordered Sets ◽  
Partially Ordered

Modelling Nondeterministic Concurrent Processes with Event Structures

1991 ◽  
Vol 14 (1) ◽  
pp. 39-73
Author(s):  
Rita Loogen ◽  
Ursula Goltz
Keyword(s):  
Dynamic Behaviour ◽  
Partially Ordered Sets ◽  
Parallel Composition ◽  
Ordered Sets ◽  
Communicating Sequential Processes ◽  
Partially Ordered ◽  
Event Structures ◽  
Transition Relation ◽  
Concurrent Processes ◽  
Sequential Processes

We present a non-interleaving model for non deterministic concurrent processes that is based on labelled event structures. We define operators on labelled event structures like parallel composition, nondeterministic combination, choice, prefixing and hiding. These operators correspond to the operations of the “Theory of Communicating Sequential Processes” (TCSP). Infinite processes are defined using the metric approach. The dynamic behaviour of event structures is defined by a transition relation which describes the execution of partially ordered sets of actions, abstracting from internal events.

Estimating the area under a receiver operating characteristic curve using partially ordered sets

2020 ◽  
Vol 0 (0) ◽  
Author(s):  
Ehsan Zamanzade ◽  
Xinlei Wang
Keyword(s):  
Roc Curve ◽  
Characteristic Curve ◽  
Partially Ordered Sets ◽  
Sampling Technique ◽  
Real Data ◽  
Cost Effective ◽  
Ordered Sets ◽  
Operating Characteristics ◽  
Partially Ordered ◽  
Receiver Operating

AbstractRanked set sampling (RSS), known as a cost-effective sampling technique, requires that the ranker gives a complete ranking of the units in each set. Frey (2012) proposed a modification of RSS based on partially ordered sets, referred to as RSS-t in this paper, to allow the ranker to declare ties as much as he/she wishes. We consider the problem of estimating the area under a receiver operating characteristics (ROC) curve using RSS-t samples. The area under the ROC curve (AUC) is commonly used as a measure for the effectiveness of diagnostic markers. We develop six nonparametric estimators of the AUC with/without utilizing tie information based on different approaches. We then compare the estimators using a Monte Carlo simulation and an empirical study with real data from the National Health and Nutrition Examination Survey. The results show that utilizing tie information increases the efficiency of estimating the AUC. Suggestions about when to choose which estimator are also made available to practitioners.

scholarly journals Model Checking Existential Logic on Partially Ordered Sets

2016 ◽  
Vol 17 (2) ◽  
pp. 1-35 ◽  
Author(s):  
Simone Bova ◽  
Robert Ganian ◽  
Stefan Szeider
Keyword(s):  
Model Checking ◽  
Partially Ordered Sets ◽  
Ordered Sets ◽  
Partially Ordered

Planar zero divisor graphs of partially ordered sets

2012 ◽  
Vol 137 (1-2) ◽  
pp. 27-35 ◽  
Author(s):  
M. Afkhami ◽  
Z. Barati ◽  
K. Khashyarmanesh
Keyword(s):  
Zero Divisor ◽  
Partially Ordered Sets ◽  
Ordered Sets ◽  
Partially Ordered

scholarly journals An inequality for partially ordered sets

1990 ◽  
Vol 54 (1) ◽  
pp. 123-128 ◽  
Author(s):  
István Beck
Keyword(s):  
Partially Ordered Sets ◽  
Ordered Sets ◽  
Partially Ordered

scholarly journals Adjoint functors, projectivization, and differentiation algorithms for representations of partially ordered sets

2012 ◽  
Vol 353 (1) ◽  
pp. 224-248
Author(s):  
Mark Kleiner ◽  
Markus Reitenbach
Keyword(s):  
Partially Ordered Sets ◽  
Ordered Sets ◽  
Adjoint Functors ◽  
Partially Ordered
Sign in / Sign up

Export Citation Format

Share Document