Temporal Algebras,Pretemporal Algebras,and Modal Algebras: A Relation between Time and Necessity

In this paper the structure of pretemporal algebra is used to study some aspects of temporal algebras and modal algebras. The paper contains a computational approach to finite temporal algebras and a general splitting theorem for finite temporal algebras.     

Free Groups in Central Simple Algebras without Tits' Theorem

Let R be a noncommutative central simple algebra, the center k of which is not absolutely algebraic, and consider units a,b of R such that {a,a ^b } freely generate a free group. It is shown that such b can be chosen from suitable Zariski dense open subsets of R, while the a can be chosen from a set of cardinality |k| (which need not be open).     

The Inverse Function Theorem for Free Associative Algebras

We obtain a necessary and sufficient condition for a given collection of elements to freely generate a free associative algebra. We present some necessary conditions for primitivity of an element of a free associative algebra of rank 2.     

Stone代数的Cayley表示定理

首先通过集代数得到了Stone代数的表示定理,然后证明了每一个Stone代数均嵌入到某个集合X上的一个Stone映射类S中.     

On Finite Model Property for Admissible Rules

Our investigation is concerned with the finite model property (fmp) with respect to admissible rules. We establish general sufficient conditions for absence of fmp w. r. t. admissibility which are applicable to modal logics containing K4: Theorem 3.1 says that no logic λ containing K4 with the co-cover property and of width > 2 has fmp w. r. t. admissibility. Surprisingly many, if not to say all, important modal logics of width > 2 are within the scope of this theorem–K4 itself, S4, GL, K4.1, K4.2, S4.1, S4.2, GL.2, etc. Thus the situation is completely opposite to the case of the ordinary fmp–the absolute majority of important logics have fmp, but not with respect to admissibility. As regards logics of width ≤ 2, there exists a zone for fmp w. r. t. admissibility. It is shown (Theorem 4.3) that all modal logics A of width ≤ 2 extending S4 which are not sub-logics of three special tabular logics (which is equipotent to all these λ extend a certain subframe logic defined over S4 by omission of four special frames) have fmp w.r.t. admissibility.     

Free C-Algebras and the Problem of Uniquenes of Extension in Non-commutative Hahn-Banach Theorem

ＦｒｅＣ＊┐ＡｌｇｅｂｒａｓａｎｄｔｈｅＰｒｏｂｌｅｍｏｆＵｎｉｑｕｅｎｅｓｏｆＥｘｔｅｎｓｉｏｎｉｎＮｏｎ┐ｃｏｍｍｕｔａｔｉｖｅＨａｈｎ┐ＢａｎａｃｈＴｈｅｏｒｅｍ＊）ＺｈａｎｇＬｕｎｃｈｕａｎ（张伦传）ａｎｄＭａＪｉｐｕ（马吉溥）（Ｄｅｐａｒｔ...     

Construction of an Explicit Basis for Rules Admissible in Modal System S4

We find an explicit basis for all admissible rules of the modal logic S4. Our basis consists of an infinite sequence of rules which have compact and simple, readable form and depend on increasing set of variables. This gives a basis for all quasi‐identities valid in the free modal algebra ℱ_S4(ω) of countable rank.     

A New Modal Lindström Theorem

We prove new Lindstr?m theorems for the basic modal propositional language, and for some related fragments of first-order logic. We find difficulties with such results for modal languages without a finite-depth property, high-lighting the difference between abstract model theory for fragments and for extensions of first-order logic. In addition we discuss new connections with interpolation properties, and the modal invariance theorem. Mathematics Subject Classification (2000): Primary 03B45; Secondary 03C95     

A Cut‐free Proof System for Bounded Metric Temporal Logic Over a Dense Time Domain

We present a complete and cut‐free proof‐system for a fragment of MTL, where modal operators are only labelled by bounded intervals with rational endpoints.     

