According to the contemporary consensus, when reaching in the lexicon grammar looks for items like nouns, verbs, and prepositions while logic sees items like predicates, connectives, and quantifiers. In fact, there doesn’t seem to be a single lexical category contemporary grammar and logic both make use of. I hope to show that while a perfect match between the lexical categories of grammar and logic is impossible there can be a substantial overlap. I propose semantic definitions for all the major parts (...) of speech . I argue that the differences among these categories can be captured in terms of distinctions recognized in logic. (shrink)

In a recent book, Logical Form: between Logic and Natural Language, Andrea Iacona argues that semantic form and logical form are distinct. The semantic form of a sentence is something that (together with the meanings of its parts) determines what it means; the logical from of a sentence is something that (all by itself) determines whether it is a logical truth. Semantic form does not depend on context but logical form does: for example, whether ‘This is this’ is a logical (...) truth depends on whether the two occurrences of ‘this’ are used to demonstrate the same individual. I respond by claiming that logical form is indifferent to reference and is sensitive only to obligatory co-reference. When the speaker intends both occurrences of ‘this’ to be interpreted the same way the logical from of ‘This is this’ is a=a, while in a context where the speaker has no such intention it is a=b. This proposal allows a much more conservative revision of the traditional picture than the one suggested by Iacona. Instead of identifying the logical form of a natural language sentence by seeking a formalization in an artificial language, we obtain it through abstraction from its syntactic analysis: replacing the non-logical expressions by schematic letters, making sure that we use identical ones if and only if the speaker intended co-reference. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth‐conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the ‘logicality of language’, accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter‐examples consisting of acceptable tautologies and contradictions, the logicality of language is often paired (...) with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is ‘blind’ to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non‐classical—indeed quite exotic—kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis‐á‐vis its open class terms and employs a deductive system that is basically classical. (shrink)

Anti-exceptionalists about logic maintain that it is continuous with the empirical sciences. Taking anti-exceptionalism for granted, we argue that traditional approaches to explanation are inadequate in the case of logic. We argue that Andrea Woody's functional analysis of explanation is a better fit with logical practice and accounts better for the explanatory role of logical theories.

The dominant account of propositions holds that they are structured entities that have, as constituents, the semantic values of the constituents of the sentences that express them. Since such theories hold that propositions are structured, in some sense, like the sentences that express them, they must provide an answer to what I will call Soames’ Question: “What level, or levels, of sentence structure does semantic information incorporate?”. As it turns out, answering Soames’ Question is no easy task. I argue in (...) this paper that the two most promising ways of answering it, the Logical Form Account and the LF Account, are both unsatisfactory. This result casts doubt on the very idea that propositions are structured. (shrink)

Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth-conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the `logicality of language', accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter-examples consisting of acceptable tautologies and contradictions, the logicality of language is often paired (...) with an additional assumption according to which logical forms are radically underspecified: i.e., the language system can see functional terms but is `blind' to open class terms to the extent that different tokens of the same term are treated as if independent. This conception of logical form has profound implications: it suggests an extreme version of the modularity of language, and can only be paired with non-classical---indeed quite exotic---kinds of deductive systems. The aim of this paper is to show that we can pair the logicality of language with a different and ultimately more traditional account of logical form. This framework accounts for the basic acceptability patterns which motivated the logicality of language, can explain why some tautologies and contradictions are acceptable, and makes better predictions in key cases. As a result, we can pursue versions of the logicality of language in frameworks compatible with the view that the language system is not radically modular vis-a-vis its open class terms and employs a deductive system that is basically classical. (shrink)

In this article, I argue that if tacit knowledge of grammar is analyzable in functional‐computational terms, then it cannot ground linguistic meaning, structure, or sound. If to know or cognize a grammar is to be in a certain computational state playing a certain functional role, there can be no unique grammar cognized. Satisfying the functional conditions for cognizing a grammar G entails satisfying those for cognizing many grammars disagreeing with G about expressions' semantic, phonetic, and syntactic values. This threatens the (...) Chomskyan view that expressions have such values for speakers because they cognize grammars assigning them those values. For if this is true, semantics, syntax, and phonology must be indeterminate, thanks to the indeterminacy of grammar‐cognizing (qua functional‐computational state). So, the fact that a speaker cognizes a grammar cannot explain the determinate character of their language. (shrink)

examine Nathan Salmon’s solution to the problem of trivialization, as it arises for conceptions of general term rigidity that construe it as identity of designation across possible worlds. I argue that he does not succeed in showing that some alleged general terms, such as “the colour of the sky” are non-rigid, but also that a small class of different examples that he presents, which can be construed as second order descriptions, are indeed non-rigid general terms, although for reasons different from (...) those he thought. (shrink)