Minimal ‐crystals and isomorphism numbers of isosimple ‐crystals

In this paper we generalize minimal p‐divisible groups defined by Oort to minimal F‐crystals over algebraically closed fields of positive characteristic. We prove a structural theorem of minimal F‐crystals and give an explicit formula of the Frobenius endomorphism of the basic minimal F‐crystals that are the building blocks of the general minimal F‐crystals. We then use minimal F‐crystals to generalize minimal heights of p‐divisible groups and give an upper bound of the isomorphism numbers of F‐crystals, whose isogeny type are determined by simple F‐isocrystals, in terms of their ranks, Hodge slopes and Newton slopes.     

Bernays-Gödel type theory

We study the type-theoretical analogue of Bernays-Gödel set-theory and its models in categories. We introduce the notion of small structure on a category, and if small structure satisfies certain axioms we can think of the underlying category as a category of classes. Our axioms imply the existence of a co-variant powerset monad on the underlying category of classes, which sends a class to the class of its small subclasses. Simple fixed points of this and related monads are shown to be models of intuitionistic Zermelo-Fraenkel set-theory (IZF).     

On quasi‐varieties of multiple valued logic models

We extend the concept of quasi‐variety of first‐order models from classical logic to multiple valued logic (MVL) and study the relationship between quasi‐varieties and existence of initial models in MVL. We define a concept of ‘Horn sentence’ in MVL and based upon our study of quasi‐varieties of MVL models we derive the existence of initial models for MVL ‘Horn theories’. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Non‐elementary speed‐ups in logic calculi

In this paper we show some non‐elementary speed‐ups in logic calculi: Both a predicative second‐order logic and a logic for fixed points of positive formulas are shown to have non‐elementary speed‐ups over first‐order logic. Also it is shown that eliminating second‐order cut formulas in second‐order logic has to increase sizes of proofs super‐exponentially, and the same in eliminating second‐order epsilon axioms. These are proved by relying on results due to P. Pudlák. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

High‐order characteristic‐tracking strategy for simulation of a nonlinear advection–diffusion equation

In this study, new high‐order backward semi‐Lagrangian methods are developed to solve nonlinear advection–diffusion type problems, which are realized using high‐order characteristic‐tracking strategies. The proposed characteristic‐tracking strategies are second‐order L‐stable and third‐order L(α)‐stable methods, which are based on a classical implicit multistep method combined with a error‐correction method. We also use backward differentiation formulas and the fourth‐order finite‐difference scheme for diffusion problem discretization in the temporal and spatial domains, respectively. To demonstrate the adaptability and efficiency of these time‐discretization strategies, we apply these methods to nonlinear advection–diffusion type problems such as the viscous Burgers' equation. Through simulations, not only the temporal and spatial accuracies are numerically evaluated but also the proposed methods are shown to be superior to the compared existing characteristic‐tracking methods under the same rates of convergence in terms of accuracy and efficiency. Finally, we have shown that the proposed method well preserves the energy and mass when the viscosity coefficient becomes zero.     

Asymptotic formulas for generalized Baskakov‐Durrmeyer operators

The paper deals with general Baskakov‐Durrmeyer operators containing several previous definitions as special cases. We construct a new sequence of BaskakovDurrmeyer operators depending on a parameter γ. We present a quantitative Voronovskaya type theorem in terms of weighted modulus of smoothness using sixth‐order central moment. In addition, we studied Grü ss‐type Voronovskaya theorem. All results in this work show that our new operators are flexible and sensitive to the rate of convergence to f, depending on our selection of γ(x).     

On some notions of convergence for n‐tuples of operators

