A Modal Sortal Logic

An intensional semantic system for languages containing, in their logical syntax, sortal quantifiers, sortal identities, (second-order) quantifiers over sortals and the necessity operator is constructed. This semantics provides non-standard assignments to predicate expressions, which diverge in kind from the entities assigned to sortal terms by the same semantic system. The nature of the entities assigned to predicate expressions shows, at the same time, that there is an internal semantic connection between those expressions and sortal terms. A formal logical system is formulated that is proved to be absolutely consistent, sound and complete with respect to the intensional semantic system.     

The association of personal semantic memory to identity representations: insight into higher-order networks of autobiographical contents

Identity representations are higher-order knowledge structures that organise autobiographical memories on the basis of personality and role-based themes of one’s self-concept. In two experiments, the extent to which different types of personal semantic content are reflected in these higher-order networks of memories was investigated. Healthy, young adult participants generated identity representations that varied in remoteness of formation and verbally reflected on these themes in an open-ended narrative task. The narrative responses were scored for retrieval of episodic, experience-near personal semantic and experience-far (i.e., abstract) personal semantic contents. Results revealed that to reflect on remotely formed identity representations, experience-far personal semantic contents were retrieved more than experience-near personal semantic contents. In contrast, to reflect on recently formed identity representations, experience-near personal semantic contents were retrieved more than experience-far personal semantic contents. Although episodic memory contents were retrieved less than both personal semantic content types to reflect on remotely formed identity representations, this content type was retrieved at a similar frequency as experience-far personal semantic content to reflect on recently formed identity representations. These findings indicate that the association of personal semantic content to identity representations is robust and related to time since acquisition of these knowledge structures.     

音乐与语言的关系：来自句法、语义与音调节奏感知的神经活动证据

音乐和语言加工神经基础的关系研究,近年来发展迅速,获得了越来越多的关注。“共享结构整合资源假说”主张音乐的句法加工和语言的句法加工具有较大程度的神经资源的共享。在听觉语言实验中反映句法违例的ERP ELAN与音乐句法违例引发的ERAN极为相似,唯一的区别仅在于它们的分布有所不同——ERAN就像是一个两半球对称的ELAN。而且ERAN的引发不受是否接受过音乐训练这一因素的影响,虽然音乐人被试引发的ERAN波幅更大。一些研究发现音乐语义加工的神经基础为N400和N500。前者可以由音乐和语言两种刺激引发,后者只能由音乐意义的加工引发。然而,音乐的音调感知和语言的音调感知是否共享了神经资源,却还没有确定的结论。     

Two approaches to the problems of self-attacking arguments and general odd-length cycles of attack

The problems that arise from the presence of self-attacking arguments and odd-length cycles of attack within argumentation frameworks are widely recognized in the literature on defeasible argumentation. This paper introduces two simple semantics to capture different intuitions about what kinds of arguments should become justified in such scenarios. These semantics are modeled upon two extensions of argumentation frameworks, which we call sustainable and tolerant. Each one is constructed on the common ground of the powerful concept of admissibility introduced by Dung in [P.M. Dung, On the acceptability of arguments and its fundamental role in non-monotonic reasoning, logic programming, and n-person games, Artificial Intelligence 77 (1995) 321–357]. The novelty of this approach consists in viewing the admissibility of a subset of arguments as relative to potentially challenging subsets of arguments. Both sustainable and tolerant semantics are more credulous than preferred semantics (i.e. they justify at least the same arguments, and possibly more). Given certain sufficient conditions they coincide among them as well as with other semantics introduced by Dung.     

On Permutation in Simplified Semantics

This note explains an error in Restall’s ‘Simplified Semantics for Relevant Logics (and some of their rivals)’ (Restall, J Philos Logic 22(5):481–511, 1993) concerning the modelling conditions for the axioms of assertion A → ((A → B) → B) (there called c6) and permutation (A → (B → C)) → (B → (A → C)) (there called c7). We show that the modelling conditions for assertion and permutation proposed in ‘Simplified Semantics’ overgenerate. In fact, they overgenerate so badly that the proposed semantics for the relevant logic R validate the rule of disjunctive syllogism. The semantics provides for no models of R in which the “base point” is inconsistent. This problem is not restricted to ‘Simplified Semantics.’ The techniques of that paper are used in Graham Priest’s textbook An Introduction to Non-Classical Logic (Priest, 2001), which is in wide circulation: it is important to find a solution. In this article, we explain this result, diagnose the mistake in ‘Simplified Semantics’ and propose two different corrections.     

Neighborhoods for Entailment

This paper presents a neighborhood semantics for logics of entailment. It begins with a minimal system Min that expresses the most fundamental assumptions about the entailment relation, and continues by examining various extensions that reflect further assumptions that might be made about entailment. This leads first to the logic B that is the basic relevant logic, and then to more powerful systems. All of these logics are proved to be sound and strongly complete. With B the neighborhood semantics meets the Routley–Meyer relational semantics for relevant logic; these connections are examined. The minimal and basic entailment logics are shown to have the finite model property, and hence to be decidable.     

Extended Quantum Logic

The concept of quantum logic is extended so that it covers a more general set of propositions that involve non-trivial probabilities. This structure is shown to be embedded into a multi-modal framework, which has desirable logical properties such as an axiomatization, the finite model property and decidability.     

A Logic is Referential iff it is Selfextensional

The title of this paper is a theorem, which I am going to state and prove. The theorem extends from prepositional to predicate languages the result I presented in [5].     

The Genesis of Possible Worlds Semantics

This article traces the development of possible worlds semantics through the work of: Wittgenstein, 1913–1921; Feys, 1924; McKinsey, 1945; Carnap, 1945–1947; McKinsey, Tarski and Jónsson, 1947–1952; von Wright, 1951; Becker, 1952; Prior, 1953–1954; Montague, 1955; Meredith and Prior, 1956; Geach, 1960; Smiley, 1955–1957; Kanger, 1957; Hintikka, 1957; Guillaume, 1958; Binkley, 1958; Bayart, 1958–1959; Drake, 1959–1961; Kripke, 1958–1965.