Related papers: Polymorphic Ordinal Notations
In a previous paper we introduced a version of associativity for a partial infinitary operation. We prove here that if $\gamma$ is an infinite ordinal and some associative infinitary operation is defined for all sequences indexed by…
In the article 'Ordinal Logics and the Characterizations of the Informal Concept of Proof', Georg Kreisel poses the problem of assigning unique notations to recursive ordinals, and additionally suggests that the methods which are developed…
It is well known that the set of algebraic numbers (let us call it $A$) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cantor, a recently introduced methodology using \G1-based…
Let $n \geq 4$ and let $\Omega$ be a bounded hyperconvex domain in $\mathbb{C}^{n}$. Let $\varphi$ be a negative exhaustive smooth plurisubharmonic function on $\Omega$. We show that any holomorphic function defined on a connected open…
We provide a model theoretical and tree property like characterization of $\lambda$-$\Pi^1_1$-subcompactness and supercompactness. We explore the behaviour of those combinatorial principles at accessible cardinals.
We motivate and study an infinite sequence of binary operations on the ordinal numbers, extending the standard arithmetic on the ordinals to higher degrees of iteration. Connections to the hyperoperations on the natural numbers are…
The foundational concepts of semantic numeration systems theory are briefly outlined. The action of cardinal semantic operators unfolds over a set of cardinal abstract entities belonging to the cardinal semantic multeity. The cardinal…
We study the logic obtained by endowing the language of first-order arithmetic with second-order measure quantifiers. This new kind of quantification allows us to express that the argument formula is true in a certain portion of all…
We axiomatically define a cardinal social inefficiency function, which, given a set of alternatives and individuals' vNM preferences over the alternatives, assigns a unique number -- the social inefficiency -- to each alternative. These…
This thesis is intended to provide an account of the theory and applications of Operational Methods that allow the "translation" of the theory of special functions and polynomials into a "different" mathematical language. The language we…
The unrivaled robustness of topologically ordered states of matter against perturbations has immediate applications in quantum computing and quantum metrology, yet their very existence poses a challenge to our understanding of phase…
In this paper we suggest a typed compositional seman-tics for nominal compounds of the form [Adj Noun] that models adjectives as higher-order polymorphic functions, and where types are assumed to represent concepts in an ontology that…
We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and…
Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…
Ordinal analysis induces a partition of $\Sigma^1_1$-definable and $\Pi^1_1$-sound theories whereby two theories are equivalent if they have the same proof-theoretic ordinal. We show that no equivalence relation $\equiv$ is finer than the…
In this article we provide an intrinsic characterization of the famous Howard-Bachmann ordinal in terms of a natural well-partial-ordering by showing that this ordinal can be realized as a maximal order type of a class of generalized trees…
For each countable ordinal $\alpha \ge 2$, the ideals $\mathsf{conv}_\alpha$ were introduced in ``Critical ideals for countable compact spaces'' (to appear in Fund. Math., see also arXiv:2503.12571) to characterize compact countable spaces…
In this paper we give an ordinal analysis of a set theory with $\Pi_{1}$-Collection.
We introduce the notion of a positive opetope and positive opetopic cardinals as certain finite combinatorial structures. The positive opetopic cardinals to positive-to-one polygraphs are like simple graphs to free omega-categories over…
We show relative to strong hypotheses that patterns of compact cardinals in the universe, where a compact cardinal is one which is either strongly compact or supercompact, can be virtually arbitrary. Specifically, we prove if V is a model…