Related papers: The subTuring degrees

We develop the theory of Whitham type hierarchies integrable by hydrodynamic reductions as a theory of certain differential-geometric objects. As an application we construct Gibbons-Tsarev systems associated to moduli space of algebraic…

Given a finite lattice $L$ that can be embedded in the recursively enumerable (r.e.) Turing degrees $\mathcal{R}_{\mathrm{T}}$, it is not known how one can characterize the degrees $\mathbf{d}\in\mathcal{R}_{\mathrm{T}}$ below which $L$ can…

With the extensive application of submodularity, its generalizations are constantly being proposed. However, most of them are tailored for special problems. In this paper, we focus on quasi-submodularity, a universal generalization, which…

The problem of maximizing non-negative submodular functions has been studied extensively in the last few years. However, most papers consider submodular set functions. Recently, several advances have been made for the more general case of…

This paper introduces a robust class of functions from finite words to integers that we call Z-polyregular functions. We show that it admits natural characterizations in terms of logics, Z-rational expressions, Z-rational series and…

In this paper, we define a property, trimness, for lattices. Trimness is a not-necessarily-graded generalization of distributivity; in particular, if a lattice is trim and graded, it is distributive. Trimness is preserved under taking…

This paper introduces categories of assemblies which are closely connected to realizability interpretations and which are based on an important subcategory of the effective topos. There is a list of properties which characterize these…

This note gives a unifying characterization and exposition of strongly irreducible elements and their duals in lattices. The interest in the study of strong irreducibility stems from commutative ring theory, while the dual concept of strong…

We develop a realizability model in which the realizers are the reals not just Turing computable in a fixed real but rather the reals in a countable ideal of Turing degrees. This is then applied to prove several separation results involving…

We study strongly graded vertex algebras and their strongly graded modules, which are conformal vertex algebras and their modules with a second, compatible grading by an abelian group satisfying certain grading restriction conditions. We…

Real continuous submodular functions, as a generalization of the corresponding discrete notion to the continuous domain, gained considerable attention recently. The analog notion for entropy functions requires additional properties: a real…

In this paper we classify some special reducts of the countable atomless Boolean algebra which we call functional reducts. We prove that there are exactly $13$ such structures up to first order interdefinability.

While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…

We describe the basic theory of infinite time Turing machines and some recent developments, including the infinite time degree theory, infinite time complexity theory, and infinite time computable model theory. We focus particularly on the…

We investigate partial functions and computability theory from within a constructive, univalent type theory. The focus is on placing computability into a larger mathematical context, rather than on a complete development of computability…

In his seminal paper from 1936, Alan Turing introduced the concept of non-computable real numbers and presented examples based on the algorithmically unsolvable Halting problem. We describe a different, analytically natural mechanism for…

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…

Every computable function has to be continuous. To develop computability theory of discontinuous functions, we study low levels of the arithmetical hierarchy of nonuniformly computable functions on Baire space. First, we classify…

A standard tool for classifying the complexity of equivalence relations on $\omega$ is provided by computable reducibility. This reducibility gives rise to a rich degree structure. The paper studies equivalence relations, which induce…

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…