Related papers: Brown's lemma in second-order arithmetic

Adding modular predicates yields a generalization of first-order logic FO over words. The expressive power of FO[<,MOD] with order comparison $x<y$ and predicates for $x \equiv i \mod n$ has been investigated by Barrington, Compton,…

We show that for any finite-dimensional algebra $\Lambda$ of infinite representation type, over a perfect field, there is a bounded principal ideal domain $\Gamma$ and a representation embedding from $\Gamma -$mod into $\Lambda -$mod. As an…

The Bank-Laine conjecture concerning the oscillation of solutions of second order homogeneous linear differential equations has recently been disproved by Bergweiler and Eremenko. It is shown here, however, that the conjecture is true if…

In this paper we give simple proofs for the bounds (some of them sharp) of the difference of the moduli of the second and the first logarithmic coefficient for the general class of univalent functions and for the class of convex univalent…

Delimited control operator shift0 exhibits versatile capabilities: it can express layered monadic effects, or equivalently, algebraic effects. Little did we know it can express lambda calculus too! We present $ \Lambda_\$ $, a call-by-value…

Let $X$ be a unit interval or a unit circle and let $B$ be a $\sigma_p$-unital, purely infinite, simple $C\sp*$-algebra such that its multiplier algebra $M(B)$ has real rank zero. Then we determine necessary and sufficient conditions for a…

We give a~detailed construction of the complete ordered field of real numbers by means of infinite decimal expansions. We prove that in the canonical encoding of decimals neither addition nor multiplication is {\em computable}, but that…

We consider here a problem of finding the sharp estimate for the boundedness of an arbitrary Calder\'on-Zygmund operator in $L^2(w)$, $w\in A_2$. We first prove that for $A_2$ weight $w$ one has that the norm a Calderon--Zygmund operator…

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

In a functional calculus, the so called \Omega-rule states that if two terms P and Q applied to any closed term <i>N</i> return the same value (i.e. PN = QN), then they are equal (i.e. P = Q holds). As it is well known, in the…

We give a computational interpretation to an abstract instance of Zorn's lemma formulated as a wellfoundedness principle in the language of arithmetic in all finite types. This is achieved through G\"odel's functional interpretation, and…

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…

We explore the relation between various versions of Ramsey theorem and bounding schemes in model ${N}$ of a fragment of arithmetic $F$. Our goal is to recast, in a different framework, and extend some results of Hirst \cite{Hirst-1987}, see…

We introduce a proof system for Hajek's logic BL based on a relational hypersequents framework. We prove that the rules of our logical calculus, called RHBL, are sound and invertible with respect to any valuation of BL into a suitable…

We prove the Zabreiko's lemma in 2-Banach spaces. As an application we shall prove a version of the closed graph theorem and open mapping theorem.

Let A be a Banach algebra, and let a; b; c 2 A satisfying a(ba)^2 = abaca = acaba = (ac)^2a: We prove that 1 - ba\in A^d if and only if 1 - ac \in A^d. In this case, (1-ac)^d =1-a(1-ba)^{\pi}(1-\alpha(1+ba))^{-1}bac (1+ac)+a((1-ba)^d)bac.…

We prove undecidability and pinpoint the place in the arithmetical hierarchy for commutative action logic, that is, the equational theory of commutative residuated Kleene lattices (action lattices), and infinitary commutative action logic,…

While teaching untyped $\lambda$-calculus to undergraduate students, we were wondering why $\alpha$-equivalence is not directly inductively defined. In this paper, we demonstrate that this is indeed feasible. Specifically, we provide a…

We address the problem of complementing higher-order patterns without repetitions of existential variables. Differently from the first-order case, the complement of a pattern cannot, in general, be described by a pattern, or even by a…

In his book, John Stillwell wrote "finding the exact strength of the Brouwer invariance theorems seems to me one of the most interesting open problems in reverse mathematics." In this article, we solve Stillwell's problem by showing that…