A Decision Procedure for Nonperiodic Sequents of the First-Order Linear Temporal Logic

A deduction-based decision procedure is presented for the nonperiodic D-sequents of the first-order linear temporal logic. The D-sequents are obtained from D ₂-sequents [7], [8] by removing the periodicity condition. The deductive procedure proposed consists of decidable deductive procedures that replace infinitary and finitary induction rules for the temporal operator ``always'. The soundness and completeness of the deduction-based decision procedure proposed is proved.     

A Basis in Semi‐Reduced Form for the Admissible Rules of the Intuitionistic Logic IPC

We study the problem of finding a basis for all rules admissible in the intuitionistic propositional logic IPC. The main result is Theorem 3.1 which gives a basis consisting of all rules in semi‐reduced form satisfying certain specific additional requirements. Using developed technique we also find a basis for rules admissible in the logic of excluded middle law KC.     

A semantic hierarchy for intuitionistic logic

Brouwer’s views on the foundations of mathematics have inspired the study of intuitionistic logic, including the study of the intuitionistic propositional calculus and its extensions. The theory of these systems has become an independent branch of logic with connections to lattice theory, topology, modal logic, and other areas. This paper aims to present a modern account of semantics for intuitionistic propositional systems. The guiding idea is that of a hierarchy of semantics, organized by increasing generality: from the least general Kripke semantics on through Beth semantics, topological semantics, Dragalin semantics, and finally to the most general algebraic semantics. While the Kripke, topological, and algebraic semantics have been extensively studied, the Beth and Dragalin semantics have received less attention. We bring Beth and Dragalin semantics to the fore, relating them to the concept of a nucleus from pointfree topology, which provides a unifying perspective on the semantic hierarchy.     

A finite model property for RMImin

It is proved that the variety of relevant disjunction lattices has the finite embeddability property. It follows that Avron's relevance logic RMI _min has a strong form of the finite model property, so it has a solvable deducibility problem. This strengthens Avron's result that RMI _min is decidable. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

The finite embeddability property for residuated lattices, pocrims and BCK-algebras

A class of algebras has the finite embeddability property (FEP) if every finite partial subalgebra of an algebra in the class can be embedded into a finite algebra in the class. We investigate the relationship of the FEP with the finite model property (FMP) and strong finite model property (SFMP).? For quasivarieties the FEP and the SFMP are equivalent, and for quasivarieties with equationally definable principal relative congruences the three notions FEP, FMP and SFMP are equivalent. The variety of intuitionistic linear algebras –which is known to have the FMP–fails to have the FEP, and hence the SFMP as well. The variety of integral intuitionistic linear algebras (also known as the variety of residuated lattices) does possess the FEP, and hence also the SFMP. Similarly contrasting statements hold for various subreduct classes. In particular, the quasivarieties of pocrims and of BCK-algebras possess the FEP. As a consequence, the universal theories of the classes of residuated lattices, pocrims and BCK-algebras are decidable. Received February 16, 2001; accepted in final form November 2, 2001. RID="h1" ID="h1"The second author was supported by a postdoctoral research fellowship of the National Research Foundation of South Africa, hosted by the University of Illinois at Chicago.     

A constrained optimization based method for acoustic finite element model updating of cavities using pressure response

A method based on constrained optimization for updating of an acoustic finite element model using pressure response is proposed in this paper. The constrained optimization problem is solved using sequential quadratic programming algorithm. Updating parameters related to the properties of the sound absorbers and the measurement errors are considered. Effectiveness of the method is demonstrated by numerical studies on a 2D rectangular cavity and a car cavity. It is shown that the constrained formulation, that includes lower and upper bounds on the updating parameters in the form of inequality constraints, is important for obtaining a correct updated model. It is seen that the proposed updating method is not only able to effectively update the model to obtain a close match between the finite element model pressure response and the reference pressure response, but is also able to identify the correction factors to the parameters in error with reasonable accuracy.