相关论文: A Note on Iterated Consistency and Infinite Proofs
It is widely claimed that the natural axiom systems$\unicode{x2013}$including the large cardinal axioms$\unicode{x2013}$form a well-ordered hierarchy. Yet, as is well-known, it is possible to exhibit non-linearity and ill-foundedness by…
Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an…
This paper aims at reviewing and analysing the method of reflections. The latter is an iterative procedure designed to linear boundary value problems set in multiply connected domains. Being based on a decomposition of the domain boundary,…
In this note, we investigate iterations of consistency, local and uniform reflection over $\mathbf{HA}$ (Heyting Arithmetic). In the case of uniform reflection, we give a new proof of Dragalin's extension of Feferman's completeness theorem…
We give a general overview of ordinal notation systems arising from reflection calculi, and extend the to represent impredicative ordinals up to those representable using Buchholz-style collapsing functions.
In this note let us give two remarks on proof-theory of PA. First a derivability relation is introduced to bound witnesses for provable $\Sigma_{1}$-formulas in PA. Second Paris-Harrington's proof for their independence result is…
The two main approaches to the study of irreducible representations of orders (via traces and Poisson orders) have so far been applied in a completely independent fashion. We define and study a natural compatibility relation between the two…
It is known that several variations of the axiom of determinacy play important roles in the study of reverse mathematics, and the relation between the hierarchy of determinacy and comprehension are revealed by Tanaka, Nemoto, Montalb\'an,…
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 $M$ and $N$ be fixed non-negative integer numbers and let $\pi_N$ be a polynomial of degree $N$. Suppose that $(P_n)_{n\geq0}$ and $(Q_n)_{n\geq0}$ are two orthogonal polynomial sequences such that %their derivatives of orders $k$ and…
We develop a framework for the fifth-order Kadomtsev--Petviashvili equation on $\mathbb{T}_x \times \mathbb{R}_y$ within a mean-zero KP-adapted Sobolev scale. A localized high-order feedback acting on the periodic variable yields a…
Iterated reflection principles have been employed extensively to unfold epistemic commitments that are incurred by accepting a mathematical theory. Recently this has been applied to theories of truth. The idea is to start with a collection…
We streamline treatments of the interpretability orders $\trianglelefteq^*_\kappa$ of Shelah, the key new notion being that of pseudosaturation. Extending work of Malliaris and Shelah, we classify the interpretability orders on the stable…
A new general and unified method of summation, which is both regular and consistent, is invented. It is based on the idea concerning a way of integers reordering. The resulting theory includes a number of explicit and closed form summation…
It has been more than twenty years since Moshe Newman, based on work by Neil Calkin and Herbert Wilf, introduced an explicit bijection between the rational and natural numbers. Interestingly, this bijection is dynamic in nature. Indeed,…
We investigate the relationship between (countable) transfinite iteration and ordinal arithmetic. The nice connection between finite iteration and addition, multiplication, and exponentiation is lost when passing to the transfinite. In this…
The main result of this note, Theorem 2, is the following: a Borel measure on the space of infinite Hermitian matrices, that is invariant under the action of the infinite unitary group and that admits well-defined projections onto the…
We study the question of when a given countable ordinal $\alpha$ is $\Sigma^1_n$- or $\Pi^1_n$-reflecting in models which are neither $\mathsf{PD}$ models nor the constructible universe, focusing on generic extensions of $L$. We prove,…
We introduce a new infinite class of superintegrable quantum systems in the plane. Their Hamiltonians involve reflection operators. The associated Schr\"odinger equations admit separation of variables in polar coordinates and are exactly…
Incremental gradient and incremental proximal methods are a fundamental class of optimization algorithms used for solving finite sum problems, broadly studied in the literature. Yet, without strong convexity, their convergence guarantees…