Logics with disjunction and proof by cases

This paper is a contribution to the general study of consequence relations which contain (definable) connective of “disjunction”. Our work is centered around the “proof by cases property”, we present several of its equivalent definitions, and show some interesting applications, namely in constructing axiomatic systems for intersections of logics and recognizing weakly implicative fuzzy logics among the weakly implicative ones. The work of the first author was supported by the National Foundation of Natural Sciences of China (Grant no. 60663002) and by the Grant Project of science and technology of The Education Department of Jiangxi Province under Grant no. 200618. The work of the second author was supported by grant A100300503 of the Grant Agency of the Academy of Sciences of the Czech Republic and by Institutional Research Plan AVOZ10300504.     

关于有向有限环的某些结果

一个环R称为有向有限的,如果对于x,y∈R,xy=1蕴涵着yx=1.本文我们首先建立有向有限环的某些新的刻画,然后考察了它们的某些性质.     

A Labelled Deductive System for Relational Semantics of the Lambek Calculus

We present a labelled version of Lambek Calculus without unit, and we use it to prove a completeness theorem for Lambek Calculus with respect to some relational semantics.     

On the Finite Model Property of Intuitionistic Modal Logics over MIPC

MIPC is a well-known intuitionistic modal logic of Prior (1957) and Bull (1966). It is shown that every normal intuitionistic modal logic L over MIPC has the finite model property whenever L is Kripke-complete and universal.     

Comparing Classes of Finite Structures

We compare classes of structures using the notion of a computable embedding, which is a partial order on the classes of structures. Our attention is mainly, but not exclusively, focused on classes of finite structures. Also, a number of problems are formulated.     

Finite Linear Spaces II

Batten and Beutelspacher have characterized Finite Linear Spaces with lines of size n,n + 1 and n + 2, and with v (n + 1)²for n 22, and some of the cases for smaller n. In this article, using the structuredapproach we presented in our earlier article [8], we complete this characterization for smalln.     

Steady State Analysis of Finite Fluid Flow Models Using Finite QBDs

The Markov modulated fluid model with finite buffer of size β is analyzed using a stochastic discretization yielding a sequence of finite waiting room queueing models with iid amounts of work distributed as exp (nλ). The n-th approximating queue’s system size is bounded at a value q_n such that the corresponding expected amount of work q_n/(nλ) → β as n → ∞. We demonstrate that as n → ∞, we obtain the exact performance results for the finite buffer fluid model from the processes of work in the system for these queues. The necessary (strong) limit theorems are proven for both transient and steady state results. Algorithms for steady state results are developed fully and illustrated with numerical examples.AMS subject classification: 60J25, 60K25, 60K15, 60K37This revised version was published online in June 2005 with corrected coverdate     

有限秩的可解群的剩余有限性质

本文讨论了有限秩的可解群的剩余有限性质,推广了Smelkin等人关于多重循环群的几个同类结果．     

三维有限元本征值的外推

通过二维和三维积分恒等式,探讨泊松方程本征值问题三角线元和四面体线元Richardson外推的可行性.理论分析表明,如果剖分为均匀一致和拟一致,外推均可将解的精度提高二阶.     

Normal form of derivations in the nonassociative and commutative lambek calculus with product

We show that derivations in the nonassociative and commutative Lambek calculus with product can be transformed to a normal form as it is the case with derivations in noncommutative calculi. As an application we obtain that the class of languages generated by categorial grammars based on the nonassociative and commutative Lambek calculus with product is included in the class of CF-languages. MSC: 68Q50, 03D15, 03B65.     

Spin Models on Finite Cyclic Groups

The concept of spin model is due to V. F. R. Jones. The concept of nonsymmetric spin model, which generalizes that of the original (symmetric) spin model, is defined naturally. In this paper, we first determine the diagonal matrices T satisfying the modular invariance or the quasi modular invariance property, i.e., or (respectively), for the character table P of the group association scheme of a cyclic group G of order m. Then we show that a (symmetric or nonsymmetric) spin model on G is constructed from each of the matrices T satisfying the modular or quasi modular invariance property.     

输入存贮线性有限自动机的极小化

由输入存贮线性有限自动机的线性系数组成的矩阵得出输入存贮线性有限自动机极小的等价定理,由此定理得出输入存贮线性有限自动机的极小化方法.     

A Finite Field Framework for Modeling,Analysis and Control of Finite State Automata

In this paper, we address the modeling, analysis and control of finite state automata, which represent a standard class of discrete event systems. As opposed to graph theoretical methods, we consider an algebraic framework that resides on the finite field <formula form="inline">${\Op F}_2$</formula> which is defined on a set of two elements with the operations addition and multiplication, both carried out modulo 2. The key characteristic of the model is its functional completeness in the sense that it is capable of describing most of the finite state automata in use, including non-deterministic and partially defined automata. Starting from a graphical representation of an automaton and applying techniques from Boolean algebra, we derive the transition relation of our finite field model. For cases in which the transition relation is linear, we develop means for treating the main issues in the analysis of the cyclic behavior of automata. This involves the computation of the elementary divisor polynomials of the system dynamics, and the periods of these polynomials, which are shown to completely determine the cyclic structure of the state space of the underlying linear system. Dealing with non-autonomous linear systems with inputs, we use the notion of feedback in order to specify a desired cyclic behavior of the automaton in the closed loop. The computation of an appropriate state feedback is achieved by introducing an image domain and adopting the well-established polynomial matrix method to linear discrete systems over the finite field <formula form="inline">${\Op F}_2$</formula>. Examples illustrate the main steps of our method.     

输入存贮线性有限自动机的弱可逆性

应用输入存贮线性有限自动机的结构矩阵讨论了输入存贮线性有限自动机的弱可逆性,得出输入存贮线性有限自动机延迟0步弱可逆的充要条件、延迟τ步弱可逆和严格延迟τ步弱可逆的充分条件,由此条件得出延迟τ步弱可逆和严格延迟τ步弱可逆的输入存贮线性有限自动机的构造方法并且求出延迟0步弱可逆输入存贮线性有限自动机的一个弱逆.     

On Representing Concepts in Finite Models

We present a method of transferring Tarski's technique of classifying finite order concepts by means of truth‐definitions into finite mode theory. The other considered question is the problem of representability relations on words or natural numbers in finite models. We prove that relations representable in finite models are exactly those which are of degree ≤ o′. Finally, we consider theories of sufficiently large finite models. For a given theory T we define sl(T) as the set of all sentences true in almost all finite models for T. For theories of sufficiently large models our version of Tarski's technique becomes practically the same as the classica one. We investigate also degrees of undecidability for theories of sufficiently large finite models. We prove for some special theory ST that its degree is stronger than 0′ but still not more than Σ⁰₂.     

Coleman Automorphisms of Extensions of Finite Characteristically Simple Groups by Some Finite Groups

Let G be an extension of a finite characteristically simple group by an abelian group or a finite simple group.It is shown that every Coleman automorphism of G is an inner automorphism.Interest in such automorphisms arises from the study of the normalizer problem for integral group rings.     

对流-扩散型问题Bubble-稳定有限元分析

本文针对形如σu α·u-kΔu=f对流—扩散型的模型问题,发展耦合局部bubble-函数的有限元方法,我们就α=0和σ=0两种情形证明了方法的与“影响因素”σ和pedlet-数无关稳定性及全局最佳收敛阶。     

关于等价嵌入于存贮线性有限自动机问题

本文应用模的手段研究域上线性有限自动机等价嵌入于其中存贮类型的问题,分别得到可等价嵌入的一个充分条件与不可等价嵌入的一个充要条件。