一种检测动力系统振动频率的新方法

为了检测动力系统的振动频率,建立了动力系统的拓扑空间u和非平稳正弦函数空间M,采用拓扑反变理论把空间u映射到已知的空间M中,通过拓扑反变算子f：u→M检测未知的空间u振动频率,求出这个反变算子后,通过Poincare映射给出该反变算子稳定的存在条件,通过此方法即能够检测出动力系统振动特征频率的瞬变性,同时该方法具有较强的抗干扰能力,实验测试结果表明该方法是可行的。     

A modal proof theory for final polynomial coalgebras

An infinitary proof theory is developed for modal logics whose models are coalgebras of polynomial functors on the category of sets. The canonical model method from modal logic is adapted to construct a final coalgebra for any polynomial functor. The states of this final coalgebra are certain “maximal” sets of formulas that have natural syntactic closure properties.

The syntax of these logics extends that of previously developed modal languages for polynomial coalgebras by adding formulas that express the “termination” of certain functions induced by transition paths. A completeness theorem is proven for the logic of functors which have the Lindenbaum property that every consistent set of formulas has a maximal extension. This property is shown to hold if the deducibility relation is generated by countably many inference rules.

A counter-example to completeness is also given. This is a polynomial functor that is not Lindenbaum: it has an uncountable set of formulas that is deductively consistent but has no maximal extension and is unsatisfiable, even though all of its countable subsets are satisfiable.     

导出微分分次范畴的 Nakayama 函子

设A是域k上的DG范畴,B．Keller定义了微分分次范畴Dif A的DG函子ν。在定义了Dif A的DG函子ν-的基础上,证明了ν和ν-是HA的正和函子,且ν和ν-诱导了DA的正和函子Lν和Rν-。     

From modal logic to terminal coalgebras

We define a modal logic whose models are coalgebras of a polynomial functor. Bisimilarity turns out to be the same as logical equivalence. Ideas and concepts of modal logic are directly applied to the theory of coalgebras: we give an axiomatization and define canonical coalgebras. That leads to a completeness result. Each canonical coalgebra proves to be terminal in a certain class of coalgebras. The approach also yields a functional characterization of the terminal coalgebra of all coalgebras with respect to a given polynomial functor.     

THE CATEGORY THEORY OF TIME SYSTEMS

In this paper we show a categorical treatment of general time systems using the categorization method presented in our previous paper. Various concepts about general time systems are categorized in the unified framework. Some category theoretical tools for the investigation of such time systems are presented. Using those tools some basic properties of time systems are explored in our framework. In particular, a conceptual equivalence between the causality and the state space representability is proved in the categorical terms. These results show that our method can be a universal tool for a categorization and a categorical treatment of mathematically defined general systems.     

量子代数H(-)函子的系数扩张

令U为量子代数,则A(U)表示以A为基环的量子代数U的量子坐标代数.当基环A扩张为A代数Γ时,相应的A(U)变为Γ[Ur].本文主要指出从Γ-模范畴到Ur-模范畴的函子Hr(-)是正合共变的,同时,若Γ作为A-模是平坦的,则Γ[Ur]作为Γ-模是自由的.     

归纳数据类型的范畴论方法

归纳数据类型是类型论研究的重要分支,传统的数理逻辑或代数方法侧重于描述归纳数据类型的有限语法构造,在语义性质与归纳规则的分析与设计方面存在一定的不足.基于范畴论的方法,在集合范畴的框架内给出谓词的形式化定义,分析谓词范畴与代数范畴的构成与性质,并探讨集合范畴上自函子到谓词范畴上自函子的提升,最后利用伴随函子及其伴随性质深入分析了归纳数据类型具有普适意义的归纳规则.     

形式语言基于Monads的语义计算模型

传统形式语言的语义建模方法在语义解释与规则描述等语义计算方面存在不足,应用范畴论方法的Monads对形式语言的语义计算进行了研究。基于Monads构造Kleisli范畴,在Kleisli范畴的形式化框架内建立语义计算模型,并对该模型进行了应用。与传统语义建模方法相比,所提语义计算模型具有普适性,其语义解释与规则描述的能力更强。     

Naturality of the conditional and the recursion ∗

In a class of categories, including E. Manes's assertional ones, the control structures if-then-else and repeat-until are modeled as natural transformations of suitable functors. This context show how the three basic pieces of any structured programming language (concatenation, conditional and recursion) share naturality.     

基于余归纳的最小Kripke结构的求解

状态空间爆炸问题是模型检测的最大障碍.从余归纳（特别是余代数）的角度研究了这个问题.用余归纳的方法证明：（1） 对于任意给定的一类Kripke结构（记为K）,在互模拟等价意义下K中最小Kripke结构（记为K₀）的存在唯一性.K₀描述了K中所有Kripke结构的行为而且没有冗余的状态;（2） 对于任意的M∈K（M可能包含无穷多个状态）,在互模拟等价意义下的相对于（M且基于K₀）的最小Kripke结构（记为K_M）的存在唯一性.由此提出一种求解K_M的算法,并用Ocaml予以简单实现.其应用之一在于可以用状态空间更小的K_M代替M进行模型检测.该方法可自然地推广到基于其他类型函子的余代数结构.