English
Related papers

Related papers: Classifying equivalence relations in the Ershov hi…

200 papers

The d-Segal conditions of Dyckerhoff and Kapranov are exactness properties for simplicial objects based on the geometry of cyclic polytopes in d-dimensional Euclidean space. 2-Segal spaces are also known as decomposition spaces, and most…

Group Theory · Mathematics 2025-09-05 Philip Hackney , Justin Lynd

We define and study hierarchies of topological spaces induced by the classical Borel and Luzin hierarchies of sets. Our hierarchies are divided into two classes: hierarchies of countably based spaces induced by their embeddings into the…

Logic in Computer Science · Computer Science 2013-04-08 Matthias Schroeder , Victor Selivanov

A numbering of a countable family $S$ is a surjective map from the set of natural numbers $\omega$ onto $S$. A numbering $\nu$ is reducible to a numbering $\mu$ if there is an effective procedure which given a $\nu$-index of an object from…

Logic · Mathematics 2023-11-08 Nikolay Bazhenov , Sergey Ospichev , Mars Yamaleev

We provide requirements on effectively enumerable topological spaces which guarantee that the Rice-Shapiro theorem holds for the computable elements of these spaces. We show that the relaxation of these requirements leads to the classes of…

Logic in Computer Science · Computer Science 2019-03-14 Margarita Korovina , Oleg Kudinov

Generic computability has been studied in group theory and we now study it in the context of classical computability theory. A set A of natural numbers is generically computable if there is a partial computable function f whose domain has…

Group Theory · Mathematics 2014-02-26 Carl G. Jockusch , Paul E. Schupp

We study approximate equivalence relations up to commensurability, in the presence of a definable measure. As a basic framework, we give a presentation of probability logic based on continuous logic. Hoover's normal form is valid here; if…

Logic · Mathematics 2024-07-30 Ehud Hrushovski

We consider formal verification of recursive programs with resource consumption. We introduce prefix replacement systems with non-negative integer counters which can be incremented and reset to zero as a formal model for such programs. In…

Logic in Computer Science · Computer Science 2015-07-01 Martin Lang , Christof Löding

We answer a question by Vasco Brattka and Guido Gherardi by proving that the Weihrauch-lattice is not a Brouwer algebra. The computable Weihrauch-lattice is also not a Heyting algebra, but the continuous Weihrauch-lattice is. We further…

Logic in Computer Science · Computer Science 2015-07-01 Kojiro Higuchi , Arno Pauly

We study effectively inseparable (e.i.) pre-lattices (i.e. structures of the form $L=\langle \omega, \wedge, \lor, 0, 1, \leq_L\rangle$ where $\omega$ denotes the set of natural numbers and the following hold: $\wedge, \lor$ are binary…

Logic · Mathematics 2019-07-22 Uri Andrews , Andrea Sorbi

A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…

Logic · Mathematics 2015-05-08 Denis R. Hirschfeldt , Carl G. Jockusch , Rutger Kuyper , Paul E. Schupp

We present a formalization, in the theorem prover Lean, of the classification of solvable Lie algebras of dimension at most three over arbitrary fields. Lie algebras are algebraic objects which encode infinitesimal symmetries, and as such…

Logic in Computer Science · Computer Science 2025-05-27 Viviana del Barco , Gustavo Infanti , Exequiel Rivas , Paul Schwahn

We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…

K-Theory and Homology · Mathematics 2015-10-23 Marius Dadarlat , Ralf Meyer

We show that the homology of the partition algebras, interpreted as appropriate Tor-groups, is isomorphic to that of the symmetric groups in a range of degrees that increases with the number of nodes. Furthermore, we show that when the…

Algebraic Topology · Mathematics 2024-02-21 Rachael Boyd , Richard Hepworth , Peter Patzt

We consider the evaluation of first-order queries over classes of databases that have bounded degree and low degree. More precisely, given a query and a database, we want to efficiently test whether there is a solution, count how many…

Logic in Computer Science · Computer Science 2020-10-08 Alexandre Vigny

In this paper, we obtain a class of $\mathbb{Z}$-graded conformal algebras which is induced by Heisenberg-Virasoro conformal algebra. More precisely, we classify $\mathbb{Z}$-graded conformal algebras $\mathcal{A} =…

Representation Theory · Mathematics 2022-06-03 Lipeng Luo , Yucai Su , Xiaoqing Yue

This article discusses the properties of extremes of degree sequences calculated from network data. We introduce the notion of a normalized degree, in order to permit a comparison of degree sequences between networks with differing numbers…

Methodology · Statistics 2012-10-17 Sofia C. Olhede , Patrick J. Wolfe

In classification problems, especially those that categorize data into a large number of classes, the classes often naturally follow a hierarchical structure. That is, some classes are likely to share similar structures and features. Those…

Machine Learning · Computer Science 2018-07-25 Denali Molitor , Deanna Needell

We explore the low levels of the structure of the continuous Weihrauch degrees of first-order problems. In particular, we show that there exists a minimal discontinuous first-order degree, namely that of $\accn$, without any determinacy…

Logic · Mathematics 2024-01-24 Arno Pauly , Giovanni Soldà

We introduce a hierarchy of degree structures between the Medvedev and Muchnik lattices which allow varying amounts of non-uniformity. We use these structures to introduce the notion of the uniformity of a Muchnik reduction, which expresses…

Logic · Mathematics 2019-09-18 Rutger Kuyper

We study the number of (set-theoretically) defining equations of Segre products of projective spaces times certain projective hypersurfaces, extending results by Singh and Walther. Meanwhile, we prove some results about the cohomological…

Algebraic Geometry · Mathematics 2010-08-02 Matteo Varbaro