On Interstices of Countable Arithmetically Saturated Models of Peano Arithmetic

We give some information about the action of Aut(M) on M(0), where M is a countable arithmetically saturated model of Peano Arithmetic. We concentrate on analogues of moving gaps and covering gaps inside M(0).     

Nonstandard models that are definable in models of Peano Arithmetic

In this paper, we investigate definable models of Peano Arithmetic PA in a model of PA. For any definable model N without parameters in a model M, we show that N is isomorphic to M if M is elementary extension of the standard model and N is elementarily equivalent to M. On the other hand, we show that there is a model M and a definable model N with parameters in M such that N is elementarily equivalent to M but N is not isomorphic to M. We also show that there is a model M and a definable model N with parameters in M such that N is elementarily equivalent to M, and N is isomorphic to M, but N is not definably isomorphic to M. And also, we give a generalization of Tennenbaum's theorem. At the end, we give a new method to construct a definable model by a refinement of Kotlarski's method. (© 2007 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

Automorphisms of Models of True Arithmetic: More on Subgroups which Extend to a Maximal One Uniquely

Continuing the earlier research in [14] we give some more information about nonmaximal open subgroups of G = Aut(ℳ) with unique maximal extension, where ℳ is a countable recursively saturated model of True Arithmetic.     

The Recursively Mahlo Property in Second Order Arithmetic

The paper characterizes the second order arithmetic theorems of a set theory that features a recursively Mahlo universe; thereby complementing prior proof-theoretic investigations on this notion. It is shown that the property of being recursively Mahlo corresponds to a certain kind of β-model reflection in second order arithmetic. Further, this leads to a characterization of the reals recursively computable in the superjump functional. Mathematics Subject Classification: 03F35, 03F15, 03E70.     

Automorphisms of Models of True Arithmetic: Subgroups which Extend to a Maximal Subgroup Uniquely

We show that if M is a countable recursively saturated model of True Arithmetic, then G = Aut(M) has nonmaximal open subgroups with unique extension to a maximal subgroup of Aut(M). Mathematics Subject Classification: 03C62, 03C50.     

On Σ1-definable Functions Provably Total in I ∏

We prove the following theorem: Let φ(x) be a formula in the language of the theory PA^? of discretely ordered commutative rings with unit of the form ?yφ′(x,y) with φ′ and let ∈ Δ₀ and let fφ: ? → ? such that f_φ(x) = y iff φ′(x,y) & (?z < y) φ′(x,z). If I ∏ ∈(?x ≥ 0), φ then there exists a natural number K such that I ∏ ? ?y?x(x > y ? ?φ(x) < x^K). Here I ∏₁^? denotes the theory PA^? plus the scheme of induction for formulas φ(x) of the form ?yφ′(x,y) (with φ′) with φ′ ∈ Δ₀.     

The wi‐club filter on 𝒫κ λ

We develop the theory of C_{κ, λ}ⁱ, a strongly normal filter over ??_κ λ for Mahlo κ. We prove a minimality result, showing that any strongly normal filter containing {x ∈ ??_κ λ: |x | = |x ∩ κ | and |x | is inaccessible} also contains C_{κ, λ}ⁱ. We also show that functions can be used to obtain a basis for C_{κ, λ}ⁱ (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Admissible perturbations of α‐ψ‐pseudocontractive operators: convergence theorems

We prove some convergence theorems for α‐ψ‐pseudocontractive operators in real Hilbert spaces, by using the concept of admissible perturbation. Our results extend and complement some theorems in the existing literature. Copyright © 2016 John Wiley & Sons, Ltd.     

Time decay rate for two 3D magnetohydrodynamics‐ α models

We consider the long time behavior of solutions to the magnetohydrodynamics‐ α model in three spatial dimensions. Time decay rate in L²‐norm of the solution is obtained. Similar results for a generalized Leray‐ α‐magnetohydrodynamics model are also established. As a by‐product, an optimal time decay rate for the Navier–Stokes‐ α model is achieved. Copyright © 2013 John Wiley & Sons, Ltd.     

All λ‐Designs with Small λ are Type‐1

A λ‐design is a family of subsets of such that for all and not all are of the same size. Ryser's and Woodall's λ‐design conjecture states that each λ‐design can be obtained from a symmetric block design by a certain complementation procedure. Our main result is that the conjecture is true when λ < 63. © 2012 Wiley Periodicals, Inc. J. Combin. Designs 20: 408–431, 2012     

Minimal extensions of Π01 classes

A minimal extension of a Π⁰₁ class P is a Π⁰₁ class Q such that P ? Q, Q – P is infinite, and for any Π⁰₁ class R, if P ? R ? Q, then either R – P is finite or Q – R is finite; Q is a nontrivial minimal extension of P if in addition P and Q′ have the same Cantor‐Bendixson derivative. We show that for any class P which has a single limit point A, and that point of degree ≤ 0 , P admits a nontrivial minimal extension. We also show that as long as P is infinite, then P does not admit any decidable nontrivial minimal extension Q. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Weak -property in Σ-products

It is shown that each Σ-product of paracompact p-spaces has the weak -property.     

Holomorphic liftings and Bergman kernel estimates for 𝒟ℱ𝒩‐domains

Let E be a 𝒟ℱ𝒩‐space and let U ⊂ E be open. By applying the nuclearity of the Fréchet space ℋ︁(U) of holomorphic functions on U we show that there are finite measures μ on U leading to Bergman spaces of μ ‐square integrable holomorphic functions. We give an explicit construction for μ by using infinite dimensional Gaussian measures. Moreover, we prove boundary estimates for the corresponding Bergman kernels K_μ on the diagonal and we give an application of our results to liftings of μ ‐square integrable Banach space valued holomorphic functions over U. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Exceptions and characterization results for type‐1 λ‐designs

Let $X$ be a finite set with $v$ elements, called points and $\beta$ be a family of subsets of $X$, called blocks. A pair $\left(X,\beta \right)$ is called $\lambda$‐design whenever $\mid \beta \mid =\mid X\mid$ and

• 1. for all $B_i,B_j\in \beta ,i\ne j,\mid B_i\cap B_j\mid =\lambda$;
• 2. for all $B_j\in \beta ,\mid B_j\mid =k_j>\lambda$, and not all $k_j$ are equal.

The only known examples of $\lambda$‐designs are so‐called type‐1 designs, which are obtained from symmetric designs by a certain complementation procedure. Ryser and Woodall had independently conjectured that all $\lambda$‐designs are type‐1. Let $r,r^{*}?(r>r^{*})$ be replication numbers of a $\lambda$‐design $D=\left(X,\beta \right)$ and $g=\text{gcd}\left(r?1,r^{*}?1\right),m=\text{gcd}\left(\left(r?r^{*}\right)∕g,\lambda \right)$, and $m\prime =m$, if $m$ is odd and $m\prime =m∕2$, otherwise. For distinct points $x$ and $y$ of $D$, let $\lambda \left(x,y\right)$ denote the number of blocks of $X$ containing $x$ and $y$. We strengthen a lemma of S.S. Shrikhande and N.M. Singhi and use it to prove that if $\frac{r\left(r?1\right)}{\left(v?1\right)}?\frac{k\left(r?r^{*}\right)}{m\prime \left(v?1\right)}$ are not integers for $k=1,2,\text{…},m\prime ?1$, then $D$ is type‐1. As an application of these results, we show that for fixed positive integer $\theta$ there are finitely many nontype‐1 $\lambda$‐designs with $r=r^{*}+\theta$. If $r?r^{*}=27$ or $r?r^{*}=4p$ and $r^{*}\ne {\left(p?1\right)}^2$, or $v=7p+1$ such that $p?1,13\left(\mathrm{mod}21\right)$ and $p?4,9,19,24\left(\mathrm{mod}35\right)$, where $p$ is a positive prime, then $D$ is type‐1. We further obtain several inequalities involving $\lambda (x,y)$, where equality holds if and only if D is type‐1.     

Some Results on LΔ

We study the quantifier complexity and the relative strength of some fragments of arithmetic axiomatized by induction and minimization schemes for Δ_n+1 formulas.     

The spectrum of BSA(v, 3, λ; α) with α = 2,3

In this article, a kind of auxiliary design BSA^* for constructing BSAs is introduced and studied. Two powerful recursive constructions on BSAs from 3‐IGDDs and BSA^*s are exploited. Finally, the necessary and sufficient conditions for the existence of a BSA(v, 3, λ; α) with α = 2, 3 are established. © 2006 Wiley Periodicals, Inc. J Combin Designs 15: 61–76, 2007