PhilPapers is currently in read-only mode while we are performing some maintenance. You can use the site normally except that you cannot sign in. This shouldn't last long.
Stephen Stich has argued that psychological theories that instantiate his Syntactic Theory of Mind are to be preferred to content-based or representationalist theories, because the former can capture and explain a wider range of generalizations about cognitive processes than the latter. Stich's claims about the relative merits of the Syntactic Theory of Mind are unfounded. Not only is it false that syntactic theories can capture psychological generalizations that content-based theories cannot, but a large class of behavioral regularities, readily explained by (...) content-based theories, appear to be beyond their explanatory reach. (shrink)
It is widely assumed that the explanatory states of scientific psychology are type-individuated by their semantic or intentional properties. First, I argue that this assumption is implausible for theories like David Marr's [1982] that seek to provide computational or syntactic explanations of psychological processes. Second, I examine the implications of this conclusion for the debate over psychological individualism. While most philosophers suppose that syntactic states supervene on the intrinsic physical states of information-processing systems, I contend they may not. Syntatic descriptions (...) must be adequately constrained, and the most plausible such constraints appeal to a system's teleological function or design and hence to its history. As a result, physical twins may not realize the same syntactic states. (shrink)
Semantic Structures is a large-scale study of conceptual structure and its lexical and syntactic expression in English that builds on the theory of Conceptual...
I argue that, contrary to common opinion, (i) unintended models do not pose a significant problem for syntactic approaches to scientific theories, (ii) in syntactic approaches, scientific theories can be as well connected to the world as in semantic ones, and (iii) some syntactic approaches are at least as language independent as semantic ones. Based on these results, I argue that syntactic and semantic approaches fare equally well when it comes to (iv) capturing the theory-observation relation, (v) ease of application, (...) and (vi) accommodating the use of models in the sciences. (shrink)
This essay considers arguments for and against syntactical constraints on the proper formalization of definitions, originally owing to Alfred Tarski. It discusses and refutes an application of the constraints generalized to include a prohibition against not only object-place but also predicate-place variables in higher-order logic in a criticism of a recent effort to define the concept of heterologicality in a strengthened derivation of Grelling's paradox within type theory requirements. If the objections were correct, they would offer a more general moral (...) for the proper formal definition of terms in philosophical logic. The criticism nevertheless seems mistaken both in the substance and specific application with respect to legitimate synctactical constraints on definitions of key concepts in the case of Grelling's paradox. As such, the critique provides no justification for overturning previous conclusions concerning the possibility of resurrecting a type-observant version of Grelling's heterologicality paradox. (shrink)
This study provides evidence for implicit learning in syntactic comprehension. By reanalyzing data from a syntactic priming experiment (Thothathiri & Snedeker, 2008), we find that the error signal associated with a syntactic prime influences comprehenders' subsequent syntactic expectations. This follows directly from error-based implicit learning accounts of syntactic priming, but it is unexpected under accounts that consider syntactic priming a consequence of temporary increases in base-level activation. More generally, the results raise questions about the principles underlying the maintenance of implicit (...) statistical knowledge relevant to language processing, and about possible functional motivations for syntactic priming. (shrink)
The acquisition of syntactic categories is a crucial step in the process of acquiring syntax. At this stage, before a full grammar is available, only surface cues are available to the learner. Previous computational models have demonstrated that local contexts are informative for syntactic categorization. However, local contexts are affected by sentence-level structure. In this paper, we add sentence type as an observed feature to a model of syntactic category acquisition, based on experimental evidence showing that pre-syntactic children are able (...) to distinguish sentence type using prosody and other cues. The model, a Bayesian Hidden Markov Model, allows for adding sentence type in a few different ways; we find that sentence type can aid syntactic category acquisition if it is used to characterize the differences in word order between sentence types. In these models, knowledge of sentence type permits similar gains to those found by extending the local context. (shrink)
I advocate a theory of syntactic semantics as a way of understanding how computers can think (and how the Chinese-Room-Argument objection to the Turing Test can be overcome): (1) Semantics, considered as the study of relations between symbols and meanings, can be turned into syntax â a study of relations among symbols (including meanings) â and hence syntax (i.e., symbol manipulation) can suffice for the semantical enterprise (contra Searle). (2) Semantics, considered as the process of understanding one domain (by modeling (...) it) in terms of another, can be viewed recursively: The base case of semantic understanding âunderstanding a domain in terms of itself â is syntactic understanding. (3) An internal (or narrow ), first-person point of view makes an external (or wide ), third-person point of view otiose for purposes of understanding cognition. (shrink)
Suppose that one adopts a broadly Chomskyan perspective, in which there is a distinction between the language faculty and other cognitive faculties, including what Chomsky has recently called the “Conceptual-Intensional system”. Then there must in principle be at least three stages in this association that need to be understood. First, there is the nonlinguistic stage of conceptualizing a particular event.1 For example, while all of the participants in an event may be affected by the event in some way or another, (...) human cognizers typically focus on one or the other of those changes as being particularly salient or relevant to their interests. This participant is taken to be the “theme” or “patient” of the event, perhaps in some kind of nonlinguistic conceptual representation, such as the one developed by Jackendoff (1983, 1990b). Second, this conceptual/thematic representation is associated with a linguistic representation in which the entity seen as the patient of the event is represented as (say) an NP that is the direct object of the verb that expresses what kind of an event it was. This is the interface between language and the conceptual system. Finally, there is the possibility of adjusting this representation internally to the language system, by way of movements, chain formations, Case assignment processes, or whatever other purely syntactic processes there may be. For example, the NP that represents the theme and starts out as the direct object of the verb may become the subject if there is no other subject in the linguistic representation, either because there was no agent in the conceptual representation (as with an unaccusative verb), or because it was suppressed (as with a passive verb). (shrink)
This essay continues my investigation of `syntactic semantics': the theory that, pace Searle's Chinese-Room Argument, syntax does suffice for semantics (in particular, for the semantics needed for a computational cognitive theory of natural-language understanding). Here, I argue that syntactic semantics (which is internal and first-person) is what has been called a conceptual-role semantics: The meaning of any expression is the role that it plays in the complete system of expressions. Such a `narrow', conceptual-role semantics is the appropriate sort of semantics (...) to account (from an `internal', or first-person perspective) for how a cognitive agent understands language. Some have argued for the primacy of external, or `wide', semantics, while others have argued for a two-factor analysis. But, although two factors can be specifiedâ-one internal and first-person, the other only specifiable in an external, third-person wayâ-only the internal, first-person one is needed for understanding how someone understands. A truth-conditional semantics can still be provided, but only from a third-person perspective. (shrink)
Taking Chomsky’s Syntactic Structures as a starting point, this paper explores the use of recursive techniques in contemporary linguistic theory. Specifically, it is shown that there were profound ambiguities surrounding the notion of recursion in the 1950s, and that this was partly due to the fact that influential texts such as Syntactic Structures neglected to define what exactly constituted a recursive device. As a result, uncertainties concerning the role of recursion in linguistic theory have prevailed until the present day, and (...) some of the most common misunderstandings that have appeared in recent discussions are examined at some length. This article shows that debates about such topics are frequently undermined by fundamental misunderstandings concerning core terminology, and the full extent of the prevailing haziness is revealed. An attempt is made, for instance, to distinguish between such things as iterative constructional devices and self-similar syntactic embedding, despite the fact that these are usually both unhelpfully classified as examples of recursion. Consequently, this article effectively constitutes a plea for much greater accuracy and clarity when such important issues are addressed from a linguistic perspective. (shrink)
There has been much interest in the possibility of connectionist models whose representations can be endowed with compositional structure, and a variety of such models have been proposed. These models typically use distributed representations that arise from the functional composition of constituent parts. Functional composition and decomposition alone, however, yield only an implementation of classical symbolic theories. This paper explores the possibility of moving beyond implementation by exploiting holistic structure-sensitive operations on distributed representations. An experiment is performed using Pollack’s Recursive (...) Auto-Associative Memory. RAAM is used to construct distributed representations of syntactically structured sentences. A feed-forward network is then trained to operate directly on these representations, modeling syn- tactic transformations of the represented sentences. Successful training and generalization is obtained, demonstrating that the implicit structure present in these representations can be used for a kind of structure-sensitive processing unique to the connectionist domain. (shrink)
Terry Horgan and John Tienson have suggested that connectionism might provide a framework within which to articulate a theory of cognition according to which there are mental representations without rules (RWR) (Horgan and Tienson 1988, 1989, 1991, 1992). In essence, RWR states that cognition involves representations in a language of thought, but that these representations are not manipulated by the sort of rules that have traditionally been posited. In the development of RWR, Horgan and Tienson attempt to forestall a particular (...) line of criticism, theSyntactic Argument, which would show RWR to be inconsistent with connectionism. In essence, the argument claims that the node-level rules of connectionist networks, along with the semantic interpretations assigned to patterns of activation, serve to determine a set of representation-level rules incompatible with the RWR conception of cognition. The present paper argues that the Syntactic Argument can be made to show that RWR is inconsistent with connectionism. (shrink)
Quantification over individuals, times, and worlds can in principle be made explicit in the syntax of the object language, or left to the semantics and spelled out in the meta-language. The traditional view is that quantification over individuals is syntactically explicit, whereas quantification over times and worlds is not. But a growing body of literature proposes a uniform treatment. This paper examines the scopal interaction of aspectual raising verbs (begin), modals (can), and intensional raising verbs (threaten) with quantificational subjects in (...) Shupamem, Dutch, and English. It appears that aspectual raising verbs and at least modals may undergo the same kind of overt or covert scopechanging operations as nominal quantifiers; the case of intensional raising verbs is less clear. Scope interaction is thus shown to be a new potential diagnostic of object-linguistic quantification, and the similarity in the scope behavior of nominal and verbal quantifiers supports the grammatical plausibility of ontological symmetry, explored in Schlenker (2006). (shrink)
Syntactic semantics is a holistic, conceptual-role-semantic theory of how computers can think. But Fodor and Lepore have mounted a sustained attack on holistic semantic theories. However, their major problem with holism (that, if holism is true, then no two people can understand each other) can be fixed by means of negotiating meanings. Syntactic semantics and Fodor and Leporeâs objections to holism are outlined; the nature of communication, miscommunication, and negotiation is discussed; Brunerâs ideas about the negotiation of meaning are explored; (...) and some observations on a problem for knowledge representation in AI raised by Winston are presented. (shrink)
A computer can come to understand natural language the same way Helen Keller did: by using “syntactic semantics”—a theory of how syntax can suffice for semantics, i.e., how semantics for natural language can be provided by means of computational symbol manipulation. This essay considers real-life approximations of Chinese Rooms, focusing on Helen Keller’s experiences growing up deaf and blind, locked in a sort of Chinese Room yet learning how to communicate with the outside world. Using the SNePS computational (...) knowledge-representation system, the essay analyzes Keller’s belief that learning that “everything has a name” was the key to her success, enabling her to “partition” her mental concepts into mental representations of: words, objects, and the naming relations between them. It next looks at Herbert Terrace’s theory of naming, which is akin to Keller’s, and which only humans are supposed to be capable of. The essay suggests that computers at least, and perhaps non-human primates, are also capable of this kind of naming. (shrink)
Experimental data suggest that the division between the visual ventral and dorsal pathways may indeed indicate that static and dynamical information is processed separately. Contrary to Hurford, it is suggested that the ventral pathway primarily generates representations of objects, whereas the dorsal pathway produces representations of events. The semantic object/event distinction may relate to the morpho-syntactic noun/verb distinction.
Our first aim in this paper is to respond to four novel objections in Jason Stanley's 'Context and Logical Form'. Taken together, those objections attempt to debunk our prior claims that one can perform a genuine speech act by using a subsentential expression—where by 'subsentential expression' we mean an ordinary word or phrase, not embedded in any larger syntactic structure. Our second aim is to make it plausible that, pace Stanley, there really are pragmatic determinants of the literal truthconditional content (...) of speech acts. We hope to achieve this second aim precisely by defending the genuineness of subsentential speech acts. Given our two aims, it is necessary to highlight briefly their connection—which we do in the first part of the Introduction. Following that, we introduce Stanley's novel objections. This is the role of the second part of the Introduction. We offer our rebuttals in Section 2 (against 'shorthand') and Section 3 (against syntactic ellipsis, among other things). (shrink)
Structure of English by Scott Soames & David M. Perlmutter Syntactic Argumentation and the Structure of English (SASE) presents the major theoretical ...
Noam Chomsky's book on syntactic structures is a serious attempts on the part of a linguist to construct within the tradition of scientific theory-construction ...
The term ‘ellipsis’ can be used to refer to a variety of phenomena: syntactic, semantic, and pragmatic. In this article, I discuss the recent comprehensive survey by Stainton 2006 of these kinds of ellipsis with respect to the analysis of nonsententials and try to show that despite his trenchant criticisms and insightful proposal, some of the criticisms can be evaded and the insights incorporated into a semantic ellipsis analysis, making a ‘divide-and-conquer’ strategy to the properties of nonsententials feasible after all. (...) -/- Editor's comment: To find the contribution, please go to item 16 of the URL, which contains the full text. Professor Merchant has permitted this. (shrink)
I argue that Stich's Syntactic Theory of Mind (STM) and a naturalistic narrow content functionalism run on a Language of Though story have the same exact structure. I elaborate on the argument that narrow content functionalism is either irremediably holistic in a rather destructive sense, or else doesn't have the resources for individuating contents interpersonally. So I show that, contrary to his own advertisement, Stich's STM has exactly the same problems (like holism, vagueness, observer-relativity, etc.) that he claims plague content-based (...) psychologies. So STM can't be any better than the Representational Theory of Mind (RTM) in its prospects for forming the foundations of a scientifically respectable psychology, whether or not RTM has the problems that Stich claims it does. (shrink)
After some background setting in which it is shown how Maudlin's (1989, 1990) response to the hole argument of Earman and Norton (1987) is related to that of Rynasiewicz (1994), it is argued that the syntactic proposals of Mundy (1992) and of Leeds (1995), which claim to dismiss the hole argument as an uninteresting blunder, are inadequate. This leads to a discussion of how the responses of Maudlin and Rynasiewicz relate to issues about gauge freedom and relativity principles.
During the past several decades, linguists have developed and applied widely techniques which enable them, to a considerable extent, to determine and state the structure of natural languages without semantic reference. It is of interest to inquire seriously into the formality of linguistic method and the adequacy of whatever part of it can be made purely formal, and to examine the possibilities of applying it, as has occasionally been suggested,s to a wider range of problems. In order to pursue these (...) aims it is first necessary to reconstruct carefully the set of procedures by which the linguist derives the statements of a linguistic grammar from the behaviour of language users, distinguishing clearly between formal and experimental in such a way that grammatical notions, appearing as definienda in a constructional system, wM be formally derivable for any language from a fixed sample of linguistic material upon which the primitives of the system are experimentally defined. The present paper will be an attempt to formalize a certain parts of the linguist's generalized syntax language. From another point of view, this paper is an attempt to develop an adequate notion of syntactic category within an inscriptional nominalistic framework. The inscriptional approach seems natural for linguistics, particularly in view of the fact that an adequate extension of the results of this paper will have to deal with the problem of homonymity, i.e., with a statement of the conditions under which tokens of the same type must be assigned to different syntactic classes. It will appear below that the calculus of individuals can often supply quite simple solutions to constructional.. (shrink)
In "Representations without Rules, Connectionism and the Syntactic Argument'', Kenneth Aizawa argues against the view that connectionist nets can be understood as processing representations without the use of representation-level rules, and he provides a positive characterization of how to interpret connectionist nets as following representation-level rules. He takes Terry Horgan and John Tienson to be the targets of his critique. The present paper marshals functional and methodological considerations, gleaned from the practice of cognitive modelling, to argue against Aizawa's characterization of (...) how connectionist nets may be understood as making use of representation-level rules. (shrink)
This paper proposes an architecture for the mapping between syntax and phonology — in particular, that aspect of phonology that determines ordering. In Fox and Pesetsky (in prep.), we will argue that this architecture, when combined with a general theory of syntactic domains ("phases"), provides a new understanding of a variety of phenomena that have received diverse accounts in the literature. This shorter paper focuses on two processes, both drawn from Scandinavian: the familiar process of Object Shift and the less (...) well-known process of Quantifier Movement. We will argue that constraints on these operations can be seen as instances of the same property of grammar that explains the fact that movement is local and successive cyclic. We begin by sketching a model in which locality and successive cyclicity are consequences of the architecture that we propose, rather than specific facts about movement itself. We next present our proposal in somewhat greater detail, and show how it can account for a wide range of apparent limitations on movement — in particular, superficially contradictory restrictions on Object Shift and Quantifier Movement. The restrictions on Object Shift include those grouped under the rubric of Holmberg's Generalization, which Quantifier Movement does not seem to obey. We will argue that Quantifier Movement instead obeys a near mirror-image of Holmberg's Generalization (an "Inverse Holmberg Effect"), but that both Holmberg's Generalization and its mirror image are expected if our proposed architecture is correct. (shrink)
Syntactic Reductionism, as understood here, is the view that the ‘logical forms’ of sentences in which reference to abstract objects appears to be made are misleading so that, on analysis, we can see that no expressions which even purport to refer to abstract objects are present in such sentences. After exploring the motivation for such a view, and arguing that no previous argument against it succeeds, sentences involving generalized quantifiers, such as ‘most’, are examined. It is then argued, on this (...) basis, that Syntactic Reductionism is untenable. (shrink)
In this article I defend the view that many central aspects of the semantics of tense are determined by independently-motivated principles of syntactic theory. I begin by decomposing tenses syntactically into a temporal ordering predicate (the true tense, on this approach) and two time-denoting arguments corresponding to covert a reference time (RT) argument and an eventuality time (ET) argument containing the verb phrase. Control theory accounts for the denotation of the RT argument, deriving the distinction between main clause and subordinate (...) clause tenses. The theory of covert movement is used to account for the independent/indexical interpretation of relative clause tenses, and for the correlation between independent tense interpretation and a de re construal of the relative clause. A theory of “past polarity”, based on traditional negative polarity theory, accounts both for the simultaneous “sequence of tense” construal of past tenses in subordinate clauses embedded within past tense contexts, and for the obligatory indexical/independent interpretation of present tense in a relative clause embedded within a past tense context. Combined with the copy theory of movement, the polarity theory also provides an account of the semantics of double access sentences, treating them as involving a special kind of reconstruction effect. (shrink)
Syntacticians have proposed three-dimensional syntactic structures to account for the peculiarities of coordination. This paper proposes a way of interpreting such structures and gives an account of sentences of the sort 'John bought and Mary sold a total of ten cars' based on a notion of 'implicit' coordination.
Halvorson (2012) argues that the semantic view of theories leads to absurdities. Glymour (2013) shows how to inoculate the semantic view against Halvorson's criticisms, namely by making it into a syntactic view of theories. I argue that this modified semantic-syntactic view cannot do the philosophical work that the original "language-free" semantic view was supposed to do.
The psycholinguistic literature has identified two syntactic adaptation effects in language production: rapidly decaying short-term priming and long-lasting adaptation. To explain both effects, we present an ACT-R model of syntactic priming based on a wide-coverage, lexicalized syntactic theory that explains priming as facilitation of lexical access. In this model, two well-established ACT-R mechanisms, base-level learning and spreading activation, account for long-term adaptation and short-term priming, respectively. Our model simulates incremental language production and in a series of modeling studies, we show (...) that it accounts for (a) the inverse frequency interaction; (b) the absence of a decay in long-term priming; and (c) the cumulativity of long-term adaptation. The model also explains the lexical boost effect and the fact that it only applies to short-term priming. We also present corpus data that verify a prediction of the model, that is, that the lexical boost affects all lexical material, rather than just heads. (shrink)
Our first aim in this paper is to respond to four novel objections in Jason Stanley’s ‘Context and Logical Form’. Taken together, those objections attempt to debunk our prior claims that one can perform a genuine speech act by using a subsentential expression—where by ‘sub-sentential expression’ we mean an ordinary word or phrase, not embedded in any larger syntactic structure. Our second aim is to make it plausible that, pace Stanley, there really are pragmatic determinants of the literal truthconditional content (...) of speech acts. We hope to achieve this second aim precisely by defending the genuineness of sub-sentential speech acts. Given our two aims, it is necessary to highlight briefly their connection—which we do in the first part of the Introduction. Following that, we introduce Stanley’s novel objections. This is the role of the second part of the Introduction. We offer our rebuttals in Section 2 (against ‘shorthand’) and Section 3 (against syntactic ellipsis, among other things). (shrink)
The present paper is the result of a long struggle to understand how the notion of compositionality can be used to motivate the structure of a sentence. While everyone seems to have intuitions about which proposals are compositional and which ones are not, these intuitions generally have no formal basis. What is needed to make such arguments work is a proper understanding of what meanings are and how they can be manipulated. In particular, we need a definition of meaning that (...) bans all mentioning of syntactic structure; it is not the task of semantics to state in which way things are put together in syntax. The present paper presents such a theory of meaning. This, in tandem with some minimal assumptions on the syntactic process (that there can be no deletion) yield surprisingly deep insights into natural language. First, it rehabilitates a lot of linguistic work as necessary on semantic grounds and defends it against potential claims of redundancy. For example, θ-roles and linking are an integral part of semantics, and not syntax. To assume the latter is to put the cart before the horse. Second, as a particular example we shall show that Dutch is not strongly context free even if weakly context free. To our knowledge, this is the first formal proof of this fact. (shrink)
Levelt, Roelofs, & Meyer (henceforth Levelt et al. 1999) propose a model of production incorporating a lemma stratum, which is concerned with the syntactic characteristics of lexical entries. We suggest that syntactic priming experiments provide evidence about how such syntactic information is represented, and that this evidence can be used to extend Levelt et al.'s model. Evidence from syntactic priming experiments also supports Levelt et al.'s conjecture that the lemma stratum is shared between the production and comprehension systems.
This paper proposes an architecture for the mapping between syntax and phonology — in particular, that aspect of phonology that determines ordering. In Fox and Pesetsky (in prep.), we will argue that this architecture, when combined with a general theory of syntactic domains ("phases"), provides a new understanding of a variety of phenomena that have received diverse accounts in the literature. This shorter paper focuses on two processes, both drawn from Scandinavian: the familiar process of Object Shift and the less (...) well-known process of Quantifier Movement. We will argue that constraints on these operations can be seen as instances of the same property of grammar that explains the fact that movement is local and successive cyclic. We begin by sketching a model in which locality and successive cyclicity are consequences of the architecture that we propose, rather than specific facts about movement itself. We next present our proposal in somewhat greater detail, and show how it can account for a wide range of apparent limitations on movement — in particular, superficially contradictory restrictions on Object Shift and Quantifier Movement. The restrictions on Object Shift include those grouped under the rubric of Holmberg's Generalization, which Quantifier Movement does not seem to obey. We will argue that Quantifier Movement instead obeys a near mirror-image of Holmberg's Generalization (an "Inverse Holmberg Effect"), but that both Holmberg's Generalization and its mirror image are expected if our proposed architecture is correct. (shrink)
How can one conceive of the neuronal implementation of the processing model we proposed in our target article? In his commentary (Pulvermüller 1999, reprinted here in this issue), Pulvermüller makes various proposals concerning the underlying neural mechanisms and their potential localizations in the brain. These proposals demonstrate the compatibility of our processing model and current neuroscience. We add further evidence on details of localization based on a recent meta-analysis of neuroimaging studies of word production (Indefrey & Levelt 2000). We also (...) express some minor disagreements with respect to Pulvermüller's interpretation of the “lemma” notion, and concerning his neural modeling of phonological code retrieval. Branigan & Pickering discuss important aspects of syntactic encoding, which was not the topic of the target article. We discuss their well-taken proposal that multiple syntactic frames for a single verb lemma are represented as independent nodes, which can be shared with other verbs, such as accounting for syntactic priming in speech production. We also discuss how, in principle, the alternative multiple-frame-multiple-lemma account can be tested empirically. The available evidence does not seem to support that account. Footnotes1 BBS Note: The original manuscript of this Response article was received on January 14, 2000. (shrink)
Syntactical treatments of propositional attitudes are attractive to artificial intelligence researchers. But results of Montague (1974) and Thomason (1980) seem to show that syntactical treatments are not viable. They show that if representation languages are sufficiently expressive, then axiom schemes characterizing knowledge and belief give rise to paradox. Des Rivières and Levesque (1988) characterize a class of sentences within which these schemes can safely be instantiated. These sentences do not quantify over the propositional objects of knowledge and belief. We argue (...) that their solution is incomplete, and extend it by characterizing a more inclusive class of sentences over which the axiom schemes can safely range. Our sentences do quantify over propositional objects. (shrink)
We give a syntactic translation from first-order intuitionistic predicate logic into second-order intuitionistic propositional logic IPC2. The translation covers the full set of logical connectives ∧, ∨, →, ⊥, ∀, and ∃, extending our previous work, which studied the significantly simpler case of the universal-implicational fragment of predicate logic. As corollaries of our approach, we obtain simple proofs of nondefinability of ∃ from the propositional connectives and nondefinability of ∀ from ∃ in the second-order intuitionistic propositional logic. We also show (...) that the ∀-free fragment of IPC2 is undecidable. (shrink)
We define notions of homomorphism, submodel, and sandwich of Kripke models, and we define two syntactic operators analogous to universal and existential closure. Then we prove an intuitionistic analogue of the generalized (dual of the) Lyndon-Łoś-Tarski Theorem, which characterizes the sentences preserved under inverse images of homomorphisms of Kripke models, an intuitionistic analogue of the generalized Łoś-Tarski Theorem, which characterizes the sentences preserved under submodels of Kripke models, and an intuitionistic analogue of the generalized Keisler Sandwich Theorem, which characterizes the (...) sentences preserved under sandwiches of Kripke models. We also define several intuitionistic formula hierarchies analogous to the classical formula hierarchies $\forall_n (= \Pi^0_n)$ and $\exists_n (=\Sigma^0_n)$ , and we show how our generalized syntactic preservation theorems specialize to these hierarchies. Each of these theorems implies the corresponding classical theorem in the case where the Kripke models force classical logic. (shrink)
We consider strategic-form games with ordinal payoffs and provide a syntactic analysis of common belief/knowledge of rationality, which we define axiomatically. Two axioms are considered. The first says that a player is irrational if she chooses a particular strategy while believing that another strategy is better. We show that common belief of this weak notion of rationality characterizes the iterated deletion of pure strategies that are strictly dominated by pure strategies. The second axiom says that a player is irrational if (...) she chooses a particular strategy while believing that a different strategy is at least as good and she considers it possible that this alternative strategy is actually better than the chosen one. We show that common knowledge of this stronger notion of rationality characterizes the restriction to pure strategies of the iterated deletion procedure introduced by Stalnaker (1994). Frame characterization results are also provided. (shrink)
Paul Horwich (1998), following a number of others, proposes a schematic compositional format for the specification of the meanings of complex expressions. The format is schematic in the sense that it identifies grammatical schemata that do not presuppose any particular account of primitive word meanings: whatever the nature of meanings, the application of the schemata to them will serve to explain compositionality. This signals, for Horwich, that compositionality is a non-substantive constraint on theories of meaning. Drawing on a range of (...) linguistic data, the present paper argues that while the bare idea of compositionality indeed does not presuppose any account of meaning, Horwich's format is empirically inadequate. The argument here goes back to Chomsky's early position on the descriptive inadequacy of rewrite grammars and the consequent need for transformations. It will also be seen that the data militates for a general claim that meaning relevant structure is projected from words rather than imposed on them schematically. Finally, it will be indicated how this reasoning from syntactic considerations is flush with a more traditional philosophical understanding of compositionality. (shrink)
Chomsky’s highly influential Syntactic Structures ( SS ) has been much praised its originality, explicitness, and relevance for subsequent cognitive science. Such claims are greatly overstated. SS contains no proof that English is beyond the power of finite state description (it is not clear that Chomsky ever gave a sound mathematical argument for that claim). The approach advocated by SS springs directly out of the work of the mathematical logician Emil Post on formalizing proof, but few linguists are aware of (...) this, because Post’s papers are not cited. Chomsky’s extensions to Post’s systems are not clearly defined, and the arguments for their necessity are weak. Linguists have also overlooked Post’s proofs of the first two theorems about effects of rule format restrictions on generative capacity, published more than ten years before SS was published. (shrink)
Grodzinsky's Tree-Pruning Hypothesis can be extended to explain agrammatic comprehension disorders. Although agrammatism is evidence for syntactic modularity, there is no evidence for its anatomical modularity or for its localization in the frontal lobe. Agrammatism results from diffuse left hemisphere damage – allowing the emergence of the limited right hemisphere linguistic competence – rather than from damage to an anatomic module in the left hemisphere.
One of the major arenas for debate within generative grammar is the nature of paradigmatic relations among words. Intervening in key debates at the interface between syntax and semantics, this book examines the relation between structure and meaning, and analyses how it affects the internal properties of words and corresponding syntactic manifestations. Adapting notions from the Evo-Devo project in biology (the idea of 'co-linearity' between structural units and behavioural manifestations) Juan Uriagereka addresses a major puzzle: how words can be both (...) decomposable so as to be acquired by children, and atomic, so that they do not manifest themselves as modular to adults. (shrink)
This commentary discusses the relation between Grodzinsky's target article and Friederici's (1995) model of syntactic processing. The two models can be made more compatible if it is assumed that people with Broca's aphasia have a problem in trace construction rather than trace deletion, and that the process of trace construction takes place during the second early syntactic substage of Friederici's model.
This paper introduces the notion of syntactic feature to provide a unified treatment of earlier model theoretic proofs of both the compactness and interpolation theorems for a variety of two valued logics including sentential logic, first order logic, and a family of modal sentential logic includingM,B,S 4 andS 5. The compactness papers focused on providing a proof of the consequence formulation which exhibited the appropriate finite subset. A unified presentation of these proofs is given by isolating their essential feature and (...) presenting it as an abstract principle about syntactic features. The interpolation papers focused on exhibiting the interpolant. A unified presentation of these proofs is given by isolating their essential feature and presenting it as a second abstract principle about syntactic features. This second principle reduces the problem of exhibiting the interpolant to that of establishing the existence of a family of syntactic features satisfying certain conditions. The existence of such features is established for a variety of logics (including those mentioned above) by purely combinatorial arguments. (shrink)
The aim of this study is to look at the the syntactic calculus of Bar-Hillel and Lambek, including semantic interpretation, from the point of view of constructive type theory. The syntactic calculus is given a formalization that makes it possible to implement it in a type-theoretical proof editor. Such an implementation combines formal syntax and formal semantics, and makes the type-theoretical tools of automatic and interactive reasoning available in grammar.In the formalization, the use of the dependent types of constructive type (...) theory is essential. Dependent types are already needed in the semantics of ordinary Lambek calculus. But they also suggest some natural extensions of the calculus, which are applied to the treatment of morphosyntactic dependencies and to an analysis of selectional restrictions. Finally, directed dependent function types are introduced, corresponding to the types of constructive type theory. (shrink)
Computer simulations show that an unstructured neural-network model [Shultz, T. R., & Bale, A. C. (2001). Infancy, 2, 501–536] covers the essential features␣of infant learning of simple grammars in an artificial language [Marcus, G. F., Vijayan, S., Bandi Rao, S., & Vishton, P. M. (1999). Science, 283, 77–80], and generalizes to examples both outside and inside of the range of training sentences. Knowledge-representation analyses confirm that these networks discover that duplicate words in the sentences are nearly identical and that they (...) use this near-identity relation to distinguish sentences that are consistent or inconsistent with a familiar grammar. Recent simulations that were claimed to show that this model did not really learn these grammars [Vilcu, M., & Hadley, R. F. (2005). Minds and Machines, 15, 359–382] confounded syntactic types with speech sounds and did not perform standard statistical tests of results. (shrink)
In this paper the PA-completeness of modal logic is studied by syntactical and constructive methods. The main results are theorems on the structure of the PA-proofs of suitable arithmetical interpretationsS of a modal sequentS, which allow the transformation of PA-proofs ofS into proof-trees similar to modal proof-trees. As an application of such theorems, a proof of Solovay's theorem on arithmetical completeness of the modal system G is presented for the class of modal sequents of Boolean combinations of formulas of the (...) form p i,m i=0, 1, 2, ... The paper is the preliminary step for a forthcoming global syntactical resolution of the PA-completeness problem for modal logic. (shrink)
Various laws and theories in the natural and social sciences are presented with a view to discerning the syntactic and semantic characteristics of many idealizations in science. Three different kinds of idealizations are discussed: ideal conditions, ideal cases, and idealized theories. An ideal condition is a formula in which state variables occur, whose existential closure is false, and for which there is another formula that can be constructed out of the original formula such that the existential closure of the new (...) formula is true. An ideal case is a statement which is logically equivalent to a universal conditional which has an ideal condition as its antecedent. And an idealized theory is a set of false universal conditional statements. Alternative syntactic and semantic analyses are viewed and criticized. (shrink)
In Syntactical Treatments of Modality, with Corollaries on Reflexion Principles and Finite Axiomatizability, Acta Philosophica Fennica 16 (1963), 153–167, Richard Montague shows that the use of a single syntactic predicate (with a context-independent semantic value) to represent modalities of alethic necessity and idealized knowledge leads to inconsistency. In A Note on Syntactical Treatments of Modality, Synthese 44 (1980), 391–395, Richmond Thomason obtains a similar impossibility result for idealized belief: under a syntactical treatment of belief, the assumption that idealized belief is (...) deductively closed, together with certain other plausible conditions on idealized belief, imply that an ideal believer with consistent beliefs cannot believe the truth of Robinson''s Arithmetic. In this essay I show that an impossibility result similar to Thomason''s can be obtained which does not assume that belief is deductively closed or ideal in any other way. (shrink)
The distributional principle according to which morphemes that occur in identical contexts belong, in some sense, to the same category [1] has been advanced as a means for extracting syntactic structures from corpus data. We extend this principle by applying it recursively, and by using mutual information for estimating category coherence. The resulting model learns, in an unsupervised fashion, highly structured, distributed representations of syntactic knowledge from corpora. It also exhibits promising behavior in tasks usually thought to require representations anchored (...) in a grammar, such as systematicity. (shrink)
We say that a semantical function is correlated with a syntactical function F iff for any structure A and any sentence we have A F A .It is proved that for a syntactical function F there is a semantical function correlated with F iff F preserves propositional connectives up to logical equivalence. For a semantical function there is a syntactical function F correlated with iff for any finitely axiomatizable class X the class –1X is also finitely axiomatizable (i.e. iff is (...) continuous in model class topology). (shrink)
The aim of the present paper is to provide a model-theoretic explication of Nelson Goodman’s concept of extensional isomorphism. The term "extensional isomorphism" has been informally introduced by Nelson Goodman in the beginning paragraph of his The Structure of Appearance. After some conceptual clarications Goodman’s concept of isomorphy turns out to be closely related to some variant of set-theoretic denability and some variants of syntactical interpretability.
The syntactic priority thesis (henceforth SP) asserts that the truth of appropriate sentential contexts containing what are, by syntactic criteria, singular terms, is sufficient to justify the attribution of objectual reference to such terms (Wright, 1983, 24). One consequence that the neo-Fregean draws from SP is that it is through an analysis of the syntactic structure of true statements that 'ontological questions are to be understood and settled' (Wright, 1983, 25). Despite the significant literature on SP, little consideration has been (...) given to this bold meta-ontological claim.1 My concern here is accordingly not with specific applications of SP to debates in the philosophy of mathematics, but rather with the .. (shrink)
Scalp-recorded event-related potential (ERP) measures of reading and listening have been proved more sensitive to the time course of syntactic processing than the chronometric and behavioral data described by Caplan & Waters. ERP studies using sentences containing relative clauses indicate that there are individual differences in syntactic processing that appear at the earliest theoretically relevant time points and are attributable to working memory operations.
A promising approach to more refined models consistent with the Caplan & Waters hypothesis is based on similarity-based interference, a general principle that applies across working memory domains. This may explain both the fine details of syntactic working memory phenomena and the gross fractionation for which Caplan & Waters have found evidence. Detailed models of syntactic processing that embody similarity-based interference fare well cross-linguistically.
In this paper we report preliminary results on how people revise or update a previously held set of beliefs. When intelligent agents learn new things which conflict with their current belief set, they must revise their belief set. When the new information does not conflict, they merely must update their belief set. Various AI theories have been proposed to achieve these processes. There are two general dimensions along which these theories differ: whether they are syntactic-based or model-based, and what constitutes (...) a minimal change of beliefs. This study investigates how people update and revise semantically equivalent but syntactically distinct belief sets, both in symbolic-logic problems and in quasi-real-world problems. Results indicate that syntactic form affects belief revision choices. In addition, for the symbolic problems, subjects update and revise semantically-equivalent belief sets identically, whereas for the quasi-real-world problems they both update and revise differently. Further, contrary to earlier studies, subjects are sometimes reluctant to accept that a sentence changes from false to true, but they are willing to accept that it would change from true to false. (shrink)
While the search for the neural basis of the language of thought is a laudable enterprise, and the article by Hurford a valiant first attempt, we argue that in investigating the argument structure of natural language it will ultimately prove more fruitful to consider the restrictions forced on the system by its inherently syntactic character.
The focus of this paper is Derrida's idea of rhythm. I will analyse how the idea of rhythm can work in a contemporary semiotic, and in particular in a semiotic of interpretation, in order to eliminate the confusion between interpretation and semantics and to constitute a syntactic model of interpretation. In ‘The Double Session’ Derrida uses the Greek word rytmos in order to indicate the ‘law of spacing’. Rytmos is a form that is always about to change or to break (...) up, because it is not a definitive form. It is a not-proper form. But when I say here that a rhythmic relation is a not-proper form, the word ‘proper’ is intended in the sense of Heidegger's Eigentlichkeit. In this sense a not-proper relation is a relation which is not grounded on a justification. What I'm trying to demonstrate in this essay is that the rhythmic relation discovers another sense of the word ‘proper’, another meaning, which is far from Heidegger's Eigentlichkeit. In this sense, it is possible to say that the problem of a rhythmic relation is the problem of a relation between ‘two’ that is not justified by the third element which makes it proper or eigentlich. (shrink)
In [4], I proved that the product-free fragment L of Lambek's syntactic calculus (cf. Lambek [2]) is not finitely axiomatizable if the only rule of inference admitted is Lambek's cut-rule. The proof (which is rather complicated and roundabout) was subsequently adapted by Kandulski [1] to the non-associative variant NL of L (cf. Lambek [3]). It turns out, however, that there exists an extremely simple method of non-finite-axiomatizability proofs which works uniformly for different subsystems of L (in particular, for NL). We (...) present it below to the use of those who refer to the results of [1] and [4]. (shrink)
We introduce a notion of syntactical truth predicate (s.t.p.) for the second order arithmetic PA 2 . An s.t.p. is a set T of closed formulas such that: (i) T(t = u) if and only if the closed first order terms t and u are convertible, i.e., have the same value in the standard interpretation (ii) T(A → B) if and only if (T(A) $\Longrightarrow$ T(B)) (iii) T(∀ x A) if and only if (T(A[x ← t]) for any closed first (...) order term t) (iv) T(∀ X A) if and only if (T(A[X ←▵]) for any closed set definition $\triangle = \{x \mid D(x)\}$ ). S.t.p.'s can be seen as a counterpart to Tarski's notion of (model-theoretical) validity and have main model properties. In particular, their existence is equivalent to the existence of an ω-model of PA 2 , this fact being provable in PA 2 with arithmetical comprehension only. (shrink)
This paper is the second part of the syntactic demonstration of the Arithmetical Completeness of the modal system G, the first part of which is presented in [9]. Given a sequent S so that ⊢GL-LIN S, ⊬G S, and given its characteristic formula H = char(S), which expresses the non G-provability of S, we construct a canonical proof-tree T of ~ H in GL-LIN, the height of which is the distance d(S, G) of S from G. T is the syntactic (...) countermodel of S with respect to Gand is a tool of general interest in Provability Logic, that allows some classification in the set of the arithmetical interpretations. (shrink)
An axiomatics of the product-free syntactic calculus L ofLambek has been presented whose only rule is the cut rule. It was alsoproved that there is no finite axiomatics of that kind. The proofs weresubsequently simplified. Analogous results for the nonassociativevariant NL of L were obtained by Kandulski. InLambek's original version of the calculus, sequent antecedents arerequired to be nonempty. By removing this restriction, we obtain theextensions L 0 and NL 0 ofL and NL, respectively. Later, the finiteaxiomatization problem for L (...) 0 andNL 0 was partially solved, viz., for formulas withoutleft (or, equivalently, right) division and an (infinite) cut-ruleaxiomatics for the whole of L 0 has been given. Thepresent paper yields an analogous axiomatics forNL 0. Like in the author's previous work, the notionof rank of an axiom is introduced which, although inessentialfor the results given below, may be useful for the expectednonfinite-axiomatizability proof. (shrink)
Is native speaker variation in understanding complex sentences due to individual differences in working memory capacity or in syntactic competence? The answer to this question has very important consequences for both theoretical and applied concerns in linguistics and education. This book is distinctive in giving an historical and interdisciplinary perspective on the rule- based and experience-based debate and in supporting an integrated account. In the study reported here, variation was found to be due to differences in syntactic competence and the (...) author argues that sentence comprehension is a learned skill, displaying many of the general characteristics of cognitive skills. The book will be stimulating reading for psycholinguists, theoretical linguists, applied linguists and educators. (shrink)
In this paper, I develop a syntactic framework for the analysis ofstrategic form games that is based on a straightforward combination ofstandard systems of doxastic, probabilistic and conditionalpropositional logic. In particular, for the probabilistic part I makeuse of the axiomatization provided in Fagin and Halpern (1994). The use ofconditionals allows to represent a strategic form game by a logicalformula in a very natural way. Also expected utility maximization can benaturally captured. I use this framework to prove a version of a (...) resulton Nash equilibrium conjectures first presented in Aumann and Brandenburger (1995). (shrink)
Construction-based approaches to syntax (Croft, 2001; Goldberg, 2003) posit a lexicon populated by units of various sizes, as envisaged by (Langacker, 1987). Constructions may be specified completely, as in the case of simple morphemes or idioms such as take it to the bank, or partially, as in the expression what’s X doing Y?, where X and Y are slots that admit fillers of particular types (Kay and Fillmore, 1999). Constructions offer an intriguing alternative to traditional rule-based syntax by hinting at (...) the extent to which the complexity of language can stem from a rich repertoire of stored, more or less entrenched (Harris, 1998) representations that address both syntactic and semantic issues, and encompass, in addition to general rules, “totally idiosyncratic forms and patterns of all intermediate degrees of generality” (Langacker, 1987, p.46). Because constructions are by their very nature language-specific, the question of acquisition in Construction Grammar is especially poignant. We address this issue by offering an unsupervised algorithm that learns constructions from raw corpora. (shrink)
The notion that the working-memory system is not to be located in the prefrontal cortex, but rather constituted by the interplay between temporal and frontal areas, is of some attraction. However, at least for the domain of sentence comprehension, this perspective is promoted on the basis of sparse data. For this domain, the authors not only missed out on the chance to systematically integrate event-related brain potential (ERP) and neuroimaging data when interpreting their own findings on semantic aspects of working (...) memory, but also neglected syntactic aspects of working memory and computation altogether. (shrink)
This paper is the final part of the syntactic demonstration of the Arithmetical Completeness of the modal system G; in the preceding parts [9] and [10] the tools for the proof were defined, in particular the notion of syntactic countermodel. Our strategy is: PA-completeness of G as a search for interpretations which force the distance between G and a GL-LIN-theorem to zero. If the GL-LIN-theorem S is not a G-theorem, we construct a formula H expressing the non G-provability of S, (...) so that ⊢GL-LIN ∼ H and so that a canonical proof T of ∼ H in GL-LIN is a syntactic countermodel for S with respect to G, which has the height θ(T) equal to the distance d(S, G) of S from G. Then we define the interpretation ξ of S which represents the proof-tree T in PA. By induction on θ(T), we prove that ⊢PA Sξ and d(S, G) > 0 imply the inconsistency of PA. (shrink)
In this note, we will study four implicational logicsB, BI, BB and BBI. In [5], Martin and Meyer proved that a formula is provable inBB if and only if is provable inBBI and is not of the form of » . Though it gave a positive solution to theP - W problem, their method was semantical and not easy to grasp. We shall give a syntactical proof of the syntactical relation betweenBB andBBI logics. It also includes a syntactical proof of (...) Powers and Dwyer's theorem that is proved semantically in [5]. Moreover, we shall establish the same relation betweenB andBI logics asBB andBBI logics. This relation seems to say thatB logic is meaningful, and so we think thatB logic is the weakest among meaningful logics. Therefore, by Theorem 1.1, our Gentzentype system forBI logic may be regarded as the most basic among all meaningful logics. It should be mentioned here that the first syntactical proof ofP - W problem is given by Misao Nagayama [6]. (shrink)
A study on minimalist syntax develops an empirical argument for a crash-proof computational system. A crash-proof system is obtained if syntactic dependencies are strictly local (i.e. there is no long-distance Agree). Apparent long-distance dependencies turn out to be the outcome of a recursive chain on local complex dependencies. This framework allows for novel analyses of quirky subjects in Icelandic and Spanish, indefinite SE in Spanish and different types of expletive constructions in English, French, German, Spanish, Italian, and Icelandic.
Language development remains one of the most hotly debated topics in the cognitive sciences. In recent years we have seen contributions to the debate from researchers in psychology, linguistics, artificial intelligence, and philosophy, though there have been surprisingly few interdisciplinary attempts at unifying the various theories. In Language and the Learning Curve, a leading researcher in the field offers a radical new view of language development. Drawing on formal linguistic theory (the Minimalist Program, Dependency Grammars), cognitive psychology (Skill Learning) computational (...) linguistics (Zipf curves), and Complexity Theory (networks), it takes the view that syntactic development is a simple process and that syntax can be learned just like any other cognitive or motor skill. -/- In a thought provoking and accessible style, it develops a learning theory of the acquisition of syntax that builds on the contribution of the different source theories in a detailed and explicit manner. Each chapter starts by laying the relevant theoretical background, before examining empirical data on child language acquisition. The result is a bold new theory of the acquisition of syntax, unusual in its combination of Chomskian linguistics and learning theory. Language and the Learning Curve is an important new work that challenges many of our usual assumptions about syntactic development. (shrink)
ABSTRACT. Fodor characterizes concepts as consisting of two dimensions: one is content, which is purely denotational/broad, the other the Mentalese vehicle bearing that content, which Fodor calls the Mode of Presentation (MOP), understood "syntactically." I argue that, so understood, concepts are not interpersonally sharable; so Fodor's own account violates what he calls the Publicity Constraint in his (1998) book. Furthermore, I argue that Fodor's non-semantic, or "syntactic," solution to Frege cases succumbs to the problem of providing interpersonally applicable functional roles (...) for MOPs. This is a serious problem because Fodor himself has argued extensively that if Fregean senses or meanings are understood as functional/conceptual roles, then they can't be public, since, according to Fodor, there are no interpersonally applicable functional roles in the relevant senses. I elaborate on these relevant senses in the paper. (shrink)
Expressivism is most widely known as a thesis that semantically complements non-cognitivism in meta-ethics: if there are no moral facts to be known, if moral judgements or statements are not capable of being true or false, then the meaning of morally evaluative sentences cannot centrally consist in their having a truth conditional content, expressing a truth-evaluable proposition. But since the truth conditional approach to meaning is widely accepted, non-cognitivists are called upon to offer an alternative theory of meaning for moral (...) sentences. What they frequently offer is expressivism, the view that the meaning of moral sentences must be analysed in terms of special kinds of illocutionary act, for the performance of which these sentences serve. To utter the sentence “Gambling is bad.”, for example, is not to assert the truth-evaluable proposition that gambling is bad (there is no such truth-evaluable item), but rather to condemn gambling and thereby to express one’s moral attitude towards gambling. Whether or not “expressivism” is a good label for this view (“speech-act analysis” might be a better one), there are highly analogous views about sentences other than moral ones, which we might conveniently label in the same way. Thus, as there are expressivists about morals, there might be expressivists about truth, about negation, about causality, about taste, about probability, about modality, about conditionals and more. All these views share the combination of two claims: a denial of the truth-evaluability of (the contents of) the sentences in a certain class X combined with a speech-act-analysis to account for the meaning of the sentences in X . So it would seem to be reasonable to assume that expressivism can be discussed in general for variable X. The aim of this paper is to re-examine and to generalise a certain line of objection against expressivisms, a line prominently taken by Searle (1969) and Geach (1960, 1965).. (shrink)
John Searle once said: "The Chinese room shows what we knew all along: syntax by itself is not sufficient for semantics. (Does anyone actually deny this point, I mean straight out? Is anyone actually willing to say, straight out, that they think that syntax, in the sense of formal symbols, is really the same as semantic content, in the sense of meanings, thought contents, understanding, etc.?)." I say: "Yes". Stuart C. Shapiro has said: "Does that make any sense? Yes: Everything (...) makes sense. The question is: What sense does it make?" This essay explores what sense it makes to say that syntax by itself is sufficient for semantics. (shrink)
There is a thesis often aired by some philosophers of psychology that syntax is all we need and there is no need to advert to intentional/semantic properties of symbols for purposes of psychological explanation. Indeed, the worry has been present since the first explicit articulation of so-called Computational Theory of Mind (CTM). Even Fodor, who has been the most ardent defender of the Language of Thought Hypoth- esis (LOTH) (which requires the CTM), has raised worries about its apparent consequences. The (...) worry can be put in the form of a question, which Fodor called the. (shrink)
The property of being the implementation of a computational structure has been argued to be vacuously instantiated. This claim provides the basis for most antirealist arguments in the field of the philosophy of computation. Standard manoeuvres for combating these antirealist arguments treat the problem as endogenous to computational theories. The contrastive analysis of computational and other mathematical representations put forward here reveals that the problem should instead be treated within the more general framework of the Newman problem in structuralist accounts (...) of mathematical representation. It is argued that purely structuralist and purely functionalist accounts of implementation are inadequate to tackle the problem. An extensive evaluation of semantic accounts is provided, arguing that semantic properties are, unlike structural and functional ones, suitable to restrict the intended domain of implementation of computational properties in such a way as to block the Newman problem. The semantic hypothesis is defended from a number of recent objections. (shrink)
There is no doubt that social interaction plays an important role in language-learning, as well as in concept acquisition. In surprising contrast, social interaction makes only passing appearance in our most promising naturalistic theories of content. This is particularly true in the case of mental content (e.g., Cummins, 1996; Dretske, 1981, 1988; Fodor, 1987, 1990a; Millikan, 1984); and insofar as linguistic content derives from mental content (Grice, 1957), social interaction seems missing from our best naturalistic theories of both.1 In this (...) paper, I explore the ways in which even the most individualistic of theories of mental content can, and should, accommodate social effects. I focus especially on the way in which inferential relations, including those that are socially taught, influence language-learning and concept acquisition. I argue that these factors affect the way subjects conceive of mental and linguistic content. Such effects have a dark side: the social and inferential processes in question give rise to misleading intuitions about content itself. They create the illusion that content and inferential relations are more deeply intertwined than they actually are. This illusion confounds an otherwise attractive solution to what is known as ‘Frege’s puzzle’ (Salmon, 1986). I.. (shrink)
This essay considers what it means to understand natural language and whether a computer running an artificial-intelligence program designed to understand natural language does in fact do so. It is argued that a certain kind of semantics is needed to understand natural language, that this kind of semantics is mere symbol manipulation (i.e., syntax), and that, hence, it is available to AI systems. Recent arguments by Searle and Dretske to the effect that computers cannot understand natural language are discussed, and (...) a prototype natural-language-understanding system is presented as an illustration. (shrink)
Theme of two lectures: how does meaning work in grammar and lexicon? General question: Are morphemes the minimal meaningful units of language? Are the meanings of the parts of words of the same kind as those of syntax? The answer to this question has an obvious bearing on the question of the derivation of complex words "in the syntax." Is the split between syntax and morphology the proper division for asking the previous question? Answer: No. The crucial distinction is that (...) between grammar and lexicon. Framework: model theoretic semantics and constructive categorial syntax.. (shrink)
In these comments I am going to argue that Yiwei Zheng's paper, by postulating an imaginary mental language in a proposed new interpretation of Ockham's conception of mental language, provides us with an imaginary solution to what turns out to be an imaginary problem. Having said this, however, I hasten to add that the paper has undeniable merits in pointing us in the right direction for revealing the imaginary character of the problem.
The author defends John R. Searle's Chinese Room argument against a particular objection made by William J. Rapaport called the Korean Room. Foundational issues such as the relationship of strong AI to human mentality and the adequacy of the Turing Test are discussed. Through undertaking a Gedankenexperiment similar to Searle's but which meets new specifications given by Rapaport for an AI system, the author argues that Rapaport's objection to Searle does not stand and that Rapaport's arguments seem convincing only because (...) they assume the foundations of strong AI at the outset. (shrink)
W.V. Quine has led many logicians in thinking that mathematical logic can offer insights into the syntax of natural language. One example of such an insight is the use of quantifier scope difference to resolve the ambiguity of sentences like ' I don't know every poem'. Such differences also are claimed to be useful in analyzing phrases such as 'the lady I saw you with'. But an older, Aristotelian theory of logical syntax can equally well resolve the ambiguity problem in (...) terms of term distribution. And it provides a better analysis of 'the lady' phrase by treating quantifiers as subject formatives rather than pronoun binders. (shrink)
