Related papers: On cohesive powers of linear orders

A relatively new topic in computability theory is the study of notions of computation that are robust against mistakes on some kind of small set. However, despite the recent popularity of this topic relatively foundational questions about…

Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…

We investigate the partial orderings of the form (P(X),\subset), where X is a countable binary relational structure and P(X) the set of the domains of its isomorphic substructures and show that if the components of X are maximally…

We consider sequences of integers defined by a system of linear inequalities with integer coefficients. We show that when the constraints are strong enough to guarantee that all the entries are nonnegative, the generating function for the…

Adapting a result of Bazhenov, Kalimullin, and Yamaleev, we show that if a Turing degree $\textbf{d}$ is the degree of categoricity of a computable structure $\mathcal{M}$ and is not the strong degree of categoricity of any computable…

In this paper, we provide two different resolutions of structural sheaves of projectivized tangent bundles of smooth complete intersections. These resolutions allow in particular to obtain convenient (and completely explicit) descriptions…

This paper addresses the longstanding problem of determining the structure of the $\leq_{\mathrm{LT}}$-order in the Effective Topos, known to effectively embed the Turing degrees. In a surprising discovery, we show that the…

Given a nonempty set $\mathcal{L}$ of linear orders, we say that the linear order $L$ is $\mathcal{L}$-convex embeddable into the linear order $L'$ if it is possible to partition $L$ into convex sets indexed by some element of $\mathcal{L}$…

In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…

We examine the degree structure $\mathbf{ER}$ of equivalence relations on $\omega$ under computable reducibility. We examine when pairs of degrees have a join. In particular, we show that sufficiently incomparable pairs of degrees do not…

A relation algebra is called measurable when its identity is the sum of measurable atoms, and an atom is called measurable if its square is the sum of functional elements. In this paper we show that atomic measurable relation algebras have…

We investigate the statement "the order topology of every countable complete linear order is compact" in the framework of reverse mathematics, and we find that the statement's strength depends on the precise formulation of compactness. If…

We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…

We introduce and study the mixed Segre zeta function of a sequence of homogeneous ideals in a polynomial ring. This function is a power series encoding information about the mixed Segre classes obtained by extending the ideals to projective…

A general theme of computable structure theory is to investigate when structures have copies of a given complexity $\Gamma$. We discuss such problem for the case of equivalence structures and preorders. We show that there is a $\Pi^0_1$…

We prove that in the Cohen extension adding $\aleph_3$ generic reals to a model of $ZFC+CH$ containing a simplified $(\omega_1,2)$-morass, gap-2 morass-definable $\eta_1$-orderings with cardinality $\aleph_3$ are order-isomorphic. Hence it…

We initiate the effective metric structure theory of Keisler randomizations. We show that a classical countable structure $\mathcal{M}$ has a decidable presentation if and only if its Borel randomization $\mathcal{M}^{[0,1)}$ has a…

We describe a theoretical and effective algorithm which enables us to prove that rather general hypergeometric series and integrals can be decomposed as linear combinations of multiple zeta values, with rational coefficients.

An open question in reverse mathematics is whether the cohesive principle, $\COH$, is implied by the stable form of Ramsey's theorem for pairs, $\SRT^2_2$, in $\omega$-models of $\RCA$. One typical way of establishing this implication would…

In [arXiv:1006.4939] the enumeration order reducibility is defined on natural numbers. For a c.e. set A, [A] denoted the class of all subsets of natural numbers which are co-order with A. In definition 5 we redefine co-ordering for rational…