Acceptable analyticities, i.e. contradictions or tautologies, constitute problematic evidence for the idea that language includes a deductive system. In recent discussion, two accounts have been presented in the literature to explain the available evidence. According to one of the accounts, grammatical analyticities are accessible to the system but a pragmatic strengthening repair mechanism can apply and prevent the structures from being actually interpreted as contradictions or tautologies. The proposed data, however, leaves it open whether other versions of the meaning modulation (...) operation are required. Novel evidence we present argues that a loosening version of the repair mechanism must be available. Our observation concerns acceptable lexical contradictions that cannot be rescued if only a strengthening version of the pragmatic strategy is available. (shrink)

Contingent negative existentials give rise to a notorious paradox. I formulate a version in terms of metaphysical grounding: nonexistence can't be fundamental, but nothing can ground it. I then argue for a new kind of solution, expanding on work by Kit Fine. The key idea is that negative existentials are contingently zero-grounded – that is to say, they are grounded, but not by anything, and only in the right conditions. If this is correct, it follows that grounding cannot be an (...) internal relation, and that no complete account of reality can be purely fundamental. (shrink)

A remarkable philosophical affinity may be observed between the intuitionistic conception of mathematics and the transformational generative approach to the study of language: both disciplines profess a mentalistic ontology, both posit an idealized subject, and both insist on their autonomy with respect to other disciplines. This philosophical parallel is formalized in terms of a generalization of the intuitionistic notion of creative subject; resulting are the foundations of a unified theory of mental acts based on intuitionistic logic — capturing, inter alia, (...) similarities between proof acts and speech acts. As an application of the theory, it is then shown how the notion of mental act may provide for an insightful formalization of various hypotheses pertaining to the linguistic dependence or relativity of mathematics. (shrink)

In Pietroski ( 2018 ) a simple representation language called SMPL is introduced, construed as a hypothesis about core conceptual structure. The present work is a study of this system from a logical perspective. In addition to establishing a completeness result and a complexity characterization for reasoning in the system, we also pinpoint its expressive limits, in particular showing that the fourth corner in the square of opposition (“ Some_not ”) eludes expression. We then study a seemingly small extension, called (...) SMPL +, which allows for a minimal predicate-binding operator. Perhaps surprisingly, the resulting system is shown to encode precisely the concepts expressible in first-order logic. However, unlike the latter class, the class of SMPL + expressions admits a simple procedural (context-free) characterization. Our contribution brings together research strands in logic—including natural logic, modal logic, description logic, and hybrid logic—with recent advances in semantics and philosophy of language. (shrink)

This paper explores the relationship between Hume's Prinicple and Basic Law V, investigating the question whether we really do need to suppose that, already in Die Grundlagen, Frege intended that HP should be justified by its derivation from Law V.

In this paper, a critical discussion is made of the role of entailments in the so-called New Paradigm of psychology of reasoning based on Bayesian models of rationality (Elqayam & Over, 2013). It is argued that assessments of probabilistic coherence cannot stand on their own, but that they need to be integrated with empirical studies of intuitive entailment judgments. This need is motivated not just by the requirements of probability theory itself, but also by a need to enhance the interdisciplinary (...) integration of the psychology of reasoning with formal semantics in linguistics. The constructive goal of the paper is to introduce a new experimental paradigm, called the Dialogical Entailment task, to supplement current trends in the psychology of reasoning towards investigating knowledge-rich, social reasoning under uncertainty (Oaksford and Chater, 2019). As a case study, this experimental paradigm is applied to reasoning with conditionals and negation operators (e.g. CEM, wide and narrow negation). As part of the investigation, participants’ entailment judgments are evaluated against their probability evaluations to assess participants’ cross-task consistency over two experimental sessions. (shrink)

Paul M. Pietroski, University of Maryland For any sentence of a natural language, we can ask the following questions: what is its meaning; what is its syntactic structure; and how is its meaning related to its syntactic structure? Attending to these questions, as they apply to sentences that provide evidence for Davidsonian event analyses, suggests that we reconsider some traditional views about how the syntax of a natural sentence is related to its meaning.

