广义拟可微函数的微分

本文给出一种广义拟可微函数类,它是Demyanov与Rlubinov(1980)意义下拟可微函数的推广,通过凸集类对的空间的某些理论,建立了这类广义拟可微函数的微分学理论,包括加法运算、数乘运算、乘法运算、除法运算、极大值运算,极小值运算以及复合运算的微分公式和中值定理。这些结果为广义拟可微类函数优化研究提供了基本工具．     

非交换微分及可积系统的统一零曲率表示

基于导数的微分在非交换几何、非交换规范理论和可积系统中都有十分重要的作用.本文从一类基于导数的微分出发给出了联络和曲率形式.利用这一理论,作者给出了连续、半离散和离散可积系统的统一零曲率表示.     

A Survey of the Development of Operational Calculus

Although the name of Oliver Heaviside is usually associated with the foundations of operational calculus, he was in fact preceded in introducing operational methods by a number of mathematicians. Heaviside's purely operational approach was often intuitive rather than rigorous and fell into disfavour in mathematical circles, being replaced by methods involving the concept of an integral transformation. In particular, the Laplace transformation came to be adopted by applied mathematicians and engineers despite the need for the Schwartz theory of distributions to account satisfactorily for the Dirac and other impulse functions. Jan Mikusinski,? ? It is intended that an expository article on Jan Mikusinski's operational calculus by H. G. Flegg will appear in a later issue ‐ Editor. however, has returned to the earlier operational approach and, by placing operational calculus upon a rigorous algebraic basis, has provided a calculus which is more general than those based upon integral transformations, and one which includes generalized functions without recourse to any specialized external theory.

     

离散分数阶神经网络的全局Mittag-Leffler稳定性

研究了一类离散分数阶神经网络的Mittag-Leffler稳定性问题.首先, 基于离散分数阶微积分理论、神经网络理论,提出了一类离散分数阶神经网络.其次,利用不等式技巧和离散Laplace变换,通过构造合适的Lyapunov函数,得到了离散分数阶神经网络全局Mittag-Leffler稳定的充分性判据.最后,通过一个数值仿真算例验证了所提出理论的有效性.     

Diagonal fixed points in algebraic recursion theory

The relation between least and diagonal fixed points is a well known and completely studied question for a large class of partially ordered models of the lambda calculus and combinatory logic. Here we consider this question in the context of algebraic recursion theory, whose close connection with combinatory logic recently become apparent. We find a comparatively simple and rather weak general condition which suffices to prove the equality of least fixed points with canonical (corresponding to those produced by the Curry combinator in lambda calculus) diagonal fixed points in a class of partially ordered algebras which covers both combinatory spaces of Skordev and operative spaces of Ivanov. Especially, this yields an essential improvement of the axiomatization of recursion theory via combinatory spaces. Supported in part by the Ministry of Education and Science of Republic of Bulgaria, contract No 705     

On the analytic model of a class of hyponormal operators

A theory of analytic model of a class of simple hyponormal operators is given by means of a pair of mutually reciprocal analytic and hermitian kernels on the spectrum or its complementary domain. The functional calculus and the trace formula of the analytic model are established.     

Amalgamation property for the class of basic algebras and some of its natural subclasses

We study Basic algebra, the algebraic structure associated with basic propositional calculus, and some of its natural extensions. Among other things, we prove the amalgamation property for the class of Basic algebras, faithful Basic algebras and linear faithful Basic algebras. We also show that a faithful theory has the interpolation property if and only if its correspondence class of algebras has the amalgamation property.     

Nonarchimedean spectral theory

A spectral theory is constructed for a special class of operators in a Banach space over a non-Archimedean field. A spectral theorem is proved, and a functional calculus and perturbation theory are constructed.Translated from Itogi Nauki i Tekhniki, Seriya Sovremennye Problemy Matematiki, Noveishie Dostizheniya, Vol. 25, pp. 51–114, 1984.     

Symmetry and inverse-closedness of matrix algebras and functional calculus for infinite matrices

We investigate the symbolic calculus for a large class of matrix algebras that are defined by the off-diagonal decay of infinite matrices. Applications are given to the symmetry of some highly non-commutative Banach algebras, to the analysis of twisted convolution, and to the theory of localized frames.

     

Algorithmic correspondence and canonicity for non-distributive logics

We extend the theory of unified correspondence to a broad class of logics with algebraic semantics given by varieties of normal lattice expansions (LEs), also known as ‘lattices with operators’. Specifically, we introduce a syntactic definition of the class of Sahlqvist formulas and inequalities which applies uniformly to each LE-signature and is given purely in terms of the order-theoretic properties of the algebraic interpretations of the logical connectives. We also introduce the algorithm ALBA, parametric in each LE-setting, which effectively computes first-order correspondents of LE-inequalities, and is guaranteed to succeed on a wide class of inequalities (the so-called inductive inequalities) which significantly extend the Sahlqvist class. Further, we show that every inequality on which ALBA succeeds is canonical. Projecting these results on specific signatures yields state-of-the-art correspondence and canonicity theory for many well known modal expansions of classical and intuitionistic logic and for substructural logics, from classical poly-modal logics to (bi-)intuitionistic modal logics to the Lambek calculus and its extensions, the Lambek-Grishin calculus, orthologic, the logic of (not necessarily distributive) De Morgan lattices, and the multiplicative-additive fragment of linear logic.     

