English
Related papers

Related papers: Computable Aspects of the Bachmann-Howard Principl…

200 papers

Using a result of recursive function theory and results of the complex analysis of Takeuti, which is based on a type theory and the work of Kreisel, and which gives a conservative extension of first order Peano arithmetic (PA), assuming all…

Number Theory · Mathematics 2024-12-04 Kevin Broughan

We introduce ordinal collapsing principles that are inspired by proof theory but have a set theoretic flavor. These principles are shown to be equivalent to iterated $\Pi^1_1$-comprehension and the existence of admissible sets, over weak…

Logic · Mathematics 2021-12-16 Anton Freund , Michael Rathjen

We explicitly establish a unitary correspondence between spherical irreducible tensor operators and cartesian tensor operators of any rank. That unitary relation is implemented by means of a basis of integer-spin wave functions that…

Quantum Physics · Physics 2020-08-11 Antonio O. Bouzas

We introduce two notions of a contractive orbit of a set-valued map defined in a first countable space. The first defines the contraction with respect to the topology of the underlying space while the second defines the contraction with…

Functional Analysis · Mathematics 2026-02-10 Detelina Kamburova

The TTE approach to Computable Analysis is the study of so-called representations (encodings for continuous objects such as reals, functions, and sets) with respect to the notions of computability they induce. A rich variety of such…

Computational Complexity · Computer Science 2023-06-22 Carsten Rösnick-Neugebauer

Our main result is a recognition principle for iterated suspensions as coalgebras over the little disks operads. Given a topological operad, we construct a comonad in pointed topological spaces endowed with the wedge product. We then prove…

Algebraic Topology · Mathematics 2026-02-27 Oisín Flynn-Connolly , José M. Moreno-Fernández , Felix Wierstra

A classical result of Sz.-Nagy asserts that a Hilbert space contraction operator $T$ can be dilated to a unitary $\cU$. A more general multivariable setting for these ideas is the setup where (i) the unit disk is replaced by a domain…

Functional Analysis · Mathematics 2022-07-08 Joseph A. Ball , Haripada Sau

The lambda calculus is a widely accepted computational model of higher-order functional pro- grams, yet there is not any direct and universally accepted cost model for it. As a consequence, the computational difficulty of reducing lambda…

Logic in Computer Science · Computer Science 2012-02-09 Beniamino Accattoli , Ugo Dal Lago

Shapiro's notations for natural numbers, and the associated desideratum of acceptability - the property of a notation that all recursive functions are computable in it - is well-known in philosophy of computing. Computable structure theory,…

Logic · Mathematics 2022-05-03 Nikolay Bazhenov , Dariusz Kalociński

This paper contains the following $\delta$-discretised projection theorem for Ahlfors regular sets in the plane. For all $C,\epsilon > 0$ and $s \in [0,1]$, there exists $\kappa > 0$ such that the following holds for all $\delta > 0$ small…

Classical Analysis and ODEs · Mathematics 2024-10-15 Tuomas Orponen

We consider Riemann mappings from bounded Lipschitz domains in the plane to a triangle. We show that in this case the Riemann mapping has a linear variational principle: it is the minimizer of the Dirichlet energy over an appropriate affine…

Computational Geometry · Computer Science 2018-02-13 Nadav Dym , Yaron Lipman , Raz Slutsky

Computability theory is a discipline in the intersection of computer science and mathematical logic where the fundamental question is: given two mathematical objects X and Y, does X compute Y in principle? In case X and Y are real numbers,…

Logic · Mathematics 2022-10-12 Sam Sanders

We show that the disintegration operator on a complete separable metric space along a projection map, restricted to measures for which there is a unique continuous disintegration, is strongly Weihrauch equivalent to the limit operator Lim.…

Logic · Mathematics 2017-11-22 Nathanael L. Ackerman , Cameron E. Freer , Daniel M. Roy

Martin's remarkable proof of $\mathbf{\Pi}^1_2$-determinacy from an iterable rank-into-rank embedding highlighted the connection between large cardinals and determinacy. In this paper, we isolate a large cardinal object called a measurable…

Logic · Mathematics 2025-07-25 Hanul Jeon

This paper is an extended version of our work in \cite{Ca2025}. We extend the concept of effective reducibility between statements of set theory with ordinal Turing machines (OTMs) explored in \cite{Ca2018} for $\Pi_{2}$-statements to…

Logic · Mathematics 2026-05-11 Merlin Carl

We derive computationally tractable methods to select a small subset of experiment settings from a large pool of given design points. The primary focus is on linear regression models, while the technique extends to generalized linear models…

Machine Learning · Statistics 2017-12-21 Yining Wang , Adams Wei Yu , Aarti Singh

We consider fragments of uniform reflection for formulas in the analytic hierarchy over theories of second order arithmetic. The main result is that for any second order arithmetic theory $T_0$ extending ${\sf RCA}_0$ and axiomatizable by a…

Logic · Mathematics 2022-07-26 Emanuele Frittaion

Borchers has shown that in a translation covariant vacuum representation of a theory of local observables with positive energy the following holds: The (Tomita) modular objects associated with the observable algebra of a fixed wedge region…

Mathematical Physics · Physics 2009-04-17 Jens Mund

This paper concerns the dilations of Banach space operator-valued quantum measures. While the recently developed general dilation theory can lead to a projection (idempotent) valued dilation for any quantum measure over the projection…

Functional Analysis · Mathematics 2021-09-21 Deguang Han , Qianfeng Hu , David R. Larson , Rui Liu

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…

Logic in Computer Science · Computer Science 2015-07-01 Klaus Weihrauch , Nazanin Tavana-Roshandel