Paul M. Pietroski, University of Maryland I had heard it said that Chomsky’s conception of language is at odds with the truth-conditional program in semantics. Some of my friends said it so often that the point—or at least a point—finally sunk in.

This thesis explores the syntax and semantics of coordinate structures on the basis of three-dimensional syntactic structures. In particular it gives an analysis of sentences of the sort 'a man came and a woman left who knew each other well' on the basis of implicit coordination of NPs, made available within three-dimensionional syntactic structures..

Interdisciplinary investigations marry the methods and concerns of different fields. Computer science is the study of precise descriptions of finite processes; semantics is the study of meaning in language. Thus, computational semantics embraces any project that approaches the phenomenon of meaning by way of tasks that can be performed by following definite sets of mechanical instructions. So understood, computational semantics revels in applying semantics, by creating intelligent devices whose broader behavior fits the meanings of utterances, and not just their form. (...) IBM’s Watson (Ferrucci, Brown, Chu-Carroll, Fan, Gondek, Kalyanpur, Lally, Murdock, Nyberg, Prager, Schlaefer & Welty 2010) is a harbinger of the excitement and potential of this technology. (shrink)

In this paper, we outline and critically evaluate Thomas Hofweber’s solution to a semantic puzzle he calls Frege’s Other Puzzle. After sketching the Puzzle and two traditional responses to it—the Substantival Strategy and the Adjectival Strategy—we outline Hofweber’s proposed version of Adjectivalism. We argue that two key components—the syntactic and semantic components—of Hofweber’s analysis both suffer from serious empirical difficulties. Ultimately, this suggests that an altogether different solution to Frege’s Other Puzzle is required.

§§3-4 of the Begriffsschrift present Frege’s objections to a dominant if murky nineteenth-century semantic picture. I sketch a minimalist variant of the pre-Fregean picture which escapes Frege’s criticisms by positing a thin notion of semantic content which then interacts with a multiplicity of kinds of truth to account for phenomena such as modality. After exploring several ways in which we can understand the existence of multiple truth properties, I discuss the roles of pointwise and setwise truth properties in modal logic. (...) I argue that thinking of supertruth and determinate truth as setwise truth properties allows an understanding of supervaluationist approaches to vagueness which escapes both Williamson’s objections to and a needless metalinguistic orientation of traditional supervaluationism. (shrink)

(2012). Reasoning without believing: on the mechanisation of presuppositions and partiality. Journal of Applied Non-Classical Logics: Vol. 22, No. 4, pp. 295-317. doi: 10.1080/11663081.2012.705962.

Montague and Kaplan began a revolution in semantics, which promised to explain how a univocal expression could make distinct truth-conditional contributions in its various occurrences. The idea was to treat context as a parameter at which a sentence is semantically evaluated. But the revolution has stalled. One salient problem comes from recurring demonstratives: "He is tall and he is not tall". For the sentence to be true at a context, each occurrence of the demonstrative must make a different truth-conditional contribution. (...) But this difference cannot be accounted for by standard parameter sensitivity. Semanticists, consoled by the thought that this ambiguity would ultimately be needed anyhow to explain anaphora, have been too content to posit massive ambiguities in demonstrative pronouns. This article aims to revived the parameter revolution by showing how to treat demonstrative pronouns as univocal while providing an account of anaphora that doesn't end up re-introducing the ambiguity. (shrink)

The characteristic property of definite descriptions in natural language is commonly assumed to be their uniqueness requirement, although there is disagreement with respect to how occurrences should be interpreted, for instance with regard to the well-known restriction problem. I offer a novel argument against characterizing definite expressions in terms of uniqueness. If a singular definite description ?the F? implies that its denotation is the unique satisfier of ?F? (relative to a context) then there are real-life states of affairs that can (...) be described in simple first-order languages, but which we are simply unable to describe accurately in natural language. I argue, first, that there is no way to describe these states of affairs properly without using definite descriptions. Second, if definite descriptions imply uniqueness we will systematically get the wrong truth conditions, regardless of whatever semantic or pragmatic resources the defender of the uniqueness-implying approach invokes. Hence, the Russellian idea of characterizing definite descriptions in terms of uniqueness must be given up. In the final section I explain what an adequate account of definite expressions must achieve?primarily coordinating elements brought to salience by context or previous discourse?and sketch a way of accomplishing this by using a liberal version of familiarity theory. Although there may be other accounts that can do the job, the account I sketch (based on an approach that has largely been overlooked) shows promise and can easily deal with the inexpressibility problem. (shrink)

