In this thesis we consider, from a computability perspective, the question of what order-theoretic properties of a partial order can be preserved under linear extension. It is well-known that such properties as well-foundedness or scatteredness can be preserved, that is, given any well-founded partial order you can find a well-founded linear extension and mutatis mutandis for scattered partial orders. An order type σ is extendible if a partial order that does not embed σ can always be extended to a linear order that does not extend σ. So for example “given any well-founded partial order, you can find a well-founded linear extension” is equivalent to saying that ω^∗ is extendible. The extendible order types were classified by Bonnet [3] i...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
The general ideas introduced in [8] are adopted in order to investigate the quasi cones and the cone...
AbstractWe consider the problem of characterizing the set ε(P) of all extensions of an order P on a ...
AbstractWe say that a linear ordering L is extendible if every partial ordering that does not embed ...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, \emph{...
AbstractLetPbe a two-dimensional order, and __Pany complement ofP, i.e., any partial order whose com...
Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, \emph{...
Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, \emph{...
AbstractGiven a partial order P defined on a finite set X, a binary relation ≻P may be defined on X ...
(eng) Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, ...
A linear ordering is scattered if it does not contain a copy of the rationals. Hausdorff characteris...
We answer the question, when a partial order in a partially ordered algebraic structure has a compat...
AbstractIn this paper, at first we describe a digraph representing all the weak-order extensions of ...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
The general ideas introduced in [8] are adopted in order to investigate the quasi cones and the cone...
AbstractWe consider the problem of characterizing the set ε(P) of all extensions of an order P on a ...
AbstractWe say that a linear ordering L is extendible if every partial ordering that does not embed ...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
In this thesis, we study computable content of existing classical theorems on linearisations of part...
Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, \emph{...
AbstractLetPbe a two-dimensional order, and __Pany complement ofP, i.e., any partial order whose com...
Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, \emph{...
Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, \emph{...
AbstractGiven a partial order P defined on a finite set X, a binary relation ≻P may be defined on X ...
(eng) Linear extension of partial orders emerged in the late 1920's. Its computer-oriented version, ...
A linear ordering is scattered if it does not contain a copy of the rationals. Hausdorff characteris...
We answer the question, when a partial order in a partially ordered algebraic structure has a compat...
AbstractIn this paper, at first we describe a digraph representing all the weak-order extensions of ...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
The general ideas introduced in [8] are adopted in order to investigate the quasi cones and the cone...
AbstractWe consider the problem of characterizing the set ε(P) of all extensions of an order P on a ...