English
Related papers

Related papers: Extending Properly n-REA Sets

200 papers

Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…

Logic · Mathematics 2019-07-02 Saeed Salehi , Payam Seraji

We study first-order expansions of the reals which do not define the set of natural numbers. We also show that several stronger notions of tameness are equivalent to each others.

Logic · Mathematics 2011-04-12 Antongiulio Fornasiero

Richter, Stephan, and Zhang asked whether every nonrecursive many-one degree contains a least finite-one degree. We solve this question in the negative, already within the class of computably enumerable many-one degrees. Positive answers…

Logic · Mathematics 2026-04-14 Patrizio Cintioli

We study reductions that limit the extreme adaptivity of Turing reductions. In particular, we study reductions that make a rapid, structured progression through the set to which they are reducing: Each query is strictly longer (shorter)…

Computational Complexity · Computer Science 2007-05-23 Lane A. Hemaspaandra , Mayur Thakur

In 1957 Cartan proved his celebrated Theorem B and deduced that if $\Omega\subset{\mathbb R}^n$ is an open set and $X$ is a coherent real analytic subset of $\Omega$, then $X$ has the analytic extension property: Each real analytic function…

Algebraic Geometry · Mathematics 2025-07-29 José F. Fernando , Riccardo Ghiloni

Given a represented space (in the sense of TTE theory), an appropriate representation is constructed for the Moschovakis extension of its carrier (with paying attention to the cases of effective topological spaces and effective metric…

Logic · Mathematics 2023-06-22 Dimiter Skordev

In this paper, we present a generalized effective completeness theorem for continuous logic. The primary result is that any continuous theory is satisfied in a structure which admits a presentation of the same Turing degree. It then follows…

Logic · Mathematics 2022-02-24 Caleb Camrud

A cap set in $\mathbb{F}_3^n$ is a subset that contains no three elements adding to 0. Building on a construction of Edel, a recent paper of Tyrrell gave the first improvement to the lower bound for a size of a cap set in two decades…

Combinatorics · Mathematics 2024-03-04 Luke Pebody

Extension conjecture states that if a simple module over an artin algebra has nonzero first self-extension group then it has nonzero i-th self-extension group for infinitely many positive integers i. It is shown by recollement of…

Representation Theory · Mathematics 2014-07-08 Yang Han

We associate a two-step nilpotent Lie algebra to an arbitrary Schreier graph. We then use properties of the Schreier graph to determine necessary and sufficient conditions for this Lie algebra to extend to a three-step nilpotent Lie…

Differential Geometry · Mathematics 2015-01-19 Allie Ray

In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…

Logic · Mathematics 2025-05-22 Java Darleen Villano

Given a compact of ${\bf R}^n$, there is always a doubling measure having it as its support. We use this fact to construct an integral operator that extends differentiable functions defined on any compact set of ${\bf R}^n$ to the whole of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Jaume Gudayol

We prove a structural result for sets of integers with doubling at most $4 + \delta$, with $\delta>0$ sufficiently small. This generalises earlier work of Eberhard--Green--Manners which dealt with sets of integers with doubling strictly…

Number Theory · Mathematics 2026-04-29 Yifan Jing , Akshat Mudgal

A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…

Logic · Mathematics 2023-05-16 Alfredo Roque Freire , Kameryn J. Williams

We investigate enumerability properties for classes of sets which permit recursive, lexicographically increasing approximations, or left-r.e. sets. In addition to pinpointing the complexity of left-r.e. Martin-L\"{o}f, computably, Schnorr,…

Logic · Mathematics 2014-08-14 Bjørn Kjos-Hanssen , Frank Stephan , Jason R. Teutsch

Non notherian Formal schemes of perfectoid type (for example $\mathbb{Z}_p[p^{1/p^\infty}]\langle X^{1/p^\infty} \rangle$ along with its multivariate version) with rational degree are constructed and are shown to be admissible. These formal…

Algebraic Geometry · Mathematics 2019-07-05 Harpreet Singh Bedi

The paper is the second of our series of notes aimed to bring back in circulation some bright ideas of early modern set theory, mainly due to Harrington and Sami, which have never been adequately presented in set theoretic publications. We…

Logic · Mathematics 2018-11-27 Vladimir Kanovei , Vassily Lyubetsky

For every field $F$ which has a quadratic extension $E$ we show there are non-metabelian infinite-dimensional thin graded Lie algebras all of whose homogeneous components, except the second one, have dimension $2$. We construct such Lie…

Rings and Algebras · Mathematics 2021-01-29 M. Avitabile , A. Caranti , N. Gavioli , V. Monti , M. F. Newman , E. A. O'Brien

In 1996, Michaux and Villemaire considered integer relations $R$ which are not definable in Presburger Arithmetic. That is, not definable in first-order logic over integers with the addition function and the order relation…

Logic · Mathematics 2016-11-14 Arthur Milchior

We study some generalized notions of cohesiveness which arise naturally in connection with effective versions of Ramsey's Theorem. An infinite set $A$ of natural numbers is $n$--cohesive (respectively, $n$--r--cohesive) if $A$ is almost…

Logic · Mathematics 2016-09-07 Tamara Hummel , Carl Jockusch
‹ Prev 1 4 5 6 7 8 10 Next ›