Timothy Williamson has argued that in the debate on modal ontology, the familiar distinction between actualism and possibilism should be replaced by a distinction between positions he calls contingentism and necessitism. He has also argued in favor of necessitism, using results on quantified modal logic with plurally interpreted second-order quantifiers showing that necessitists can draw distinctions contingentists cannot draw. Some of these results are similar to well-known results on the relative expressivity of quantified modal logics with so-called inner and outer (...) quantifiers. The present paper deals with these issues in the context of quantified modal logics with generalized quantifiers. Its main aim is to establish two results for such a logic: Firstly, contingentists can draw the distinctions necessitists can draw if and only if the logic with inner quantifiers is at least as expressive as the logic with outer quantifiers, and necessitists can draw the distinctions contingentists can draw if and only if the logic with outer quantifiers is at least as expressive as the logic with inner quantifiers. Secondly, the former two items are the case if and only if all of the generalized quantifiers are first-order definable, and the latter two items are the case if and only if first-order logic with these generalized quantifiers relativizes. (shrink)

I attempt an explication of what it means for an operation across domains to be the same on all domains, an issue that ) took to be central for a successful delimitation of the logical operations. Some properties that seem strongly related to sameness are examined, notably isomorphism invariance, and sameness under extensions of the domain. The conclusion is that although no precise criterion can satisfy all intuitions about sameness, combining the two properties just mentioned yields a reasonably robust and (...) useful explication of sameness across domains. (shrink)

Human languages vary in terms of which meanings they lexicalize, but this variation is constrained. It has been argued that languages are under two competing pressures: the pressure to be simple (e.g., to have a small lexicon) and to allow for informative (i.e., precise) communication, and that which meanings get lexicalized may be explained by languages finding a good way to trade off between these two pressures. However, in certain semantic domains, languages can reach very high levels of informativeness even (...) if they lexicalize very few meanings in that domain. This is due to productive morphosyntax and compositional semantics, which may allow for construction of meanings which are not lexicalized. Consider the semantic domain of natural numbers: many languages lexicalize few natural number meanings as monomorphemic expressions, but can precisely convey very many natural number meanings using morphosyntactically complex numerals. In such semantic domains, lexicon size is not in direct competition with informativeness. What explains which meanings are lexicalized in such semantic domains? We will propose that in such cases, languages need to solve a different kind of trade‐off problem: the trade‐off between the pressure to lexicalize as few meanings as possible (i.e, to minimize lexicon size) and the pressure to produce as morphosyntactically simple utterances as possible (i.e, to minimize average morphosyntactic complexity of utterances). To support this claim, we will present a case study of 128 natural languages' numeral systems, and show computationally that they achieve a near‐optimal trade‐off between lexicon size and average morphosyntactic complexity of numerals. This study in conjunction with previous work on communicative efficiency suggests that languages' lexicons are shaped by a trade‐off between not two but three pressures: be simple, be informative, and minimize average morphosyntactic complexity of utterances. (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)

With this paper I aim to demonstrate that a look beyond the Aristotelian square of opposition, and a related non-conservative view on logical determiners, contributes to both the understanding of Aristotelian syllogistics as well as to the study of quantificational structures in natural language.

Three experiments investigated the processing of the implicature associated with some using a “gumball paradigm.” On each trial, participants saw an image of a gumball machine with an upper chamber with 13 gumballs and an empty lower chamber. Gumballs then dropped to the lower chamber and participants evaluated statements, such as “You got some of the gumballs.” Experiment 1 established that some is less natural for reference to small sets and unpartitioned sets compared to intermediate sets. Partitive some of was (...) less natural than simple some when used with the unpartitioned set. In Experiment 2, including exact number descriptions lowered naturalness ratings for some with small sets but not for intermediate size sets and the unpartitioned set. In Experiment 3, the naturalness ratings from Experiment 2 predicted response times. The results are interpreted as evidence for a Constraint-Based account of scalar implicature processing and against both two-stage, Literal-First models and pragmatic Default models. (shrink)

