Related papers: Pi^0_1 ordinal analysis beyond first order arithme…
Differential-elimination algorithms apply a finite number of differentiations and eliminations to systems of partial differential equations. For systems that are polynomially nonlinear with rational number coefficients, they guarantee the…
S. Orlik and M. Strauch have studied locally analytic principal series representation for general $p$-adic reductive groups generalizing an earlier work of P. Schneider for $GL(2)$ and related the condition of irreducibility of such locally…
We consider some natural generalizations to the class of all GLP-algebras of the so-called reduction property for reflection algebras in arithmetic. An analogue of this property is established for the free GLP-algebras and for some…
I shall argue that a resolution of the PvNP problem requires building an iff bridge between the domain of provability and that of computability. The former concerns how a human intelligence decides the truth of number-theoretic relations,…
We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…
We conclude from Goedel's Theorem VII of his seminal 1931 paper that every recursive function f(x_{1}, x_{2}) is representable in the first-order Peano Arithmetic PA by a formula [F(x_{1}, x_{2}, x_{3})] which is algorithmically verifiable,…
We provide mutual elementary recursive order isomorphisms between classical ordinal notations, based on Skolem hulling, and notations from pure elementary patterns of resemblance of order $2$, showing that the latter characterize the…
This paper presents a formal theory of Krivine's classical realisability interpretation for first-order Peano arithmetic ($\mathsf{PA}$). To formulate the theory as an extension of $\mathsf{PA}$, we first modify Krivine's original…
In functional data analysis, replicate observations of a smooth functional process and its derivatives offer a unique opportunity to flexibly estimate continuous-time ordinary differential equation models. Ramsay (1996) first proposed to…
An adaptive regularization algorithm using high-order models is proposed for partially separable convexly constrained nonlinear optimization problems whose objective function contains non-Lipschitzian $\ell_q$-norm regularization terms for…
This article discusses completeness of Boolean Algebra as First Order Theory in Goedel's meaning. If Theory is complete then any possible transformation is equivalent to some transformation using axioms, predicates etc. defined for this…
Complexity and decidability of logics is a major research area involving a huge range of different logical systems. This calls for a unified and systematic approach for the field. We introduce a research program based on an algebraic…
This work revisits operator learning from a spectral perspective by introducing Polar Linear Algebra, a structured framework based on polar geometry that combines a linear radial component with a periodic angular component. Starting from…
Classical theory proves that every primitive recursive function is strongly representable in PA; that formal Peano Arithmetic, PA, and formal primitive recursive arithmetic, PRA, can both be interpreted in Zermelo-Fraenkel Set Theory, ZF;…
In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…
We study combinatorial principles we call Homogeneity Principle HP(\kappa) and Injectivity Principle IP(\kappa,\lambda) for regular \kappa>\aleph_1 and \lambda\leq\kappa which are formulated in terms of coloring the ordinals <\kappa by…
Formal theories of arithmetic have traditionally been based on either classical or intuitionistic logic, leading to the development of Peano and Heyting arithmetic, respectively. We propose to use $\mu$MALL as a formal theory of arithmetic…
Rakhmanov's theorem for orthogonal polynomials on the unit circle gives a sufficient condition on the orthogonality measure for orthogonal polynomials on the unit circle, in order that the reflection coefficients (the recurrence…
This article is concerned with classifying the provably total set-functions of Kripke-Platek set theory, KP, and Power Kripke-Platek set theory, KP(P), as well as proving several (partial) conservativity results. The main technical tool…
Fuchino-Maschio-Sakai~\cite{FuchinoEtAl_DRP_LST} proved that the L\"owenheim-Skolem-Tarski (LST) property of Stationary Logic is equivalent to the Diagonal Reflection Principle on internally club sets ($\text{DRP}_{\text{IC}}$) introduced…