Liouville在分数阶微积分概念方面的研究

分数阶微积分的概念是以整数阶微积分理论研究为基础,而分数阶微积分概念的建立经历了漫长的过程.探析此过程中数学家在研究分数阶微积分理论方面的贡献,进而整理Liouville在分数阶微积分概念方面的研究,进一步概括分数阶微积分第一定义的由来以及为后续相关研究奠定的坚实基础.     

Large time behaviour for functional differential equations with dominant eigenvalues of arbitrary order

The spectral theory for linear autonomous neutral functional differential equations (FDE) yields explicit formulas for the large time behaviour of solutions. Our results are based on resolvent computations and Dunford calculus, applied to establish explicit formulas for the large time behaviour of solutions of FDE. We investigate in detail a class of two-dimensional systems of FDE.     

Almost everywhere convex functions on R n and weak derivatives

The classical subdifferential calculus is a useful tool in order to establish characterizations of convex functions and optimality conditions; but it becomes useless when one thinks to study almost everywhere convex functions. In this paper by using Sobolev space theory we give some characterizations of this class of functions.     

Algebraic proof theory for substructural logics: Cut-elimination and completions

We carry out a unified investigation of two prominent topics in proof theory and order algebra: cut-elimination and completion, in the setting of substructural logics and residuated lattices.We introduce the substructural hierarchy — a new classification of logical axioms (algebraic equations) over full Lambek calculus FL, and show that a stronger form of cut-elimination for extensions of FL and the MacNeille completion for subvarieties of pointed residuated lattices coincide up to the level N₂ in the hierarchy. Negative results, which indicate limitations of cut-elimination and the MacNeille completion, as well as of the expressive power of structural sequent calculus rules, are also provided.Our arguments interweave proof theory and algebra, leading to an integrated discipline which we call algebraic proof theory.     

ON THE FUNCTIONAL CALCULUS IN ARCHIMEDEAN RIESZ SPACES WITH APPLICATIONS TO APPROXIMATION THEOREMS

ABSTRACT

We show that the functional calculus defined on the class of Dedekind σ-complete Riesz spaces can be extended to the class of uniformly complete Archimedean Riesz spaces without representing in the process the spaces involved by spaces of functions. As a consequence some results in the theory of Riesz spaces which were proved previously by representation techniques, can now be proved in an intrinsic way.     

一类分数阶神经网络模型的稳定性与Hopf分支分析

分析了一类分数阶神经网络的稳定性与Hopf分支问题.基于分数阶稳定性判据,得到了分数阶神经网络模型局部渐近稳定的条件.并以q为分支参数,得到了分数阶系统产生Hopf的条件.最后数值仿真证明了我们的结论.     

Noncommutative itô and stratonovich noise and stochastic evolutionsand stratonovich noise and stochastic evolutions

We complete the theory of noncommutative stochastic calculus by introducing the Stratonovich representation. The key idea is to develop a theory of white noise analysis for both the Itô and Stratonovich representations based on distributions over piecewise continuous functions mapping into a Hilbert space. As an example, we derive the most general class of unitary stochastic evolutions, where the Hilbert space is the space of complex numbers, by first constructing the evolution in the Stratonovich representation where unitarity is self-evident.     

On the oblique derivative problem for second order elliptic equations

A calculus of polyhomogeneous paired Lagrangian distributions, associated to any two cleanly intersecting Lagrangain submanifolds, is constructed. The class is given an intrinsic characterisation using radial operators and a symbol calculus is developed. A class of pseudo—differential operators with singular symbols is developed within the calculus. This is used to give symbolic constructions of parametrices for operators of real principal type and paired Lagrangian distributions. The calculus is then applied to give a symbolic construction of the forward fundamental solution of the wave operator.     

Reduction of database independence to dividing in atomless Boolean algebras

We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections between independence in database theory and stochastic independence. As indeed, in light of the aforementioned reduction and recent work of Ben-Yaacov (Isr. J. Math. 194(2):957–1012, 2013), the former case of independence can be seen as the discrete version of the latter.     

Approximate solutions for a class of first order nonlinear difference equations

In this paper, a measure-theoretical approach to find the approximate solutions for a class of first order nonlinear difference equations is introduced. In this method the problem is transformed to an equivalent optimization problem. Then, by considering it as a calculus of variations problem, some concepts in measure theory are used to approximate the solution. The procedure of constructing approximate solution in form of an algorithm is shown. Finally a numerical example is given.