To what extent are countability distinctions subject to systematic semantic variation? Could there be a language with no countability distinctions—in particular, one where all nouns are count? I argue that the answer is no: even in a language where all NPs have the core morphosyntactic properties of English count NPs, such as combining with numerals directly and showing singular/plural contrasts, countability distinctions still emerge on close inspection. I divide these distinctions into those related to sums and those related to parts. (...) In the Sahaptian language Nez Perce, evidence can be found for both types of distinction, in spite of the absence of anything like a traditional mass–count division in noun morphosyntax. I propose an extension of the Nez Perce analysis to Yudja, analyzed by Lima as lacking any countability distinctions. More generally, I suggest that at least one countability distinction may be universal and that languages without any countability distinctions may be unlearnable. (shrink)

The relationship between Lexical-Functional Grammar (LFG) functional structures (f-structures) for sentences and their semanticinterpretations can be formalized in linear logic in a way thatcorrectly explains the observed interactions between quantifier scopeambiguity, bound anaphora and intensionality.Our linear-logic formalization of the compositional properties ofquantifying expressions in natural language obviates the need forspecial mechanisms, such as Cooper storage, in representing thescoping possibilities of quantifying expressions. Instead, thesemantic contribution of a quantifier is recorded as a linear-logicformula whose use in a proof will establish the (...) scope of thequantifier. Different proofs can lead to different scopes. In eachcomplete proof, the properties of linear logic ensure thatquantifiers are properly scoped. (shrink)

It has been generally assumed that certain categories of numerical expressions, such as ‘more than n’, ‘at least n’, and ‘fewer than n’, systematically fail to give rise to scalar implicatures in unembedded declarative contexts. Various proposals have been developed to explain this perceived absence. In this paper, we consider the relevance of scale granularity to scalar implicature, and make two novel predictions: first, that scalar implicatures are in fact available from these numerical expressions at the appropriate granularity level, and (...) second, that these implicatures are attenuated if the numeral has been previously mentioned or is otherwise salient in the context. We present novel experimental data in support of both of these predictions, and discuss the implications of this for recent accounts of numerical quantifier usage. (shrink)

It has historically been assumed that comparative and superlative quantifiers can be semantically analysed in accordance with their core logical–mathematical properties. However, recent theoretical and experimental work has cast doubt on the validity of this assumption. Geurts & Nouwen have claimed that superlative quantifiers possess an additional modal component in their semantics that is absent from comparative quantifiers and that this accounts for the previously neglected differences in usage and interpretation between the two types of quantifier that they identify. Their (...) semantically modal hypothesis has received additional support from empirical investigations. In this article, we further corroborate that superlative quantifiers have additional modal interpretations. However, we propose an alternative analysis, whereby these quantifiers possess the semantics postulated by the classical model and the additional aspects of meaning arise as a consequence of psychological complexity and pragmatic implicature. We explain how this model is consistent with the existing empirical findings. Additionally, we present the findings of four novel experiments that support our model above the semantically modal account. (shrink)

The distribution of the focus particle even is constrained: if it is adjoined at surface structure to an expression that is entailed by its focus alternatives, as in even once, it must be appropriately embedded to be acceptable. This paper focuses on the context-dependent distribution of such occurrences of even in the scope of non-monotone quantifiers. We show that it is explained on the assumption that even can move at LF Syntax and semantics, 1979). The analysis is subsequently extended to (...) occurrences of negative polarity items in these environments, which mirror the abovementioned distribution of even and which invalidate standard characterizations of NPI licensing conditions in terms of downward-entailingness. The idea behind the extension is that NPIs denote weak elements that are associates of covert even. The paper concludes by discussing two comprehensive theories of NPI licensing and how our proposal relates to them. (shrink)

