English
Related papers

Related papers: Admissibly Represented Spaces and Qcb-Spaces

200 papers

An \'{e}tale space over a topological space $Y$ is defined as a local homeomorphism from a topological space $X$ into $Y$. They often come up in topos theory because of the equivalence between sheaves and \'{e}tale spaces over a space. In…

Logic · Mathematics 2026-05-01 Matthew de Brecht

Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is a…

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

Suppose $p \geq 1$ is a computable real. We extend previous work of Clanin, Stull, and McNicholl by classifying the computable $L^p$ spaces whose underlying measure spaces are atomic but not purely atomic. In addition, we determine the…

Logic · Mathematics 2019-04-30 Tyler Brown , Timothy H. McNicholl

In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…

Logic · Mathematics 2024-11-25 Emmanuel Rauzy

Computable analysis and effective descriptive set theory are both concerned with complete metric spaces, functions between them and subsets thereof in an effective setting. The precise relationship of the various definitions used in the two…

Logic in Computer Science · Computer Science 2016-06-29 Vassilios Gregoriades , Tamás Kispéter , Arno Pauly

We consider the question as to whether the exponent of a computably presentable Lebesgue space whose dimension is at least 2 must be computable. We show this very natural conjecture is true when the exponent is at least 2 or when the space…

Logic · Mathematics 2020-01-01 Timothy H. McNicholl

Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in both classic and effective descriptive set theory.…

Logic in Computer Science · Computer Science 2014-06-03 Arno Pauly , Matthew de Brecht

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

Logic in Computer Science · Computer Science 2016-11-14 Cyril Cohen , Thierry Coquand , Simon Huber , Anders Mörtberg

Reeb spaces of continuous real-valued functions on topological spaces are fundamental and strong tools in investigating the spaces. The Reeb space is the natural quotient space of the space of the domain represented by connected components…

Algebraic Geometry · Mathematics 2026-05-13 Naoki Kitazawa

We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective…

Logic · Mathematics 2025-04-16 Heer Tern Koh , Alexander Melnikov , Keng Meng Ng

Orthogonal projections in ${\mathbb C}^n \otimes {\mathbb C}^n$ of rank one and rank two that give rise to unitary tensor space representations of the Temperley-Lieb algebra $TL_N(Q)$ are considered. In the rank one case, a complete…

Mathematical Physics · Physics 2015-10-20 Andrei Bytsko

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…

Logic · Mathematics 2013-07-03 Wouter Pieter Stekelenburg

We revisit the definition of effective local compactness, and propose an approach that works for arbitrary countably-based spaces extending the previous work on computable metric spaces. We use this to show that effective local compactness…

Logic in Computer Science · Computer Science 2019-03-14 Arno Pauly

The notion of relative cuspidality for distinguished representations attached to $p$-adic symmetric spaces is introduced. A characterization of relative cuspidality in terms of Jacquet modules is given and a generalization of Jacquet's…

Representation Theory · Mathematics 2007-06-18 Shin-ichi Kato , Keiji Takano

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by G\"odel and Kleene. We show that this class of functions can also be…

Logic in Computer Science · Computer Science 2020-10-05 Keng Meng Ng , Nazanin R. Tavana , Yue Yang

Computability theory is used to evaluate the complexity of classifying various kinds of Lebesgue spaces and associated isometric isomorphism problems.

Logic · Mathematics 2019-07-01 Tyler Brown , Alexander G. Melnikov , Timothy H. McNicholl

The aim of this paper is to present an elementary computable theory of random variables, based on the approach to probability via valuations. The theory is based on a type of lower-measurable sets, which are controlled limits of open sets,…

Logic in Computer Science · Computer Science 2021-01-05 Pieter Collins

We study function spaces that are related to square-integrable, irreducible, unitary representations of several low-dimensional nilpotent Lie groups. These are new examples of coorbit theory and yield new families of function spaces on…

Functional Analysis · Mathematics 2023-04-18 Karlheinz Gröchenig

Learning Spaces are certain set systems that are applied in the mathematical modeling of education. We propose a suitable compression (without loss of information) of such set systems to facilitate their logical and statistical analysis.…

Data Structures and Algorithms · Computer Science 2017-08-14 Marcel Wild