English
Related papers

Related papers: Some notes on plump ordinals

200 papers

We give a framework for comparing on the one hand theories of n-categories that are weakly enriched operadically, and on the other hand n-categories given as algebras for a contractible globular operad. Examples of the former are the…

Category Theory · Mathematics 2008-10-05 Eugenia Cheng

We introduce a realisability semantics for infinitary intuitionistic set theory that is based on Ordinal Turing Machines (OTMs). We show that our notion of OTM-realisability is sound with respect to certain systems of infinitary…

Logic · Mathematics 2022-12-14 Merlin Carl , Lorenzo Galeotti , Robert Passmann

Functional analysis, especially the theory of Hilbert spaces and of operators on these, form an important area in mathematics. We formalized the Isabelle/HOL library Complex_Bounded_Operators containing a large amount of theorems about…

Logic in Computer Science · Computer Science 2025-12-08 Dominique Unruh , José Manuel Rodríguez Caballero

In this paper, we give an axiomatization of the ordinal number system, in the style of Dedekind's axiomatization of the natural number system. The latter is based on a structure $(N,0,s)$ consisting of a set $N$, a distinguished element…

Logic · Mathematics 2020-09-01 Zurab Janelidze , Ineke van der Berg

One of the elegant achievements in the history of proof theory is the characterization of the provably total recursive functions of an arithmetical theory by its proof-theoretic ordinal as a way to measure the time complexity of the…

Logic · Mathematics 2024-11-27 Amirhossein Akbar Tabatabai

We build model structures on the category of equivariant simplicial operads with a fixed set of colors, with weak equivalences determined by families of subgroups. In particular, by specifying to the family of graph subgroups (or, more…

Algebraic Topology · Mathematics 2022-04-20 Peter Bonventre , Luis Alexandre Pereira

In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…

Computational Complexity · Computer Science 2009-12-31 Marco Pedicini , Mario Piazza

We consider the integral and derivative operators of tempered fractional calculus, and examine their analytic properties. We discover connections with the classical Riemann-Liouville fractional calculus and demonstrate how the operators may…

Classical Analysis and ODEs · Mathematics 2019-12-12 Arran Fernandez , Ceren Ustaoglu

We record a particularly simple construction on top of Lumsdaine's local universes that allows for a Coquand-style universe of propositions with propositional extensionality to be interpreted in a category with subobject classifiers.

Logic in Computer Science · Computer Science 2024-05-24 Xu Huang

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

Logic · Mathematics 2017-02-23 Matthew Harrison-Trainor

We introduce an ordinal index which characterizes weak compactness of operators between Banach spaces. We study when classes consisting of operators having bounded index form a closed ideal, the distinctness of the classes, and the…

Functional Analysis · Mathematics 2015-08-25 Ryan M. Causey

We call a subset of an ordinal $\lambda$ recognizable if it is the unique subset $x$ of $\lambda$ for which some Turing machine with ordinal time and tape, which halts for all subsets of $\lambda$ as input, halts with the final state $0$.…

Logic · Mathematics 2026-05-19 Merlin Carl , Philipp Schlicht , Philip Welch

We study Medvedev reducibility in the context of set theory -- specifically, forcing and large cardinal hypotheses. Answering a question of Hamkins and Li \cite{HaLi}, we show that the Medvedev degrees of countable ordinals are far from…

Logic · Mathematics 2024-09-02 Noah Schweber

We characterize several large cardinal notions by model-theoretic properties of extensions of first-order logic. We show that $\Pi_n$-strong cardinals, and, as a corollary, ``Ord is Woodin" and weak Vop\v{e}nka's Principle, are…

Logic · Mathematics 2025-05-22 Will Boney , Jonathan Osinski

We build model structures on the category of equivariant simplicial operads with weak equivalences determined by families of subgroups, in the context of operads with a varying set of colors (and building on the fixed color model structures…

Algebraic Topology · Mathematics 2022-12-21 Peter Bonventre , Luis Alexandre Pereira

To understand changes in physical systems and facilitate decisions, explaining how model predictions are made is crucial. We use model-based interpretability, where models of physical systems are constructed by composing basic constructs…

Artificial Intelligence · Computer Science 2020-03-24 Ion Matei , Johan de Kleer , Christoforos Somarakis , Rahul Rai , John S. Baras

We study compactness and L\"owenheim-Skolem properties of fragments of the class-sized logic $\mathcal{L}_{\infty \infty}$ and of class-sized versions of second-order and sort logics. In these fragments, certain combinations of infinitary…

Logic · Mathematics 2026-04-24 Jonathan Osinski , Trevor Wilson

Context. A porous and/or fractal description can generally be applied where particles have undergone coagulation into aggregates. Aims. To characterise finite-sized, porous and fractal particles and to understand the possible limitations of…

Disordered Systems and Neural Networks · Physics 2015-11-09 A. P. Jones

This paper introduces some inverse sequences of different polyhedra all based on finite approximations of a compact metric space so they can be used to capture the shape type of the original space. It is shown that they are HPol-expansions,…

Geometric Topology · Mathematics 2021-10-25 Diego Mondéjar

We use forcing over admissible sets to show that, for every ordinal $\alpha$ in a club $C\subset\omega_1$, there are copies of $\alpha$ such that the isomorphism between them is not computable in the join of the complete $\Pi^1_1$ set…

Logic · Mathematics 2024-08-21 Noah Schweber