A note on Grzegorczyk's logic

Grzegorczyk's modal logic (Grz) corresponds to the class of upwards well‐founded partially ordered Kripke frames, however all known proofs of this fact utilize some form of the Axiom of Choice; G. Boolos asked in [1], whether it is provable in plain ZF. We answer his question negatively: Grz corresponds (in ZF) to a class of frames, which does not provably coincide with upwards well‐founded posets in ZF alone. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Plain Bases for Classes of Primitive Recursive Functions

Abasisforaset C of functions on natural numbers is a set F of functions such that C is the closure with respect to substitution of the projection functions and the functions in F. This paper introduces three new bases, comprehending only common functions, for the Grzegorczyk classes ℰⁿ with n ≥ 3. Such results are then applied in order to show that ℰⁿ⁺¹ = K_n for n ≥ 2, where {K_n}_n∈ℕ is the Axt hierarchy.     

Recursive Structures and Ershov's Hierarchy

Ash and Nerode [2] gave natural definability conditions under which a relation is intrinsically r. e. Here we generalize this to arbitrary levels in Ershov's hierarchy of Δ sets, giving conditions under which a relation is intrinsically α-r. e. Mathematics Subject Classification: 03C57, 03D55.     

An Analog Characterization of the Grzegorczyk Hierarchy

We study a restricted version of Shannon's general purpose analog computer in which we only allow the machine to solve linear differential equations. We show that if this computer is allowed to sense inequalities in a differentiable way, then it can compute exactly the elementary functions, the smallest known recursive class closed under time and space complexity. Furthermore, we show that if the machine has access to a function f(x) with a suitable growth as x goes to infinity, then it can compute functions on any given level of the Grzegorczyk hierarchy. More precisely, we show that the model contains exactly the nth level of the Grzegorczyk hierarchy if it is allowed to solve n−3 non-linear differential equations of a certain kind. Therefore, we claim that, at least in this region of the complexity hierarchy, there is a close connection between analog complexity classes, the dynamical systems that compute them, and classical sets of subrecursive functions.     

A Kind of Discretization of the KdV Hierarchy

We propose a method for introducing higher-order terms in the potential expansion in order to study the continuum limits of the Toda hierarchy. These higher-order terms are differential polynomials in the lower-order terms. This type of potential expansion allows using fewer equations in the Toda hierarchy to recover the KdV hierarchy by the so-called recombination method. We show that the Lax pairs, the Poisson tensors, and the Hamiltonians of the Toda hierarchy tend toward the corresponding objects of the KdV hierarchy in the continuum limit. This method gives a kind of discretization of the KdV hierarchy.     

Categories of Relations and Functional Relations

We define relations and their composition in a category with (E, M)-factorization structure, with M consisting of monomorphisms, but E not restricted to epimorphisms. We obtain an associativity criterion for composition of relations, and we study functional and induced relations. We show that under our assumptions, the categories of relations on functional and induced relations are isomorphic to the category of relations for the given category.     

Noncommutative Constrained KP Hierarchy and Multi-component Noncommutative Constrained KP Hierarchy

In this paper, the authors define the noncommutative constrained Kadomtsev-Petviashvili (KP) hierarchy and multi-component noncommutative constrained KP hierarchy. Then they give the recursion operators for the noncommutative constrained KP (NcKP) hierarchy and multi-component noncommutative constrained KP (NmcKP) hierarchy. The authors hope these studies might be useful in the study of D-brane dynamics whose noncommutative coordinates emerge from limits of the M theory and string theory.     

The discrete parts of approximately decidable sets in Euclidean spaces

It is shown that the classes of discrete parts, A ∩ ?^k, of approximately resp. weakly decidable subsets of Euclidean spaces, A ? ?^k, coincide and are equal to the class of ω‐r. e. sets which is well‐known as the first transfinite level in Ershov's hierarchy exhausting Δ⁰₂.     

An analytical treatment of the formation of one-dimensional steady shock waves in uniform and diverging ducts

Singular perturbation techniques are used to study boundary value problems whose solutions model the behavior of one-dimensional steady shock waves in ducts of constant and variable cross-sectional area.     

确定递阶层次结构的简便方法

运用层次分析法(AHP)解决决策问题时,第一步就是要确定问题的递阶层次结构.对此,现有文献中给出的数学方法都是基于可达矩阵的,它通常需要借助计算机来完成.在文中充分考虑到AHP递阶层次结构的特点严格的逐层相关性及元素间无互相关性,给出一种非常简单的方法—划列法(DRM),并严格证明了其正确性,然后通过举例给予说明.该方法使递阶层次结构的确定不必再进行可达矩阵等计算,只依靠手工即可完成.     