It is argued that the pronouns `she' and `he' are disguised complexdemonstratives of the form `that female/male'. Three theories ofcomplex demonstratives are examined and shown to be committed to theview that `s/he' turns out to be an empty term when used to refer toa hermaphrodite. A fourth theory of complex demonstratives, one thatis hermaphrodite friendly, is proposed. It maintains that complexdemonstratives such as `that female/male' and the pronoun `s/he' can succeed in referring to someone independently of his or her gender.This (...) theory incorporates: (i) a multiple proposition view, i.e., theview that an utterance of a sentence containing a complex demonstrativeexpresses two (or more) propositions, namely the background proposition(s)and the official one; (ii) that the referent of a complex demonstrativeis a component of the official proposition expressed whether it satisfiesthe nominal part of the demonstrative expression or not; (iii) that thenominal part of a complex demonstrative only affect the background proposition(s) and (iv) that the utterance inherits its truth-value onlyfrom the official proposition. (shrink)

In a recent book, Jeffrey King (King 2001) argues that complexdemonstratives, i.e., noun phrases of the form `this/that F, are not singular terms. As such,they are not devices of direct reference contributing the referent to the proposition expressed.In this essay I challenge King's position and show how a direct reference view can handle the datahe proposes in favor of the quantificational account. I argue that when a complex demonstrativecannot be interpreted as a singular term, it is best understood as a (...) case of deferredreference – in which case it should be viewed as an anaphora inheriting its value from a quantifiedterm – or as an emphatic description. (shrink)

This paper distinguishes between definiteness and determinacy. Definiteness is seen as a morphological category which, in English, marks a uniqueness presupposition, while determinacy consists in denoting an individual. Definite descriptions are argued to be fundamentally predicative, presupposing uniqueness but not existence, and to acquire existential import through general type-shifting operations that apply not only to definites, but also indefinites and possessives. Through these shifts, argumental definite descriptions may become either determinate or indeterminate. The latter option is observed in examples like (...) ‘Anna didn’t give the only invited talk at the conference’, which, on its indeterminate reading, implies that there is nothing in the extension of ‘only invited talk at the conference’. The paper also offers a resolution of the issue of whether possessives are inherently indefinite or definite, suggesting that, like indefinites, they do not mark definiteness lexically, but like definites, they typically yield determinate readings due to a general preference for the shifting operation that produces them. (shrink)

One of the claims of Type Theory with Records is that it can be used to model types learned by agents in order to classify objects and events in the world, including speech events. That is, the types can be represented by patterns of neural activation in the brain. This claim would be empty if it turns out that the types are in principle impossible to represent on a finite network of neurons. We will discuss how to represent types in (...) terms of neural events on a network and present a preliminary computational implementation that maps types to events on a network. The kind of networks we will use are closely related to the transparent neural networks discussed by Strannegård. (shrink)

:This paper proposes an analysis of the semantics of even that is consistent with the assumptions about the syntax and semantics of negation in Collins and Postal. First, I review the distribution of negation, showing how negation may modify quantificational expressions where it gives rise to scope freezing effects. Second, I discuss the fact that even-phrases can be modified by negation, as in Not even John is there. On the basis of this fact, I argue that even is a quantifier. (...) Lastly, I show that my data provides new empirical support for the assumption that there are two kinds of even, depending on the role played by focus in the scalar presupposition. (shrink)

This paper describes a computational model for analyzing arguments in discourse. In particular, the model describes processes necessary for interpreting one uninterrupted argument from a speaker. The resulting output is a representation for the underlying claim and evidence relations between propositions of the argument. For our processing model we present: (i) a characterization of coherent orderings of propositions, used to limit search for interpretation of each new proposition (ii) a working definition of the evidence relation, used to recognize connections between (...) propositions (iii) a theory of the function and use of clue words — special words and phrases indicating the structure of the argument — then used in the analysis to control search for interpretation and verification of evidence relations. (shrink)

Standard accounts of semantics for counterfactuals confront the true–true problem: when the antecedent and consequent of a counterfactual are both actually true, the counterfactual is automatically true. This problem presents a challenge to safety-based accounts of knowledge. In this paper, drawing on work by Angelika Kratzer, Alan Penczek, and Duncan Pritchard, we propose a revised understanding of semantics for counterfactuals utilizing machinery from generalized quantifier theory which enables safety theorists to meet the challenge of the true–true problem.

We consider connections between number sense—the ability to judge number—and the interpretation of natural language quantifiers. In particular, we present empirical evidence concerning the neuroanatomical underpinnings of number sense and quantifier interpretation. We show, further, that impairment of number sense in patients can result in the impairment of the ability to interpret sentences containing quantifiers. This result demonstrates that number sense supports some aspects of the language faculty.

Generalized quantifiers are functions from pairs of properties to truth-values; these functions can be used to interpret natural language quantifiers. The space of such functions is vast and a great deal of research has sought to find natural constraints on the functions that interpret determiners and create quantifiers. These constraints have demonstrated that quantifiers rest on number and number sense. In the first part of the paper, we turn to developing this argument. In the remainder, we report on work in (...) neurobiology that test the empirical claims of the theory. In particular, we look at fMRI experiments and behavioral experiments with various patient populations that support the intimate connection between natural language quantification and number sense. (shrink)

Fodor argued that in contrast to input systems which are informationally encapsulated, general intelligence is unencapsulated and hence non-modular; for this reason, he suggested, prospects for understanding it are not bright. It is argued that an additional property, primitive functionality, is required for non-modularity. A functionally primitive computational model for quantifier scoping, limited to some scoping influences, is then motivated, and an implementation described. It is argued that only such a model can be faithful to intuitive scope preferences. But it (...) is also argued that an extended model which includes all scoping influences is a hopeless prospect from a developmental perspective. Fodor's views are concluded to have some independent support: quantifier scoping is a mental ability parasitic on general intelligence that is non-modular though in a revised sense, warranting pessimism about our ability of model it. (shrink)

This paper is devoted to the study of bare nominal arguments (i.e., determinerless NPs occurring in canonical argumental positions) from a crosslinguistic point of view. It is proposed that languages may vary in what they let their NPs denote. In some languages (like Chinese), NPs are argumental (names of kinds) and can thus occur freely without determiner in argument position; in others they are predicates (Romance), and this prevents NPs from occurring as arguments, unless the category D(eterminer) is projected. Finally, (...) there are languages (like Germanic or Slavic) which allow both predicative and argumental NPs; these languages, being the ‘union’ of the previous two types, are expected to behave like Romance for certain aspects of their nominal system (the singular count portion) and like Chinese for others (the mass and plural portions). This hypothesis (the ‘Nominal Mapping Parameter’) is investigated not just through typological considerations, but also through a detailed contrastive analysis of bare arguments in Germanic (English) vs. Romance (Italian). Some general consequences of this view, which posits a limited variation in the mapping from syntax into semantics, for current theories of Universal Grammar and acquisition are considered. (shrink)

This paper studies the distribution of ‘list readings’ in questions like who does everyone like? vs. who likes everyone?. More generally, it focuses on the interaction between wh-words and quantified NPs. It is argued that, contrary to widespread belief, the pattern of available readings of constituent questions can be explained as a consequence of Weak Crossover, a well-known property of grammar. In particular, list readings are claimed to be a special case of ‘functional readings’, rather than arising from quantifying into (...) questions. Functional readings are argued to be encoded in the syntax as doubly indexed traces, which straightforwardly leads to a Crossover account of the absence of list readings in who likes everyone?. Empirical and theoretical consequences of this idea for the syntax and semantics of questions are considered. (shrink)

We started from the fact that type theory, in the way it was implemented in IL, makes it costly to deal with nominalization processes. We have also argued that the type hierarchy as such doesn't play any real role in a grammar; the classification it provides for different semantic objects is already contained, in some sense, in the categorial structure of the grammar itself. So, on the basis of a theory of properties (Cocchiarella's HST*) we have tried to build a (...) language (IL*) whose syntax does not contain any explicit typing of expressions. Some of the consequences that this move brings about in the overall organization of the grammar can be summarized as follows:it allows for a simple treatment of infinitives, gerunds, factives and, in general, all those phenomena which might be analyzed as cases of nominalization;it provides a simpler and more constrained semantics than IL, since IL* doesn't go beyond second order, and its non-modal basis is axiomatizable;it suggests that the role of logical form in a theory of grammar could be that of a family of theories of semantic objects;it eliminates the extrinsic limitations of a type hierarchy on the choice of the system of syntactic categories.I think that it is interesting to notice how having an explicit semantic framework helps to provide a sense in which it is legitimate to regard the syntax of a language as ‘autonomous’. (shrink)