linear orderings
Recently Published Documents


TOTAL DOCUMENTS

176
(FIVE YEARS 6)

H-INDEX

16
(FIVE YEARS 0)

2021 ◽  
Vol 56 ◽  
pp. 101-109
Author(s):  
Rodrigo A. Freire

We provide some statements equivalent in ZFC to GCH, and also to GCH above a given cardinal. These statements express the validity of the notions of replete and well-replete car- dinals, which are introduced and proved to be specially relevant to the study of cardinal exponentiation. As a byproduct, a structure theorem for linear orderings is proved to be equivalent to GCH: for every linear ordering L, at least one of L and its converse is universal for the smaller well-orderings.


2020 ◽  
Vol 30 (8) ◽  
pp. 1681-1693
Author(s):  
Fedor Pakhomov ◽  
Alexander Zapryagaev

Abstract Presburger arithmetic is the true theory of natural numbers with addition. We study interpretations of Presburger arithmetic in itself. The main result of this paper is that all self-interpretations are definably isomorphic to the trivial one. Here we consider interpretations that might be multi-dimensional. We note that this resolves a conjecture by Visser (1998, An overview of interpretability logic. Advances in Modal Logic, pp. 307–359). In order to prove the result, we show that all linear orderings that are interpretable in $({\mathbb{N}},+)$ are scattered orderings with the finite Hausdorff rank and that the ranks are bounded in the terms of the dimensions of the respective interpretations.


2020 ◽  
pp. 1-18
Author(s):  
JULIA F. KNIGHT ◽  
ALEXANDRA A. SOSKOVA ◽  
STEFAN V. VATEV
Keyword(s):  

Author(s):  
A. B. Altayeva ◽  
B. Sh Kulpeshov ◽  
S. V. Sudoplatov
Keyword(s):  

2018 ◽  
Vol 83 (3) ◽  
pp. 1147-1189 ◽  
Author(s):  
OLIVIER CARTON ◽  
THOMAS COLCOMBET ◽  
GABRIELE PUPPIS

AbstractWe develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three logical applications. First, we establish the first known collapse result for the quantifier alternation of MSO logic over countable linear orderings. Second, we solve an open problem posed by Gurevich and Rabinovich, concerning the MSO-definability of sets of rational numbers using the reals in the background. Third, we establish the MSO-definability of the set of yields induced by an MSO-definable set of trees, confirming a conjecture posed by Bruyère, Carton, and Sénizergues.


2017 ◽  
Vol 17 (02) ◽  
pp. 1792002
Author(s):  
Rodney G. Downey ◽  
Steffen Lempp ◽  
Guohua Wu
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document