层次系统DEA模型的研究

经典的DEA模型视决策单元为黑匣子,不考虑内部结构.实际上,决策单元DMU可能具有各种各样的结构.对DMU进行效率评价时,尽管最初的输入和最终的输出相同,但考虑DMU结构与忽视DMU结构得到的效率不同.基于这样一种思想,提出了一种基于层次系统的DEA模型.     

On the Involutive Solutions of Solition Hierarchy

ＯｎｔｈｅＩｎｖｏｌｕｔｉｖｅＳｏｌｕｔｉｏｎｓｏｆＳｏｌｉｔｉｏｎＨｉｅｒａｒｃｈｙ乔志军ＯｎｔｈｅＩｎｖｏｌｕｔｉｖｅＳｏｌｕｔｉｏｎｓｏｆＳｏｌｉｔｉｏｎＨｉｅｒａｒｃｈｙ￥ＱｉａｏＺｈｉｊｕｎ（Ｄｅｐｔ．ｏｆＭａｔｈ，ＬｉａｏｎｉｇｎＵｎｉｖ...     

On the Weight Hierarchy of Product Codes

Let V and W be codes and let C = V W be the product code of V and W. In [6] Wei and Yang, conjectured a formula for the generalized Hamming weights of V W in terms of those of V and W provided that both V and W satisfy the chain condition. Recently the conjecture has been proved by Schaathun [4]. In this paper we generalize the formula to a product code with more than two components.     

一个新的非等谱可积族和一些相关对称

利用李群$M_nC$的一个子群我们引入一个线性非等谱问题,该问题的相容性条件可导出演化方程的一个非等谱可积族,该可积族可约化成一个广义非等谱可积族.这个广义非等谱可积族可进一步约化成在物理学中具有重要应用的标准非线性薛定谔方程和KdV方程.基于此,我们讨论在广义非等谱可积族等谱条件下的一个广义AKNS族$u_t=K_m(u)$的$K$对称和$\tau$对称.此外,我们还考虑非等谱AKNS族$u_t=\tau_{N+1}^l$的$K$对称和$\tau$对称.最后,我们得到这两个可积族的对称李代数,并给出这些对称和李代数的一些应用,即生成了一些变换李群和约化方程的无穷小算子.     

Witten Solution for the Gelfand–Dikii Hierarchy

We derive formulas making it possible to calculate the Taylor expansion coefficients of the string solution for the Gelfand–Dikii hierarchy. According to the Witten conjecture, these coefficients coincide with the Mumford–Morita–Miller intersection numbers (correlators) of stable cohomology classes for the moduli space of n-spin bundles on Riemann surfaces with punctures.     

Relations between two types of polarized partitions

It is shown that close links exist between two important types of polarized partition relations of higher dimensions. Project supported by a South-South Fellowship of the Third World Academy of Sciences and by the National Natural Science Foundation of China (Grant No. 19671061).     

String Equations of the q-KP Hierarchy

Based on the Lax operator L and Orlov-Shulman’s M operator, the string equations of the q-KP hierarchy are established from the special additional symmetry flows, and the negative Virasoro constraint generators {L _−n , n ≥ 1} of the 2-reduced q-KP hierarchy are also obtained.     

Improving Thompson's Conjecture for Suzuki Groups

Let G be a finite group and cs(G) be the set of conjugacy class sizes of G. In 1987, J. G. Thompson conjectured that, if G is a finite group with Z(G) = 1 and M is a nonabelian simple group satisfying that cs(G) = cs(M), then G ? M. This conjecture has been proved for Suzuki groups in [5 Guiyun, C. (1996). On Thompson's conjecture. J. Algebra 185(1):184–193.[Crossref], [Web of Science ®] , [Google Scholar]]. In this article, we improve this result by proving that, if G is a finite group such that cs(G) = cs(Sz(q)), for q = 2^2m+1, then G ? Sz(q) × A, where A is abelian. We avoid using classification of finite simple groups in our proofs.     

Conjugacy of Sylow 2-Subloops of the Chein Loops M 2n (G, 2)

In general, Sylow's Theorems do not hold for finite Moufang loops. It can be seen that if p is an odd prime then the Sylow p-subloops of the Chein loop M _2n (G, 2) are conjugate. Here we prove that it is also true that all the Sylow 2-subloops of M _2n (G, 2) are conjugate.     

D—AKNS族的换位表示

本文根据曹策问教授的想法,求得了与D-AKNS族发展方程相联系的特征值之泛函梯度与Lenard算子对;并由此得到了D-AKNS族非线性发展方程的换位表示。文末还讨论了换位表示与定态D-AKNS方程之间的关系.