On neat embeddings of cylindric algebras

We show that certain properties of dimension complemented cylindric algebras, concerning neat embeddings, do not generalize much further. Let α ≥ ω. There are non‐isomorphic representable cylindric algebras of dimension α each of which is a generating subreduct of the same β dimensional cylindric algebra. We also show that there exists a representable cylindric algebra ?? of dimension α, such that ?? is a generating subreduct of ?? and ??′, both in CA_{α +ω} , however ?? and ??′ are not isomorphic. This settle questions raised by Henkin, Monk and Tarski (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

An Omitting Types Theorem for first order logic with infinitary relation symbols

In this paper, an extension of first order logic is introduced. In such logics atomic formulas may have infinite lengths. An Omitting Types Theorem is proved. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Weakly representable atom structures that are not strongly representable,with an application to first order logic

Letn > 2. A weakly representable relation algebra that is not strongly representable is constructed. It is proved that the set of all n by n basic matrices forms a cylindric basis that is also a weakly but not a strongly representable atom structure. This gives an example of a binary generated atomic representable cylindric algebra with no complete representation. An application to first order logic is given. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Categorical Abstract Algebraic Logic: Algebraizable Institutions

The framework developed by Blok and Pigozzi for the algebraizability of deductive systems is extended to cover the algebraizability of multisignature logics with quantifiers. Institutions are used as the supporting structure in place of deductive systems. In particular, the concept of an algebraic institution and that of an algebraizable institution are made precise using the theory of monads from categorical algebra and the notion of equivalence of institutions introduced by Voutsadakis. Several examples of algebraic and algebraizable institutions are provided.     

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

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

The class of infinite dimensional neat reducts of quasi‐polyadic algebras is not axiomatizable

SC, CA, QA and QEA denote the classes of Pinter's substitution algebras, Tarski's cylindric algebras, Halmos' quasi‐polyadic algebras and quasi‐polyadic equality algebras, respectively. Let ω ≤ α < β and let K ∈ {SC,CA,QA,QEA}. We show that the class of α ‐dimensional neat reducts of algebras in K_β is not elementary. This solves a problem in [3]. Also our result generalizes results proved in [2] and [3]. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Full Models for Positive Modal Logic

The positive fragment of the local modal consequence relation defined by the class of all Kripke frames is studied in the context of Abstract Algebraic Logic. It is shown that this fragment is non‐protoalgebraic and that its class of canonically associated algebras according to the criteria set up in [7] is the class of positive modal algebras. Moreover its full models are characterized as the models of the Gentzen calculus introduced in [3].     

Polyadic and cylindric algebras of sentences

In this note we give an interpretation of cylindric algebras as algebras of sentences (rather than formulas) of first order logic. We show that the isomorphism types of such algebras of sentences coincide with the class of neat reducts of cylindric algebras. Also we show how this interpretation sheds light on some recent results. This is done by likening Henkin's Neat Embedding Theorem to his celebrated completeness proof. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

三人博弈问题的模型和一种解法的修正

简要叙述了三个擂台赛博弈问题,指出解法[1]的错误所在,其一是将无限延伸的博弈树以有限的形式看待,其二是概率计算过程与结果错误,提出一种新的解法,并比较了结果的大小。     

A homological approach to representations of algebras I: The wild case

We prove that the pure global dimension of a polynomial ring over an integral domain k in a finite or countable number n?2 of commuting (non-commuting, resp.) variables is t + 1, provided $\text{|k| = ?}{}_{\mathrm{t}}$. As an application, we determine the pure global dimension of wild algebras of quiver type, also (in case k is an algebraically closed field) of the wild local and wild commutative algebras of finite k-dimension.     

一个数学建模问题的简单解法

银行利率给出了一个简单计算方法 ,这种方法更符合中学生思维的习惯 .     

A Geometrical Solution to a Tree Network Problem

A problem in tree networks, that of minimizing the cost of a pipeline tree connecting a source to a number of sinks, is discussed. A method of solution in which the optimal solution is synthesised from optimized subsystems is described. The method is built on the geometrical properties of the simplest subsystem; that with one source and two sinks. Experience with the method suggests that it is a practical alternative to numerical-iterative methods used hitherto.     

对LP问题有无穷多最优解判别定理证明的补充

本文指出了文献［１］中关于“无穷多最优解判别定理”证明中的不足，并给出了完整的证明     

一道习题的几何解法

从几何角度分析一道高等数学习题,指出所求的点的几何特征,给出了基于几何思想的解法.     

A Microcomputer Based Solution to a Practical Scheduling Problem

This paper presents a scheduling problem with constraints imposed on the waiting time between stages. The process in which it occurs involves the preparation, cooking and chilling of meals. A maximum of 30 min is permitted for waiting between the completion of the cooking stage and the start of chilling down to temperature of <3°C. If this is not achieved, then the food has to be discarded. Clearly the scheduling of the final cooking stage and chilling facilities is crucial in this context. The development of a procedure to do this scheduling, using a microcomputer, is described and some typical results presented. Further uses of the model are briefly outlined.     

A Solution to Banach's Hyperplane Problem

An infinite-dimensional Banach space X is constructed whichis not isomorphic to X R. Equivalently, X is not isomorphicto any of its closed subspaces of codimension one. This givesa negative answer to a question of Banach. In fact, X has thestronger property that it is not isomorphic to any proper subspace.It also happens to have an unconditional basis.     

A simple construction of representable relation algebras with non‐representable completions

We give a simple new construction of representable relation algebras with non‐representable completions. Using variations on our construction, we show that the elementary closure of the class of completely representable relation algebras is not finitely axiomatizable (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A Short Solution to the Busemann-Petty Problem

A unified analytic solution to the Busemann-Petty problem was recently found by Gardner, Koldobsky and Schlumprecht. We give an elementary proof of their formulas for the inverse Radon transform of the radial function of an origin-symmetric star body .     

A cancellation conjecture for free associative algebras

We develop a new method to deal with the Cancellation Conjecture of Zariski in different environments. We prove the conjecture for free associative algebras of rank two. We also produce a new proof of the conjecture for polynomial algebras of rank two over fields of zero characteristic.