A characterization of computable analysis on unbounded domains using differential equations

The functions of computable analysis are defined by enhancing normal Turing machines to deal with real number inputs. We consider characterizations of these functions using function algebras, known as real recursive functions. Since there are numerous incompatible models of computation over the reals, it is interesting to find that the two very different models we consider can be set up to yield exactly the same functions. Bournez and Hainry used a function algebra to characterize computable analysis, restricted to the twice continuously differentiable functions with compact domains. In our earlier paper, we found a different (and apparently more natural) function algebra that also yields computable analysis, with the same restriction. In this paper we improve earlier work, finding three function algebras characterizing computable analysis, removing the restriction to twice continuously differentiable functions and allowing unbounded domains. One of these function algebras is built upon the widely studied real primitive recursive functions. Furthermore, the proof of this paper uses our previously developed method of approximation, whose applicability is further evidenced by this paper.     

Asymptotic stabilization of planar systems

Sufficient conditions for the existence of a C¹ asymptotically stabilizing feedback control for planar, affine systems are given. The methods are constructive and yield homogeneous feedback controls for homogeneous systems which allow the results to be extended to more general systems.     

三角代数上的ξ-Lie可导映射

设U=Tri(A,M,B)是含单位元I的三角代数并且φ:U→U是线性映射.利用代数分解的方法,证明了当三角代数U满足适当条件时,如果U,V∈U且UV=VU=I,有φ([U,V]ξ)=[φ(U),V]ξ+[U,φ(V)]ξ(ξ≠±1),则φ是导子.并得到了套代数上ξ-Lie可导映射的一个刻画.     

Lower bounds for the bilinear complexity of associative algebras

Let R(A) denote the bilinear complexity (also called rank) of a finite dimensional associative algebra A.?We prove that if the decomposition of into simple algebras contains only noncommutative factors, that is, the division algebra is noncommutative or . In particular, -matrix multiplication requires at least essential bilinear multiplications. We also derive lower bounds of the form essential bilinear multiplications. We also derive lower bounds of the form for the algebra of upper triangular -matrices and the algebra of truncated bivariate polynomials in the indeterminates X,Y over some field k.?A class of algebras that has received wide attention in this context con-sists of those algebras A for which the Alder—Strassen Bound is sharp, i.e., R(A) = 2dim A—t is the number of maximal twosided ideals in A. These algebras are called algebras of minimal rank. We determine all semisimple algebras of minimal rank over arbitrary fields and all algebras of minimal rank over algebraically closed fields. Received: January 12, 2000.     

N-可分效应代数

引入了N-可分效应代数的定义,证明了N-可分效应代数是区间效应代数且N-可分效应代数可嵌入到可分效应代数中.     

Weak pseudo-Wajsberg and weak pseudo-MV algebras

 We introduce and study a generalization of pseudo-Wajsberg and pseudo-MV algebras. The weakening of the axioms leads to the existence of two lattice structures, and of two multiplicative monoid structures. Some categorical equivalences are established.     

Interpretability of first-order linear temporal logics in fork algebras

In this paper we prove theorems on the interpretability of the first-order temporal logics LTL and TL into Fork Algebras. This result is part of a research project on the interpretability of logics in Fork Algebras, and has important applications towards the relational specification of properties of systems within the Ar_gentum tool.     

A generalized Ufnarovski graph

An important tool for studying standard finitely presented algebras is the Ufnarovski graph. In this paper we extend the use of the Ufnarovski graph to automaton algebras, introducing the generalized Ufnarovski graph. As an application, we show how this construction can be used to test Noetherianity of automaton algebras.     

Nested semantics over finite trees are equationally hard

This paper studies nested simulation and nested trace semantics over the language BCCSP, a basic formalism to express finite process behaviour. It is shown that none of these semantics affords finite (in)equational axiomatizations over BCCSP. In particular, for each of the nested semantics studied in this paper, the collection of sound, closed (in)equations over a singleton action set is not finitely based.     

A general time-varying estimation and control problem

This paper solves two problems raised in [HSK]. The first is a uniform norm time-varying linear estimation problem and the second is a general time-varying linear control problem.