Related papers: A note on fragments of uniform reflection in secon…
Second order recurrence relations of real numbers arise form various applications in discrete time dynamical systems as well as in the context on Markov chains. Solutions to the recurrence relations are fully defined by the first two…
Certain patterns of symmetry fractionalization in topologically ordered phases of matter are anomalous, in the sense that they can only occur at the surface of a higher dimensional symmetry-protected topological (SPT) state. An important…
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…
The main purpose of this paper is to present a new and more uniform model-theoretic/combinatorial proof of the theorem ([5]): The randomization $T^{R}$ of a complete first-order theory $T$ with $NIP$ is a (complete) first-order continuous…
Let $\mathsf{TT}^1$ be the combinatorial principle stating that every finite coloring of the infinite full binary tree has a homogeneous isomorphic subtree. Let $\mathsf{RT}^2_2$ and $\mathsf{WKL}_0$ denote respectively the principles of…
This paper deals with a proof theory for a theory of $\Pi_{N}$-reflecting ordinals using a system of ordinal diagrams. This is a sequel to the previous one(APAL 129)in which a theory for $\Pi_{3}$-reflection is analysed proof-theoretically.
We show that when certain statements are provable in subsystems of constructive analysis using intuitionistic predicate calculus, related sequential statements are provable in weak classical subsystems. In particular, if a $\Pi^1_2$…
We present a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the predicate calculus as well as a formal induction principle. We introduce recursive systems generating…
Timothy Carlson's patterns of resemblance employ the notion of $\Sigma_1$-elementarity to describe large computable ordinals. It has been conjectured that a relativization of these patterns to dilators leads to an equivalence with…
Let $X = [0,1]$, and let $T:X\to X$ be an expanding piecewise linear map sending each interval of linearity to $[0,1]$. For $\psi:\mathbb N\to\mathbb R_{\geq 0}$, $x\in X$, and $N\in\mathbb N$ we consider the recurrence counting function \[…
Simpson and the second author asked whether there exists a characterization of the natural numbers by a second-order sentence which is provably categorical in the theory RCA$^*_0$. We answer in the negative, showing that for any…
The biharmonic equation arises in areas of continuum mechanics including linear elasticity theory and the Stokes flows, as well as in a radar imaging problem. We discuss the reflection formulas for the biharmonic functions…
Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…
We introduce and consider the inner-model reflection principle, which asserts that whenever a statement $\varphi(a)$ in the first-order language of set theory is true in the set-theoretic universe $V$, then it is also true in a proper inner…
Historically, spectroscopic techniques have been essential for studying the optical properties of thin solid films. However, existing formulae for both normal transmission and reflection spectroscopy often rely on simplified theoretical…
Using the reflection formula of the Gamma function, we derive a new formula for the Taylor coefficients of the reciprocal Gamma function. The new formula provides effective asymptotic values for the coefficients even for very small values…
Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this…
In this work, we demonstrate the application of a first-order Taylor expansion to approximate a generic function $F: R^{n \times m} \to R^{n \times m}$ and utilize it in language modeling. To enhance the basic Taylor expansion, we introduce…
By using the theory of first-order differential subordination for functions with fixed initial coefficient, several well-known results for subclasses of univalent functions are improved by restricting the functions to have fixed second…
The first-order theory of addition over the natural numbers, known as Presburger arithmetic, is decidable in double exponential time. Adding an uninterpreted unary predicate to the language leads to an undecidable theory. We sharpen the…