Infinite Set Unification with Application to Categorial Grammar

In this paper the notion of unifier is extended to the infinite set case. The proof of existence of the most general unifier of any infinite, unifiable set of types (terms) is presented. Learning procedure, based on infinite set unification, is described.     

Refuting the unfolding-argument on the irrelevance of causal structure to consciousness

The unfolding argument (UA) was advanced as a refutation of prominent theories, which posit that phenomenal experience is determined by patterns of neural activation in a recurrent (neural) network (RN) structure. The argument is based on the statement that any input–output function of an RN can be approximated by an “equivalent” feedforward-network (FFN). According to UA, if consciousness depends on causal structure, its presence is unfalsifiable (thus non-scientific), as an equivalent FFN structure is behaviorally indistinguishable with regards to any behavioral test. Here I refute UA by appealing to computational theory and cognitive-neuroscience. I argue that a robust functional equivalence between FFN and RN is not supported by the mathematical work on the Universal Approximator theorem, and is also unlikely to hold, as a conjecture, given data in cognitive neuroscience; I argue that an equivalence of RN and FFN can only apply to static functions between input/output layers and not to the temporal patterns or to the network’s reactions to structural perturbations. Finally, I review data indicating that consciousness has functional characteristics, such as a flexible control of behavior, and that cognitive/brain dynamics reveal interacting top-down and bottom-up processes, which are necessary for the mediation of such control processes.     

语法的进化连续性及进化起源解释

语法是人类交流系统有别于其他动物的关键特征之一。行为比较研究表明, 除人类外的其他灵长目动物也能理解并掌握抽象的顺序排序规则; 神经生物学比较研究表明, 支持排序处理的神经机制来自人类与其他灵长目动物共同具有的脑区。因此语法所依赖的序列学习能力在人类与其他灵长目动物间具有进化连续性。词汇限制假说、事件感知假说与自我驯化假说分别从不同角度对人类语法的进化起源进行了解释。未来研究需要探讨人工语法任务中所发现的脑神经机制是否是层级结构加工的通用处理器, 并进一步澄清语义加工与语法加工的关系。     

A Tale of Four Grammars

In this paper we consider the relations existing between four deductive systems that have been called categorial grammars and have relevant connections with linguistic investigations: the syntactic calculus, bilinear logic, compact bilinear logic and Curry's semantic calculus.     

Well I May Be Exaggerating But Self-Qualifying Clauses in Negotiation of Opinions Among Japanese Speakers

The present study investigates the ways in which Japanese speakers negotiate their opinions in conversational interaction. On the one hand, speakers are apt to exaggerate a particular aspect of a given issue in asserting their opinion, on the other hand, they may also incorporate a self-qualification admitting a potential problem in their claim. By expressing their awareness of the problem before it is pointed out by the co-participants, the speakers seem to get license to proffer an exaggerated or overgeneralized claim and to increase their chance of receiving an affiliative response. This study explicates the mechanism through which such a self-qualifying clause emerges in the development of opinion-negotiation sequences. Further, as a contribution to a growing body of research on "interaction and grammar" (Ochs, Schegloff, and Thompson, 1996), this study explores the use of "contrastive" markers, -kedo and demo, in constructing turns and sequences in opinion-negotiation. The data demonstrate these two structurally different types of markers play distinct roles in differentiating and yet conjoining the speakers' assertion and self-qualification.     

Grammer and Social Interaction in Japanese and Anglo-American English: The Display of Context, Social Identity and Social Relation

This paper employs conversation analysis to examine the inter-connection between grammar and displays of contextual understanding, social identity, and social relationships as well as other activities clustering around turn-endings in Japanese talk-in-interaction, while undertaking a restricted comparison with the realisation of similar activities in English. A notable feature of turn-endings in Japanese is the particular salience of grammatical construction on the interactional activities they accomplish. Complete turns which are also syntactically complete are shown to be associated with the explicit display of contextual features, whereas syntactically incomplete turns are designed to circumvent or minimise such displays. The explicit or implicit display of one's social and contextual relationship to the interactional environment is therefore seen to be an integral part of the performance of social actions in Japanese. On the other hand, in English, it is more difficult to establish a clear association between grammar and the inclusion or avoidance of contextual displays.     

Introduction to Grammer and Interaction Papers

The present study reports on the use of a linguistic category "interrogative," which has been traditionally associated with the act of questioning, and its use in argument talk in Japanese. Based on the observation that interrogative utterances in argument data are regularly followed by non-answers, it is argued that interrogative utterances in argument sequences may not be designed/interpreted as doing questioning. Such use of interrogatives can become an orderly practice to which participants orient themselves in social activities recognizable as arguments. However, though an answer is not expected, the recipient invariably provides some form of response, or the initial speaker seeks such a response when none is provided. Thus the nature of interrogatives as a grammatical category seems to reside in the basic structural unit of social interaction [recipient-oriented action]-[response]. In general, this study is intended to show the dynamically interlocking relationship between grammar and interaction by exploring the intricate interplay between a local action for which interrogative grammar is employed, and the sequential environment and activity framework in which the action takes place.     

The Mental Representation of Human Action

Various theories of moral cognition posit that moral intuitions can be understood as the output of a computational process performed over structured mental representations of human action. We propose that action plan diagrams—“act trees”—can be a useful tool for theorists to succinctly and clearly present their hypotheses about the information contained in these representations. We then develop a methodology for using a series of linguistic probes to test the theories embodied in the act trees. In Study 1, we validate the method by testing a specific hypothesis (diagrammed by act trees) about how subjects are representing two classic moral dilemmas and finding that the data support the hypothesis. In Studies 2–4, we explore possible explanations for discrete and surprising findings that our hypothesis did not predict. In Study 5, we apply the method to a less well‐studied case and show how new experiments generated by our method can be used to settle debates about how actions are mentally represented. In Study 6, we argue that our method captures the mental representation of human action better than an alternative approach. A brief conclusion suggests that act trees can be profitably used in various fields interested in complex representations of human action, including law, philosophy, psychology, linguistics, neuroscience, computer science, robotics, and artificial intelligence.     

Second order inductive logic and Wilmers' principle

We extend the framework of Inductive Logic to Second Order languages and introduce Wilmers' Principle, a rational principle for probability functions on Second Order languages. We derive a representation theorem for functions satisfying this principle and investigate its relationship with the first order principles of Regularity and Super Regularity.     

Reflecting rules: A note on generalizing the deduction theorem

The purpose of this brief note is to prove a limitative theorem for a generalization of the deduction theorem. I discuss the relationship between the deduction theorem and rules of inference. Often when the deduction theorem is claimed to fail, particularly in the case of normal modal logics, it is the result of a confusion over what the deduction theorem is trying to show. The classic deduction theorem is trying to show that all so-called ‘derivable rules’ can be encoded into the object language using the material conditional. The deduction theorem can be generalized in the sense that one can attempt to encode all types of rules into the object language. When a rule is encoded in this way I say that it is reflected in the object language. What I show, however, is that certain logics which reflect a certain kind of rule must be trivial. Therefore, my generalization of the deduction theorem does fail where the classic deduction theorem didn't.