Related papers: Brown's lemma in second-order arithmetic
We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of…
The substitution lemma is a renowned theorem within the realm of lambda-calculus theory and concerns the interactional behaviour of the metasubstitution operation. In this work, we augment the lambda-calculus's grammar with an uninterpreted…
We prove that the sequent calculus $\mathsf{L_{RBL}}$ for residuated basic logic $\mathsf{RBL}$ has strong finite model property, and that intuitionistic logic can be embedded into basic propositional logic $\mathsf{BPL}$. Thus…
Strictly positive logics recently attracted attention both in the description logic and in the provability logic communities for their combination of efficiency and sufficient expressivity. The language of Reflection Calculus RC consists of…
A theory T is tight if different deductively closed extensions of T (in the same language) cannot be bi-interpretable. Many well-studied foundational theories are tight, including PA [Visser2006], ZF, Z2, and KM [enayat2017]. In this…
We introduce a class of iterated processes called $\alpha$-time Brownian motion for $0<\alpha \leq 2$. These are obtained by taking Brownian motion and replacing the time parameter with a symmetric $\alpha$-stable process. We prove a…
We show that the theory $\mathsf{WKL}^*_0+\mathsf{CAC}$ is polynomially simulated by $\mathsf{RCA}_0^*$ with respect to $\forall\Pi^0_3$ formulas. For the proof, we use the method of forcing interpretations and syntactically simulate a…
We reevaluate the claim that predicative reasoning (given the natural numbers) is limited by the Feferman-Schutte ordinal Gamma_0. First we comprehensively criticize the arguments that have been offered in support of this position. Then we…
A binary relation on graphs is recursively enumerable if and only if it can be computed by a formula in monadic second-order logic. The latter means that the formula defines a set of graphs, in the usual way, such that each "computation…
We show that Morley's theorem on the number of countable models of a countable first-order theory becomes an undecidable statement when extended to second-order logic. More generally, we calculate the number of equivalence classes of…
We study the finite satisfiability problem for the two-variable fragment of first-order logic extended with counting quantifiers (C2) and interpreted over linearly ordered structures. We show that the problem is undecidable in the case of…
We prove that $\RCA + \RRT^3_2 \not\vdash \ACA$ where $\RRT^3_2$ is the Rainbow Ramsey Theorem for 2-bounded colorings of triples. This reverse mathematical result is based on a cone avoidance theorem, that every 2-bounded coloring of pairs…
In this paper we investigate the class of grey Brownian motions $B_{\alpha,\beta}$ ($0<\alpha<2$, $0<\beta\leq1$). We show that grey Brownian motion admits different representations in terms of certain known processes, such as fractional…
For a given intuitionistic propositional formula A and a propositional variable x occurring in it, define the infinite sequence of formulae { A \_i | i$\ge$1} by letting A\_1 be A and A\_{i+1} be A(A\_i/x). Ruitenburg's Theorem [8] says…
We consider a randomised version of Kleene's realisability interpretation of intuitionistic arithmetic in which computability is replaced with randomised computability with positive probability. In particular, we show that (i) the set of…
The logarithmic correction for the order of the maximum for two-speed branching Brownian motion changes discontinuously when approaching slopes $\sigma_1^2=\sigma_2^2=1$ which corresponds to standard branching Brownian motion. In this…
An irreducible canonical approach to second-class constraints reducible of an arbitrary order is given. This method generalizes our previous results from [Europhys. Lett. 50 (2000) 169, J. Phys. A: Math. Theor. 40 (2007) 14537] for first-…
For most purposes, one can replace the use of Rolle's theorem and the mean value theorem, which are not constructively valid, by the law of bounded change. The proof of two basic results in numerical analysis, the error term for Lagrange…
We prove the arithmetic fundamental lemma conjecture over a general $p$-adic field with odd residue cardinality $q\geq \dim V$. Our strategy is similar to the one used by the second author during his proof of the AFL over $\mathbb{Q}_p$…
We establish the decidability of the $\Sigma_2$ theory of both the arithmetic and hyperarithmetic degrees in the language of uppersemilattices i.e. the language with $\leq, 0$ and $\sqcup$. This is achieved by using Kumabe-Slaman forcing -…