© 2018 Elsevier B.V. In this paper, we prove Kierstead's conjecture for linear orders whose order types are ∑q∈QF(q), where F is an extended 0′-limitwise monotonic function, i.e. F can take value ζ. Linear orders in our consideration can have finite and infinite blocks simultaneously, and in this sense our result subsumes a recent result of C. Harris, K. Lee and S.B. Cooper, where only those linear orders with finite blocks are considered. Our result also covers one case of R. Downey and M. Moses' work, i.e. ζ⋅η. It covers some instances not being considered in both previous works mentioned above, such as m⋅η+ζ⋅η+n⋅η, for example, where m,n>0
AbstractWe carry out a systematic investigation of the definability of linear order on classes of fi...
In this paper, we study effective monotonic approximations of sets and sequences of sets. We show th...
We show that over the class of linear orders with additional binary relations satisfying some monoto...
In this paper, we prove Kierstead's conjecture for linear orders whose order types are ∑q∈QF(q), whe...
© 2017, Pleiades Publishing, Ltd.We find new sufficient conditions for the existence of a 0’-limitwi...
We develop an approach to the longstanding conjecture of H.A. Kierstead concerning the character of ...
In this paper, we describe the technique of extremely monotonic functions in the theory of computabl...
© 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. We extend the limitwise monotonicity notion to th...
© 2019 American Mathematical Society. We settle the long-standing Kierstead conjecture in the negati...
© 2014, Pleiades Publishing, Ltd. In this paper we generalize the theorem that previously obtained b...
Let P be a finite poset and let x,y c P. Let C be a chain. Define N(i,j) to be the number of strict ...
This document is made available in accordance with publisher policies. Please cite only the publishe...
Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
AbstractWe say that a linear ordering L is extendible if every partial ordering that does not embed ...
AbstractWe carry out a systematic investigation of the definability of linear order on classes of fi...
In this paper, we study effective monotonic approximations of sets and sequences of sets. We show th...
We show that over the class of linear orders with additional binary relations satisfying some monoto...
In this paper, we prove Kierstead's conjecture for linear orders whose order types are ∑q∈QF(q), whe...
© 2017, Pleiades Publishing, Ltd.We find new sufficient conditions for the existence of a 0’-limitwi...
We develop an approach to the longstanding conjecture of H.A. Kierstead concerning the character of ...
In this paper, we describe the technique of extremely monotonic functions in the theory of computabl...
© 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim. We extend the limitwise monotonicity notion to th...
© 2019 American Mathematical Society. We settle the long-standing Kierstead conjecture in the negati...
© 2014, Pleiades Publishing, Ltd. In this paper we generalize the theorem that previously obtained b...
Let P be a finite poset and let x,y c P. Let C be a chain. Define N(i,j) to be the number of strict ...
This document is made available in accordance with publisher policies. Please cite only the publishe...
Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order...
We characterize the linear order types τ with the property that given any countable linear order ℒ, ...
AbstractWe say that a linear ordering L is extendible if every partial ordering that does not embed ...
AbstractWe carry out a systematic investigation of the definability of linear order on classes of fi...
In this paper, we study effective monotonic approximations of sets and sequences of sets. We show th...
We show that over the class of linear orders with additional binary relations satisfying some monoto...