时序信息的加工:自动还是控制

从长时记忆的角度出发,以故事的形式为实验材料,对时序信息的加工方式和通道效应进行了研究。结果表明,时序信息的加工存在视听通道效应,通道效应的机制源于记忆,且与加工方式有关。时序信息三个属性的加工方式不同：顺序属性倾向于自动加工;位置属性,就视觉信息来说倾问于自动加工,听觉在有顺序标码情况下倾向于自动加工、而在无顺序标码情况下则是一控制加工过程;间隔特性是一个控制加工过程。     

De Re Language,De Re Eliminability,and the Essential Limits of Both

De re modality is eliminable if there is an effective translation of all wffs into non-de re equivalents. We cannot have logical equivalence unless logic has odd theses, but we can have material equivalence by banning all essences, something the non-de re facts let us do, or by giving everything such humdrum essences as self-identity and banning the more interesting ones. Eliminability cannot be got from weaker assumptions, nor independent ones of even modest generality. The net philosophical import is that, quite apart from the merits of essentialism, de re language has scant utility.     

Exploring the set-theoretical structure of objects by additive trees

Arrangements of feature sets that have been proposed to represent qualitative and quantitative variation among objects are shown to generate identical sets of set-symmetric distances. The set-symmetric distances for these feature arrangements can be represented by path lengths in an additive linear tree. Imperfect versions of these feature arrangements are proposed, which also are indistinguishable by the set-symmetric distance model. The distances for the imperfect versions can be represented by path lengths in an additive imperfectly linear tree. When dissimilarities are defined by the more general contrast model and a constant may be added to proximity data, then for both the perfect and imperfect arrangements an additive tree analysis obtains a perfect fit with an imperfectly linear tree. However, in the case of the contrast model also the distinction between the perfect and imperfect arrangements disappears in that also for the perfect arrangements the resulting tree need no longer be linear.The author is grateful to Mathieu Koppen for detailed comments on an earlier version of this article.     

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].     

Inverses for Normal Modal Operators

Given a 1-ary sentence operator , we describe L - another 1-ary operator - as as a left inverse of in a given logic if in that logic every formula is provably equivalent to L. Similarly R is a right inverse of if is always provably equivalent to R. We investigate the behaviour of left and right inverses for taken as the operator of various normal modal logics, paying particular attention to the conditions under which these logics are conservatively extended by the addition of such inverses, as well as to the question of when, in such extensions, the inverses behave as normal modal operators in their own right.     

A Nonmonotonic Modal Formalization of the Logic of Acceptance and Rejection

The problems we deal with concern reasoning about incomplete knowledge. Knowledge is understood as ability of an ideal rational agent to make decisions about pieces of information. The formalisms we are particularly interested in are Moore's autoepistemic logic (AEL) and its variant, the logic of acceptance and rejection (AEL2). It is well-known that AEL may be seen as the nonmonotonic KD45 modal logic. The aim is to give an appropriate modal formalization for AEL2.     

Intuitionistic Autoepistemic Logic

In this paper we address the problem of combining a logic with nonmonotonic modal logic. In particular we study the intuitionistic case. We start from a formal analysis of the notion of intuitionistic consistency via the sequent calculus. The epistemic operator M is interpreted as the consistency operator of intuitionistic logic by introducing intuitionistic stable sets. On the basis of a bimodal structure we also provide a semantics for intuitionistic stable sets.     

Rules of Existential Quantification into "Intensional Contexts"

Propositional and notional attitudes are construed as relations (-in-intension) between individuals and constructions (rather than propositrions etc,). The apparatus of transparent intensional logic (Tichy) is applied to derive two rules that make it possible to export existential quantifiers without conceiving attitudes as relations to expressions (sententialism).     

Simulation and Transfer Results in Modal Logic – A Survey

This papers gives a survey of recent results about simulations of one class of modal logics by another class and of the transfer of properties of modal logics under extensions of the underlying modal language. We discuss: the transfer from normal polymodal logics to their fusions, the transfer from normal modal logics to their extensions by adding the universal modality, and the transfer from normal monomodal logics to minimal tense extensions. Likewise, we discuss simulations of normal polymodal logics by normal monomodal logics, of nominals and the difference operator by normal operators, of monotonic monomodal logics by normal bimodal logics, of polyadic normal modal logics by polymodal normal modal logics, and of intuitionistic modal logics by normal bimodal logics.     

Fuzzy Logic and Arithmetical Hierarchy,II

A very simple many-valued predicate calculus is presented; a completeness theorem is proved and the arithmetical complexity of some notions concerning provability is determined.