Related papers: Definability over $\mathrm B\Sigma^0_2$-models

Working in any model theoretic structure, we single out a class of definable bipartite graphs that admit definable, close to perfect matchings. We use this result to prove a strengthening of Tarski's theorem for the definable setting.

A function $F:2^\omega\to 2^\omega$ is an $E_0$-isomorphism if for all $x,y\in 2^\omega$, we have $xE_0y\iff f(x)E_0 f(y)$, where $xE_0y\iff(\exists a)(\forall n\ge b) x(n)=y(n)$. If such witnesses $a$ for $xE_0 y$ and for $f(x)E_0 f(y)$…

We develop the theory of stratification for a rigidly-compactly generated tensor-triangulated category using the smashing spectrum and the small smashing support. Within the stratified context, we investigate connections between big prime…

Let N be a square-free positive integer and let f be a newform of weight 2 on \Gamma_0(N). Let A denote the abelian subvariety of J_0(N) associated to f and let m be a maximal ideal of the Hecke algebra T that contains Ann_T(f) and has…

Solution discovery asks whether a given (infeasible) starting configuration to a problem can be transformed into a feasible solution using a limited number of transformation steps. This paper investigates meta-theorems for solution…

We show that Brown's lemma is equivalent to Sigma02-induction over RCA0* and that the finite version of Brown's lemma is provable in RCA0 but not in RCA0*.

Classically, any structure for a signature $\Sigma$ may be completed to a model of a desired regular theory $T$ by means of the chase construction or small object argument. Moreover, this exhibits $\mathrm{Mod}(T)$ as weakly reflective in…

We initiate the study of definability (in the model-theoretic sense) of C*-tensor norms. We show that neither the minimal nor maximal tensor norms are definable uniformly over all C*-algebras. The proof in the case of the minimal tensor…

In this paper, we look at an unambiguous version of Simon's forest factorization theorem, a very deep result which has wide connections in algebra, logic and automata. Given a morphism $\varphi$ from $\Sigma^+$ to a finite semigroup $S$, we…

We study valued fields equipped with an automorphism $\sigma$ which is locally infinitely contracting in the sense that $\alpha\ll\sigma\alpha$ for all $0<\alpha\in\Gamma$. We show that various notions of valuation theory, such as Henselian…

Suppose you have an uncomputable set $X$ and you want to find a set $A$, all of whose infinite subsets compute $X$. There are several ways to do this, but all of them seem to produce a set $A$ which is fairly sparse. We show that this is…

We analyze the pointwise convergence of a sequence of computable elements of L^1(2^omega) in terms of algorithmic randomness. We consider two ways of expressing the dominated convergence theorem and show that, over the base theory RCA_0,…

Motivated by a question of L. Robert, asking whether $\rm L(T(A)) = Lsc_{C}(T(A))$ for any separable C*-algebra A, we introduce and initiate the study of \emph{tracially reflexive C*-algebras}. We first prove that commutative C*-algebras…

We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…

Let $(R, \mathfrak m)$ be a commutative noetherian local ring and $I$ an ideal of $R$. For every $R$-module $M$, $\gamma_I(M) = \sum\{ \operatorname{Bi} f \,|\, f \in \operatorname{Hom}_R(I,M)\}$ is called the trace of $I$ in $M$. It is…

Let $R$ be an arbitrary subset of a commutative ring. We introduce a combinatorial model for the set of tame frieze patterns with entries in $R$ based on a notion of irreducibility of frieze patterns. When $R$ is a ring, then a frieze…

We prove that $\RCA + \RRT^3_2 \not\vdash \ACA$ where $\RRT^3_2$ is the Rainbow Ramsey Theorem for 2-bounded colorings of triples. This reverse mathematical result is based on a cone avoidance theorem, that every 2-bounded coloring of pairs…

We show that the well-known Konig's Min-Max Theorem (KMM), a fundamental result in combinatorial matrix theory, can be proven in the first order theory $\LA$ with induction restricted to $\Sigma_1^B$ formulas. This is an improvement over…

Let $F$ be a field and let $F \langle X \rangle$ be the free unital associative algebra over $F$ freely generated by an infinite countable set $X = \{x_1, x_2, \dots \}$. Define a left-normed commutator $[a_1, a_2, \dots, a_n]$ recursively…

We investigate structural implications arising from the condition that a given directed graph does not interpret, in the sense of primitive positive interpretation with parameters or orbits, every finite structure. Our results generalize…