MTL代数的特征定理

对于逻辑系统代数结构的研究,是一个十分重要的研究课题.近期提出的BL代数,R_0代数,MTL代数就是这个方向具有代表性的研究成果.本文讨论MTL代数的性质与结构,给出这种代数的几个特征定理,澄清这种代数与其它代数结构的关系.鉴于单位区间中由左连续t-范数诱导的剩余蕴涵与MTL代数的紧密联系,本文还考察了这种模糊蕴涵的特征性质.     

Reflection of Long Game Formulas

We study game formulas the truth of which is determined by a semantical game of uncountable length. The main theme is the study of principles stating reflection of these formulas in various admissible sets. This investigation leads to two weak forms of strict-II¹₁ reflection (or ∑₁-compactness). We show that admissible sets such as H(ω₂) and L_ω2 which fail to have strict-II¹₁ reflection, may or may not, depending on set-theoretic hypotheses satisfy one or both of these weaker forms. Mathematics Subject Classification : 03C70, 03C75.     

数学分析中的一题多解问题

通过两个积分 (一个是不定积分 ,一个是定积分 )及一个极限 ,说明如何灵活使用积分法解决积分问题 ,方法灵活、巧妙 ,适用范围广 .     

Twin Paradox and the Logical Foundation of Relativity Theory

We study the foundation of space-time theory in the framework of first-order logic (FOL). Since the foundation of mathematics has been successfully carried through (via set theory) in FOL, it is not entirely impossible to do the same for space-time theory (or relativity). First we recall a simple and streamlined FOL-axiomatization Specrel of special relativity from the literature. Specrel is complete with respect to questions about inertial motion. Then we ask ourselves whether we can prove the usual relativistic properties of accelerated motion (e.g., clocks in acceleration) in Specrel. As it turns out, this is practically equivalent to asking whether Specrel is strong enough to “handle” (or treat) accelerated observers. We show that there is a mathematical principle called induction (IND) coming from real analysis which needs to be added to Specrel in order to handle situations involving relativistic acceleration. We present an extended version AccRel of Specrel which is strong enough to handle accelerated motion, in particular, accelerated observers. Among others, we show that~the Twin Paradox becomes provable in AccRel, but it is not provable without IND.     

Decision methods for linearly ordered Heyting algebras

The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable; a simple solution is here presented, inspired by related ideas in Gödel-Dummett logic.     

光束偏转法自动测试激光等离子体冲击波系统的研制

根据光束偏转原理，研制了激光等离子体冲击波自动测试系统的硬件和软件。该系统使用计算机与可编程序控制器作为上下位机，采取上下位机通讯的方式控制步进电机及二维移动架的移动，以改变探测光的相对位置，并利用单模光纤和光电倍增管将探测到的光偏转信号传入数字示波器进行存储，最后计算机将示波器中采集到的光偏转信号进行分析处理。使用该系统对激光等离子冲击波的衰减过程进行了实际测试，得到了较为理想的实验结果。     

Paul阱中共面两离子系统的能量本征态

通过对Paul阱中共面两离子体系的研究，考虑共面两离子在Paul阱中库仑关联，得到了两离子系统Schrdinger方程的精确解；椐方程的精确解，分析了质心能级简并情况，计算了两离子的平衡距离和低能级的几个态函数，设计程序作出了质心径向概率分布图. 关键词： Paul阱 两离子 共面 量子逻辑操作     

Normative KGP agents

We extend the logical model of agency known as the KGP model, to support agents with normative concepts, based on the roles an agent plays and the obligations and prohibitions that result from playing these roles. The proposed framework illustrates how the resulting normative concepts, including the roles, can evolve dynamically during the lifetime of the agent. Furthermore, we illustrate how these concepts can be combined with the existing capabilities of KGP agents in order to plan for their goals, react to changes in the environment, and interact with other agents. Our approach gives an executable specification of normative concepts that can be used directly for prototyping applications. Fariba Sadri is a senior lecturer at Imperial College London, from where she received her PhD. Her earlier work concentrated on integrity of deductive databases and temporal reasoning, in particular using the event calculus. In more recent years her work has been on agent technologies and multi-agent systems. She has worked on logic-based agent models, reasoning, dynamic belief revision, and inter-agent communication and negotiation for resources. She was co-awarded an EPSRC grant for research into logic-based multi-agents and was co-investigator in the EU SOCS project. Kostas Stathis is a senior lecturer at Royal Holloway, University of London and he holds a PhD from Imperial College London. His research interests are in the area of computational intelligence in general and in the intersection of computational logic and cognitive systems for social computing applications in particular. His research interests include: representation of human-computer (or computer-computer) interaction as a game; cognitive & autonomous agents; artificial agent societies; agent communication; programmable agents and agent platforms. He is a co-investigator of the EU ArguGRID project and was a co-investigator of the EU SOCS project. Francesca Toni is a senior lecturer at Imperial College London, from where she received her PhD. Her earlier work focused on abductive reasoning. In more recent years, she focused on argumentation, agent models and multi-agent systems. She has worked on computational logic-based agent models, agent reasoning, dynamic belief revision, and inter-agent communication and negotiation for resources. She has been co-ordinator of the EU SOCS project, which developed the KGP model of agency, and is coordinator of the EU ArguGRID project, on the application of argumentative agents within grid systems.     

ON SOME INTERPRETATIONS OF CLASSICAL LOGIC

In distinction from the well-known double-negation embeddings of the classical logic we consider some variants of single-negation embeddings and describe some classes of superintuitionistic first-order predicate logics in which the classical first-order calculus is interpretable in such a way. Also we find the minimal extensions of Heyting's logic in which the classical predicate logic can be embedded by means of these translations.