The aim of this paper is to show that we can extend the notion of convergence in the norm‐resolvent sense to the case of several unbounded noncommuting operators (and to quaternionic operators as a particular case) using the notion of S‐resolvent operator. With this notion, we can define bounded functions of unbounded operators using the S‐functional calculus for n‐tuples of noncommuting operators. The same notion can be extended to the case of the F‐resolvent operator, which is the basis of the F‐functional calculus, a monogenic functional calculus for n‐tuples of commuting operators. We also prove some properties of the F‐functional calculus, which are of independent interest. Copyright © 2013 John Wiley & Sons, Ltd.     

A feasible theory of truth over combinatory algebra

We define an applicative theory of truth _TPT${\mathsf{T}}_{\mathsf{PT}}$ which proves totality exactly for the polynomial time computable functions. _TPT${\mathsf{T}}_{\mathsf{PT}}$ has natural and simple axioms since nearly all its truth axioms are standard for truth theories over an applicative framework. The only exception is the axiom dealing with the word predicate. The truth predicate can only reflect elementhood in the words for terms that have smaller length than a given word. This makes it possible to achieve the very low proof-theoretic strength. Truth induction can be allowed without any constraints. For these reasons the system _TPT${\mathsf{T}}_{\mathsf{PT}}$ has the high expressive power one expects from truth theories. It allows embeddings of feasible systems of explicit mathematics and bounded arithmetic.     

Proof-theoretic conservations of weak weak intuitionistic constructive set theories

The paper aims to provide precise proof theoretic characterizations of Myhill–Friedman-style “weak” constructive extensional set theories and Aczel–Rathjen analogous constructive set theories both enriched by Mostowski-style collapsing axioms and/or related anti-foundation axioms. The main results include full intuitionistic conservations over the corresponding purely arithmetical formalisms that are well known in the reverse mathematics – which strengthens analogous results obtained by the author in the 80s. The present research was inspired by the more recent Sato-style “weak weak” classical extensional set theories whose proof theoretic strengths are shown to strongly exceed the ones of the intuitionistic counterparts in the presence of the collapsing axioms.     

‐differential equations for ‐classical polynomials and ‐Jacobi–Stirling numbers

We introduce, characterise and provide a combinatorial interpretation for the so‐called q‐Jacobi–Stirling numbers. This study is motivated by their key role in the (reciprocal) expansion of any power of a second order q‐differential operator having the q‐classical polynomials as eigenfunctions in terms of other even order operators, which we explicitly construct in this work. The results here obtained can be viewed as the q‐version of those given by Everitt et al. and by the first author, whilst the combinatorics of this new set of numbers is a q‐version of the Jacobi–Stirling numbers given by Gelineau and the second author.     

Herbrand's theorem and term induction

We study the formal first order system TIND in the standard language of Gentzen's LK . TIND extends LK by the purely logical rule of term-induction, that is a restricted induction principle, deriving numerals instead of arbitrary terms. This rule may be conceived as the logical image of full induction.     

Consistency proof via pointwise induction

We show that the consistency of the first order arithmetic follows from the pointwise induction up to the Howard ordinal. Our proof differs from U. Schmerl [Sc]: We do not need Girard's Hierarchy Comparison Theorem. A modification on the ordinal assignment to proofs by Gentzen and Takeuti [T] is made so that one step reduction on proofs exactly corresponds to the stepping down in ordinals. Also a generalization to theories of finitely iterated inductive definitions is proved. Received May 30, 1996     

Constructing regular self‐complementary uniform hypergraphs

In this article, we examine the possible orders of t‐subset‐regular self‐complementary k‐uniform hypergraphs, which form examples of large sets of two isomorphic t‐designs. We reformulate Khosrovshahi and Tayfeh–Rezaie's necessary conditions on the order of these structures in terms of the binary representation of the rank k, and these conditions simplify to a more transparent relation between the order n and rank k in the case where k is a sum of consecutive powers of 2. Moreover, we present new constructions for 1‐subset‐regular self‐complementary uniform hypergraphs, and prove that these necessary conditions are sufficient for all k, in the case where t = 1. © 2011 Wiley Periodicals, Inc. J Combin Designs 19: 439‐454, 2011     

