Related papers: Functorial Fast-Growing Hierarchies
We prove a classification of additive polynomial superfunctors, which allows us to compute some extensions of a superfunctor of the form $F \circ A$ where $F$ is a classical polynomial functor and $A$ is additive. We get a formula which…
We construct an increasing, submultiplicative, arbitrarily rapid function which is not equivalent to the growth function of any finitely generated algebra, demonstrating the difficulty in characterizing growth functions in an asymptotic…
We write down a series of basic laws for (strict) higher-order circuit diagrams. More precisely, we define higher-order circuit theories in terms of: (a) nesting, (b) temporal and spatial composition, and (c) equivalence between lower-order…
It is known that $Q$-conditional symmetries of the classical Burgers' equation express in terms of three functions satisfying a coupled system of Burgers-like equations. The search of conditional symmetries of this system leads to a system…
We explore the sense in which the existing constructions for higher-order maps on quantum theory based on causality constraints and compositionality constraints respectively, coincide. More precisely, we construct a functor F : Caus(C) ->…
In this paper we investigate cumulative hierarchies of functions on structures, or cumulative powers, and study their properties. Particularly, we show how they extend the preservation phenomena of reduced powers, direct powers and…
In mathematical logic there are two seemingly distinct kinds of principles called "reflection principles." Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic…
We look at a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compositions of an integer, and binary compact codes. For this…
We introduce an elementary class of linearly ordered groups, called growth order groups, encompassing certain groups under composition of formal series (e.g. transseries) as well as certain groups $\mathcal{G}_{\mathcal{M}}$ of infinitely…
Using functional equations, we define functors that generalize standard examples from calculus of one variable. Examples of such functors are discussed and their Taylor towers are computed. We also show that these functors factor through…
A notion of a coring extension is defined and it is related to the existence of an additive functor between comodule categories that factorises through forgetful functors. This correspondence between coring extensions and factorisable…
We demonstrate $k+1$-term arithmetic progressions in certain subsets of the real line whose "higher-order Fourier dimension" is sufficiently close to 1. This Fourier dimension, introduced in previous work, is a higher-order (in the sense of…
First order formulas in a relational signature can be considered as operations on the relations of an underlying set, giving rise to multisorted algebras we call first order algebras. We present universal axioms so that an algebra satisfies…
We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured…
Termination property of functions is an important issue in computability theory. In this paper, we show that repeated iterations of a function can induce an order amongst the elements of its domain set. Hasse diagram of the poset, thus…
The following is an introduction to the study of higher walks, by which we mean a family of higher-dimensional extensions of Todorcevic's method of walks on the ordinals. After a brief review of this method, including, for example,…
We define a function by refining Stern's diatomic sequence. We name it the {\it assembly function}. It is strictly increasing continuous. The first and the second main theorems are on an action to the function. The third theorem is on…
This paper studies tree-automatic ordinals (or equivalently, well-founded linearly ordered sets) together with the ordinal addition operation +. Informally, these are ordinals such that their elements are coded by finite trees for which the…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
We give examples of sequences defined by smooth functions of intermediate growth, and we study the Furstenberg systems that model their statistical behavior. In particular, we show that the systems are Bernoulli. We do so by studying…