Related papers: Axiom Beta Implies Elementary Transfinite Recursio…

We consider perturbation of a conformal field theory by a pair of relevant logarithmic operators and calculate the beta function up to two loops. We observe that the beta function can not be derived from a potential. Thus the…

Let $\Delta$ be a finite set of nonzero linear forms in several variables with coefficients in a field $\mathbf K$ of characteristic zero. Consider the $\mathbf K$-algebra $C(\Delta)$ of rational functions generated by $\{1/\alpha \mid…

We study the first-order consequences of Ramsey's Theorem for $k$-colourings of $n$-tuples, for fixed $n, k \ge 2$, over the relatively weak second-order arithmetic theory $\mathrm{RCA}^*_0$. Using the Chong-Mourad coding lemma, we show…

This dissertation is a contribution to the project of second-order set theory, which has seen a revival in recent years. The approach is to understand second-order set theory by studying the structure of models of second-order set theories.…

We define weak units in a semi-monoidal 2-category $\CC$ as cancellable pseudo-idempotents: they are pairs $(I,\alpha)$ where $I$ is an object such that tensoring with $I$ from either side constitutes a biequivalence of $\CC$, and $\alpha:…

Let $\{C_{\alpha}\}_{\alpha\in \Omega}$ be a family of closed and convex sets in a Hilbert space $H$, having a nonempty intersection $C$. We consider a sequence $\{x_n\}$ of remote projections onto them. This means, $x_0\in H$, and…

We define a family of three related reducibilities, $\leq_T$, $\leq_{tt}$ and $\leq_m$, for arbitrary functions $f,g:X\rightarrow\mathbb R$, where $X$ is a compact separable metric space. The $\equiv_T$-equivalence classes mostly coincide…

Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some…

The aim of this thesis is to give a concise introduction to homotopy type theory, to Aczel's constructive set theory and to simplicial sets and their homotopy theory in particular referring to their standard model structure, showing some of…

This investigation explores using the beta function formalism to calculate analytic solutions for the observable parameters in rolling scalar field cosmologies. The beta function in this case is the derivative of the scalar $\phi$ with…

Motivated by a question of L. Robert, asking whether $\rm L(T(A)) = Lsc_{C}(T(A))$ for any separable C*-algebra A, we introduce and initiate the study of \emph{tracially reflexive C*-algebras}. We first prove that commutative C*-algebras…

The partition function of the random energy model at inverse temperature $\beta$ is a sum of random exponentials $Z_N(\beta)=\sum_{k=1}^N \exp(\beta \sqrt{n} X_k)$, where $X_1,X_2,...$ are independent real standard normal random variables…

Classical set theory constructs the continuum via the power set P(N), thereby postulating an uncountable totality. However, constructive and computability-based approaches reveal that no formal system with countable syntax can generate all…

The Erd\H{o}s-Moser theorem $(\mathsf{EM})$ says that every infinite tournament admits an infinite transitive subtournament. We study the computational behavior of the Erd\H{o}s-Moser theorem with respect to the arithmetic hierarchy, and…

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

We derive a new sufficient condition for the existence of {\omega}-categorical universal structures in classes of relational structures with constraints, augmenting results by Cherlin, Shelah, Chi, and Hubi\v{c}ka and Ne\v{s}et\v{r}il.…

Since the axioms in (Consi-CoS) are not recursively enumerable, NACT* is no axiom system in the classical sense . Therefore we construct a series of partial systems which form a recursive axiom system too. Starting with the "dichotomic"…

We develop the concept of weak tracial Rokhlin property for finite group actions on simple (not necessarily unital) C*-algebras and study its properties systematically. In particular, we show that this property is stable under restriction…

Set theory is widely believed to provide a secure foundation for deductive mathematics, but current set theories do not quite do this. The mainstream essentially uses na\"\i ve set theory. After Russell's paradox showed this to be…

Given a first-order theory $T$ formulated in the usual language of first-order arithmetic, we say that $T$ is of *restricted complexity* if there is some natural number $n$ and some set $\mathcal A$ of $\Sigma_n$-sentences such that $T$ can…