On κ‐hereditary Sets and Consequences of the Axiom of Choice

We will prove that some so‐called union theorems (see [2]) are equivalent in ZF⁰ to statements about the transitive closure of relations. The special case of “bounded” union theorems dealing with κ‐hereditary sets yields equivalents to statements about the transitive closure of κ‐narrow relations. The instance κ = ω₁ (i. e., hereditarily countable sets) yields an equivalent to Howard‐Rubin's Form 172 (the transitive closure Tc(x) of every hereditarily countable set x is countable). In particular, the countable union theorem (Howard‐Rubin's Form 31) and, a fortiori, the axiom of countable choice imply Form 172.     

Stability and convergence of the mark and cell finite difference scheme for Darcy‐Stokes‐Brinkman equations on non‐uniform grids

In this paper, we consider the mark and cell (MAC) method for Darcy‐Stokes‐Brinkman equations and analyze the stability and convergence of the method on nonuniform grids. Firstly, to obtain the stability for both velocity and pressure, we establish the discrete inf‐sup condition. Then we introduce an auxiliary function depending on the velocity and discretizing parameters to analyze the super‐convergence. Finally, we obtain the second‐order convergence in L2 norm for both velocity and pressure for the MAC scheme, when the perturbation parameter ? is not approaching 0. We also obtain the second‐order convergence for some terms of ∥·∥_? norm of the velocity, and the other terms of ∥·∥_? norm are second‐order convergence on uniform grid. Numerical experiments are carried out to verify the theoretical results.     

Groups,group actions and fields definable in first‐order topological structures

Given a group (G, ·), G?M^m, definable in a first‐order structure $\mathcal {M}=(M,\ldots )Given a group (G, ·), G?M^m, definable in a first‐order structure $\mathcal {M}=(M,\ldots )$ equipped with a dimension function and a topology satisfying certain natural conditions, we find a large open definable subset V?G and define a new topology τ on G with which (G, ·) becomes a topological group. Moreover, τ restricted to V coincides with the topology of V inherited from M^m. Likewise we topologize transitive group actions and fields definable in $\mathcal {M}$. These results require a series of preparatory facts concerning dimension functions, some of which might be of independent interest.     

A note on parameter free Π1‐induction and restricted exponentiation

We characterize the sets of all Π₂ and all $\mathcal {B}(\Sigma _{1})We characterize the sets of all Π₂ and all $\mathcal {B}(\Sigma _{1})$ (= Boolean combinations of Σ₁) theorems of IΠ^?₁ in terms of restricted exponentiation, and use these characterizations to prove that both sets are not deductively equivalent. We also discuss how these results generalize to n > 0. As an application, we prove that a conservation theorem of Beklemishev stating that IΠ^?_{n + 1} is conservative over IΣ^?_n with respect to $\mathcal {B}(\Sigma _{n+1})$ sentences cannot be extended to Π_{n + 2} sentences. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

q‐Voronovskaya type theorems for q‐Baskakov operators

In the present paper, we prove quantitative q‐Voronovskaya type theorems for q‐Baskakov operators in terms of weighted modulus of continuity. We also present a new form of Voronovskaya theorem, that is, q‐Grüss‐Voronovskaya type theorem for q‐Baskakov operators in quantitative mean. Hence, we describe the rate of convergence and upper bound for the error of approximation, simultaneously. Our results are valid for the subspace of continuous functions although classical ones is valid for differentiable functions. Copyright © 2015 John Wiley & Sons, Ltd.     

On semi‐classical d‐orthogonal polynomials

In this paper a general theory of semi‐classical d‐orthogonal polynomials is developed. We define the semi‐classical linear functionals by means of a distributional equation , where Φ and Ψ are matrix polynomials. Several characterizations for these semi‐classical functionals are given in terms of the corresponding d‐orthogonal polynomials sequence. They involve a quasi‐orthogonality property for their derivatives and some finite‐type relations.