Wong's comparison theorem for second order linear dynamic equations on time scales

We obtain Wong-type comparison theorems for second order linear dynamic equations on a time scale. The results obtained extend and are motivated by Wong's comparison theorems. As a particular application of our results, we show that the difference equation

     

Complex analysis in subsystems of second order arithmetic

This research is motivated by the program of Reverse Mathematics. We investigate basic part of complex analysis within some weak subsystems of second order arithmetic, in order to determine what kind of set existence axioms are needed to prove theorems of basic analysis. We are especially concerned with Cauchy’s integral theorem. We show that a weak version of Cauchy’s integral theorem is proved in RCAo. Using this, we can prove that holomorphic functions are analytic in RCAo. On the other hand, we show that a full version of Cauchy’s integral theorem cannot be proved in RCAo but is equivalent to weak König’s lemma over RCAo.     

Representability in some systems of second order arithmetic

We answer two questions posed in a recent paper by H. B. Enderton by giving characterizations of the sets of integers weakly and strongly representable in a system of second order arithmetic with an infinity rule of inference. The results generalize to each of a family of such systems. This paper was written while the author held a Science Research Council fellowship.     

Uniqueness theorem for linear elliptic equation of the second order with constant coefficients

The interior uniqueness theorem for analytic functions was generalized by M. B. Balk to the case of polyanalytic functions of order n. He proved that if the zeros of a polyanalytic function have an accumulation point of order n, then this function is identically zero. In this paper the interior uniqueness theorem is generalized to the solution to a linear homogeneous second order differential equation of elliptic type with constant coefficients.     

A generalized extension theorem for linear codes

We prove that an [n, k, d] _q code \({\mathcal{C}}\) with gcd(d, q) = 1 is extendable if \({\sum_{i \not\equiv 0,d}A_i < (q-1)q^{k-2}}\), where A _i denotes the number of codewords of \({\mathcal{C}}\) with weight i. This is a generalization of extension theorems for linear codes by Hill and Lizak (Proceedings of the IEEE International Symposium on Information Theory, Whistler, Canada, 1995) and by Landjev and Rousseva (Probl. Inform. Transm. 42: 319–329, 2006).     

A new extension theorem for linear codes

For an [n,k,d]_q code with k3, gcd(d,q)=1, the diversity of is defined as the pair (Φ₀,Φ₁) with

All the diversities for [n,k,d]_q codes with k3, d−2 (mod q) such that A_i=0 for all i0,−1,−2 (mod q) are found and characterized with their spectra geometrically, which yields that such codes are extendable for all odd q5. Double extendability is also investigated.     

Separations of first and second order theories in bounded arithmetic

We prove that PTC_N(n) (the polynomial time closure of the nonstandard natural number n in the model N of S₂.) cannot be a model of U¹₂. This implies that there exists a first order sentence of bounded arithmetic which is provable in U¹₂ but does not hold in PTC_N(n).     

The limits of determinacy in second order arithmetic: consistency and complexity strength

We prove that determinacy for all Boolean combinations of \({F_{\sigma \delta }}\) (Π ₃ ⁰ ) sets implies the consistency of second-order arithmetic and more. Indeed, it is equivalent to the statement saying that for every set X and every number n, there exists a β-model of Π _n ¹ -comprehension containing X. We prove this result by providing a careful level-by-level analysis of determinacy at the finite level of the difference hierarchy on \({F_{\sigma \delta }}\) (Π ₃ ⁰ ) sets in terms of both reverse mathematics, complexity and consistency strength. We show that, for n ≥ 1, determinacy for sets at the nth level in this difference hierarchy lies strictly between (in the reverse mathematical sense of logical implication) the existence of β-models of Π _n+2 ¹ -comprehension containing any given set X, and the existence of β-models of Δ _n+2 ¹ -comprehension containing any given set X. Thus the nth of these determinacy axioms lies strictly between Π _n+2 ¹ -comprehension and Δ _n+2 ¹ -comprehension in terms of consistency strength. The major new technical result on which these proof theoretic ones are based is a complexity theoretic one. The nth determinacy axiom implies closure under the operation taking a set X to the least Σ _n+1 admissible containing X (for n = 1; this is due to Welch [9]).     

Perfect powers in second order linear recurrences

Let A, B, G₀, G₁ be integers, and G_n = AG_{n ? 1} ? BG_{n ? 2} for n ≥ 2. Let further S be the set of all nonzero integers composed of primes from some fixed finite set. In this paper we shall prove that natural conditions for A, B, G₀ and G₁ imply, that the diophantine equation G_n = wx^q has only finitely many solutions in integers ∥x∥ > 1, q ≥ 2, n and w ∈ S.     

Determinacy of Wadge classes and subsystems of second order arithmetic

In this paper we study the logical strength of the determinacy of infinite binary games in terms of second order arithmetic. We define new determinacy schemata inspired by the Wadge classes of Polish spaces and show the following equivalences over the system RCA₀*, which consists of the axioms of discrete ordered semi‐rings with exponentiation, Δ₁⁰ comprehension and Π₀⁰ induction, and which is known as a weaker system than the popularbase theory RCA₀: 1. Bisep(Δ₁⁰, Σ₁⁰)‐Det* ? WKL₀, (1) 2. Bisep(Δ₁⁰, Σ₂⁰)‐Det* ? ATR₀ + Σ₁¹ induction, (2) 3. Bisep(Σ₁⁰, Σ₂⁰)‐Det* ? Sep(Σ₁⁰, Σ₂⁰)‐Det* ? Π₁¹‐CA₀, (3) 4. Bisep(Δ₂⁰, Σ₂⁰)‐Det* ? Π₁¹‐TR₀, (4) where Det* stands for the determinacy of infinite games in the Cantor space (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)