New lower and upper bounds for communality in factor analysis

We derive several relationships between communalities and the eigenvalues for ap ×p correlation matrix under the usual factor analysis model. For suitable choices ofj, _j (), where _j () is thej-th largest eigenvalue of , provides either a lower or an upper bound to the communalities for some of the variables. We show that for at least one variable, 1 - _p () improves on the use of squared mulitiple correlation coefficient as a lower bound.This research was done while the second author was at Tokyo Institute of Technology.     

Superintuitionistic Companions of Classical Modal Logics

This paper investigates partitions of lattices of modal logics based on superintuitionistic logics which are defined by forming, for each superintuitionistic logic L and classical modal logic , the set L[] of L-companions of . Here L[] consists of those modal logics whose non-modal fragments coincide with L and which axiomatize if the law of excluded middle p V p is added. Questions addressed are, for instance, whether there exist logics with the disjunction property in L[], whether L[] contains a smallest element, and whether L[] contains lower covers of . Positive solutions as concerns the last question show that there are (uncountably many) superclean modal logics based on intuitionistic logic in the sense of Vakarelov [28]. Thus a number of problems stated in [28] are solved. As a technical tool the paper develops the splitting technique for lattices of modal logics based on superintuitionistic logics and ap plies duality theory from [34].     

Not Every "Tabular" Predicate Logic is Finitely Axiomatizable

An example of finite tree Mo is presented such that its predicate logic (i.e. the intermediate predicate logic characterized by the class of all predicate Kripke frames based on Mo) is not finitely axiomatizable. Hence it is shown that the predicate analogue of de Jongh - McKay - Hosoi's theorem on the finite axiomatizability of every finite intermediate propositional logic is not true.     

A Logic for Reasoning about Relative Similarity

A similarity relation is a reflexive and symmetric binary relation between objects. Similarity is relative: it depends on the set of properties of objects used in determining their similarity or dissimilarity. A multi-modal logical language for reasoning about relative similarities is presented. The modalities correspond semantically to the upper and lower approximations of a set of objects by similarity relations corresponding to all subsets of a given set of properties of objects. A complete deduction system for the language is presented.     

Game logic and its applications I

This paper provides a logic framework for investigations of game theoretical problems. We adopt an infinitary extension of classical predicate logic as the base logic of the framework. The reason for an infinitary extension is to express the common knowledge concept explicitly. Depending upon the choice of axioms on the knowledge operators, there is a hierarchy of logics. The limit case is an infinitary predicate extension of modal propositional logic KD4, and is of special interest in applications. In Part I, we develop the basic framework, and show some applications: an epistemic axiomatization of Nash equilibrium and formal undecidability on the playability of a game. To show the formal undecidability, we use a term existence theorem, which will be proved in Part II.The authors thank Hiroakira Ono for helpful discussions and encouragements from the early stage of this research project, and Philippe Mongin, Mitio Takano and a referee of this journal for comments on earlier versions of this paper. The first and second authors are partially supported, respectively, by Tokyo Center of Economic Research and Grant-in-Aids for Scientific Research 04640215, Ministry of Education, Science and Culture.Presented by H. Ono     

On maximal intermediate predicate constructive logics

We extend to the predicate frame a previous characterization of the maximal intermediate propositional constructive logics. This provides a technique to get maximal intermediate predicate constructive logics starting from suitable sets of classically valid predicate formulae we call maximal nonstandard predicate constructive logics. As an example of this technique, we exhibit two maximal intermediate predicate constructive logics, yet leaving open the problem of stating whether the two logics are distinct. Further properties of these logics will be also investigated.Presented by H. Ono     

Classical Non-Associative Lambek Calculus

We introduce non-associative linear logic, which may be seen as the classical version of the non-associative Lambek calculus. We define its sequent calculus, its theory of proof-nets, for which we give a correctness criterion and a sequentialization theorem, and we show proof search in it is polynomial.     

Predicate Logics on Display

The paper provides a uniform Gentzen-style proof-theoretic framework for various subsystems of classical predicate logic. In particular, predicate logics obtained by adopting van Behthem's modal perspective on first-order logic are considered. The Gentzen systems for these logics augment Belnap's display logic by introduction rules for the existential and the universal quantifier. These rules for x and x are analogous to the display introduction rules for the modal operators and and do not themselves allow the Barcan formula or its converse to be derived. En route from the minimal modal predicate logic to full first-order logic, axiomatic extensions are captured by purely structural sequent rules.     

直肠间质瘤致下消化道大出血1例报告

胃肠道间质瘤是一种发生于消化道的少见的间叶肿瘤,直肠间质瘤更为罕见,在直肠肿瘤中的发生率0．1％以下。直肠问质瘤的临床表现无特异性,与其他直肠肿瘤相似,随肿瘤逐渐增大可表现为排便习惯改变、便血、排便困难等。临床确定诊断困难。手术治疗是能够治愈直肠问质瘤的唯一方法。格列卫作为一线化疗药物对术前降期及改善预后都有良好疗效。本例患者因下消化道大出血入院,肿瘤近肛缘,术中病理考虑为直肠闻质瘤,完整切除肿瘤后行保肛术。术后应用格列卫,随诊3个月无复发、转移。