English
Related papers

Related papers: DNR and incomparable Turing degrees

200 papers

As many will agree, it feels good to complement a cup of tea by a donut or two. This sweet relationship is also a guiding principle of non-commutative geometry known as Serre Theorem. We explain the algebra behind this theorem and prove…

Algebraic Geometry · Mathematics 2018-03-26 Igor Nikolaev

We investigate the complexity of embeddings between bi-embeddable structures. In analogy with categoricity spectra, we define the bi-embeddable categoricity spectrum of a structure $\mathcal A$ as the family of Turing degrees that compute…

Logic · Mathematics 2021-03-16 Nikolay Bazhenov , Ekaterina Fokina , Dino Rossegger , Luca San Mauro

We examine the degree spectra of relations on ${(\omega, <)}$. Given an additional relation $R$ on ${(\omega,<)}$, such as the successor relation, the degree spectrum of $R$ is the set of Turing degrees of $R$ in computable copies of…

Logic · Mathematics 2025-11-07 Jad Damaj , Matthew Harrison-Trainor

In this paper, a nilpotency criterion is given for finite dimensional alternative superalgebras in the spirit of Engel's Theorem for Jordan superalgebras over infinite fields provided by Shestakov and Okunev. For alternative superalgebras,…

Rings and Algebras · Mathematics 2026-04-28 Isabel Hernández , Laiz Valim da Rocha , Rodrigo Lucas Rodrigues

The finitistic dimension conjecture is closely connected to the symmetry of the finitistic dimension. Recent work indicates that such connection extends to one of its upper bounds, the delooping level. In this paper, we show that the same…

Representation Theory · Mathematics 2025-08-05 Ruoyu Guo

When formalized, some diagonal arguments do not show the diagonal object to be impossible but rather reveal some other anomaly (e.g., that one of the relevant sets is ill-defined). This raises the possibility that some diagonal arguments…

Logic · Mathematics 2025-04-21 T. Parent

We prove an analogue of Morley's categoricity theorem where cardinality is replaced by the recursion-theoretic notion of arithmetic degree. We say that a complete arithmetically definable theory $T$ is $D$-categorical if any two…

Logic · Mathematics 2026-05-04 Jun Le Goh , Chieu-Minh Tran

A general theory of dynamics is formulated with the aim of its application in emergent quantum mechanics. In such a framework it is argued that the fundamental dynamics of emergent quantum mechanics must be non-reversible.

Mathematical Physics · Physics 2022-09-07 Ricardo Gallego Torromé

We propose a new method for constructing Turing ideals satisfying principles of reverse mathematics below the Chain-Antichain Principle (CAC). Using this method, we are able to prove several new separations in the presence of Weak Konig's…

Logic · Mathematics 2018-10-05 Henry Towsner

We study the Second Main Theorem in non-archimedean Nevanlinna theory, giving an improvement to the non-archimedean Second Main Theorems of Ru and An in the case where all the hypersurfaces have degree greater than one and all intersections…

Complex Variables · Mathematics 2013-03-19 Aaron Levin

In [3] Borzellino and Brunsden started to develop an elementary differential topology theory for orbifolds. In this paper we carry on their project by defining a mapping degree for proper maps between orbifolds, which counts preimages of…

Geometric Topology · Mathematics 2019-07-05 Federica Pasquotto , Thomas O. Rot

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a…

Combinatorics · Mathematics 2010-06-15 Radoslav Fulek , Filip Morić , David Pritchard

A basic question concerning indecomposable Soergel bimodules is to understand their endomorphism rings. In characteristic zero all degree-zero endomorphisms are isomorphisms (a fact proved by Elias and the second author) which implies the…

Representation Theory · Mathematics 2017-07-27 Nicolas Libedinsky , Geordie Williamson

We show that there is a strong minimal pair in the computably enumerable Turing degrees.

Logic · Mathematics 2016-10-13 George Barmpalias , Mingzhong Cai , Steffen Lempp , Theodore A. Slaman

The present paper is a note on the tensor degree of finite groups, introduced recently in literature. This numerical invariant generalizes the commutativity degree through the notion of nonabelian tensor square. We show two inequalities,…

Group Theory · Mathematics 2015-09-09 Ahmad M. A. Alghamdi , Francesco G. Russo

In this article, we will show that uncomputability is a relative property not only of oracle Turing machines, but also of subrecursive classes. We will define the concept of a Turing submachine, and a recursive relative version for the Busy…

Logic in Computer Science · Computer Science 2016-12-23 Felipe S. Abrahão

We define a transcendence degree for division algebras, by modifying the lower transcendence degree construction of Zhang. We show that this invariant has many of the desirable properties one would expect a noncommutative analogue of the…

Rings and Algebras · Mathematics 2010-03-01 Jason P. Bell

This paper introduces new notions of asymptotic proofs, PT(polynomial-time)-extensions, PTM(polynomial-time Turing machine)-omega-consistency, etc. on formal theories of arithmetic including PA (Peano Arithmetic). This paper shows that P…

Computational Complexity · Computer Science 2007-05-23 Tatsuaki Okamoto , Ryo Kashima

We define ''convergence'' for noncommutative power series and construct two topologies on the algebra of power series, convergent with respect to a positive radius. We indicate all finite dimensional continuous representations of this…

Quantum Algebra · Mathematics 2007-05-23 Frank Schuhmacher

Deep Learning using the eponymous deep neural networks (DNNs) has become an attractive approach towards various data-based problems of theoretical physics in the past decade. There has been a clear trend to deeper architectures containing…

Machine Learning · Computer Science 2021-06-30 Bastian Kaspschak , Ulf-G. Meißner