Strict and non-strict negative concord in Hungarian: A unified analysis

Surányi (2006) observed that Hungarian has a hybrid (strict + non-strict) negative concord system. This paper proposes a uniform analysis of that system within the general framework of Zeijlstra (2004, 2008) and, especially, Chierchia (2013), with the following new ingredients. Sentential negation NEM is the same full negation in the presence of both strict and non-strict concord items. Preverbal SENKI `n-one’ type negative concord items occupy the specifier position of either NEM `not' or SEM `nor'. The latter, SEM spells out IS `too, even’ in the immediate scope of negation; it is a focus-sensitive head on the clausal spine. SEM can be seen as an overt counterpart of the phonetically null head that Chierchia dubs NEG; it is capable of invoking an abstract (disembodied) negation at the edge of its projection

A Logical Foundation for Environment Classifiers

Taha and Nielsen have developed a multi-stage calculus {\lambda}{\alpha} with a sound type system using the notion of environment classifiers. They are special identifiers, with which code fragments and variable declarations are annotated, and their scoping mechanism is used to ensure statically that certain code fragments are closed and safely runnable. In this paper, we investigate the Curry-Howard isomorphism for environment classifiers by developing a typed {\lambda}-calculus {\lambda}|>. It corresponds to multi-modal logic that allows quantification by transition variables---a counterpart of classifiers---which range over (possibly empty) sequences of labeled transitions between possible worlds. This interpretation will reduce the "run" construct---which has a special typing rule in {\lambda}{\alpha}---and embedding of closed code into other code fragments of different stages---which would be only realized by the cross-stage persistence operator in {\lambda}{\alpha}---to merely a special case of classifier application. {\lambda}|> enjoys not only basic properties including subject reduction, confluence, and strong normalization but also an important property as a multi-stage calculus: time-ordered normalization of full reduction. Then, we develop a big-step evaluation semantics for an ML-like language based on {\lambda}|> with its type system and prove that the evaluation of a well-typed {\lambda}|> program is properly staged. We also identify a fragment of the language, where erasure evaluation is possible. Finally, we show that the proof system augmented with a classical axiom is sound and complete with respect to a Kripke semantics of the logic

Counting Incompossibles

We often speak as if there are merely possible people—for example, when we make such claims as that most possible people are never going to be born. Yet most metaphysicians deny that anything is both possibly a person and never born. Since our unreflective talk of merely possible people serves to draw non-trivial distinctions, these metaphysicians owe us some paraphrase by which we can draw those distinctions without committing ourselves to there being merely possible people. We show that such paraphrases are unavailable if we limit ourselves to the expressive resources of even highly infinitary first-order modal languages. We then argue that such paraphrases are available in higher-order modal languages only given certain strong assumptions concerning the metaphysics of properties. We then consider alternative paraphrase strategies, and argue that none of them are tenable. If talk of merely possible people cannot be paraphrased, then it must be taken at face value, in which case it is necessary what individuals there are. Therefore, if it is contingent what individuals there are, then the demands of paraphrase place tight constraints on the metaphysics of properties: either (i) it is necessary what properties there are, or (ii) necessarily equivalent properties are identical, and having properties does not entail even possibly being anything at all

Morphologically Complex Predicates in Japanese and What They Tell Us About Grammar Architecture

In this paper we take a fresh look at an old problem, the syntax and semantics of Japanese causatives. We demonstrate some seldom-noted similarities causatives bear to other Japanese morphologically complex predicates and argue why these similarities are important. Following a survey and critique of past analyses, we conclude that the principle of compositionality is at the root of the deficiencies of these analyses. We thus propose a modified, slightly non-compositional version of Manning et al.’s (1999) analysis, similar in spirit to Minimal Recursion Semantics (Copestake et al. 1995, 1999). We conclude with some discussion of possible replacements for compositionality

A compositional intersective account of Heterofunctional Coordination

The analysis presented in this paper extends the uniform intersective (“boolean”) treatment of conjunctive coordinators to Heterofunctional Coordination (HC), i.e., coordination of different grammatical functions. A compositional account of HC based on mainstream derivational syntax is proposed, one that makes Champollion’s (2015) “quantificational event semantics” compatible with derivational syntax. The analysis is based on the assumption, common in Minimalism, that traces of moved quantifiers denote domain restrictions rather than just variables

Abella: A System for Reasoning about Relational Specifications

International audienceThe Abella interactive theorem prover is based on an intuitionistic logic that allows for inductive and co-inductive reasoning over relations. Abella supports the λ-tree approach to treating syntax containing binders: it allows simply typed λ-terms to be used to represent such syntax and it provides higher-order (pattern) unification, the ∇ quantifier, and nominal constants for reasoning about these representations. As such, it is a suitable vehicle for formalizing the meta-theory of formal systems such as logics and programming languages. This tutorial exposes Abella incrementally, starting with its capabilities at a first-order logic level and gradually presenting more sophisticated features, ending with the support it offers to the two-level logic approach to meta-theoretic reasoning. Along the way, we show how Abella can be used prove theorems involving natural numbers, lists, and automata, as well as involving typed and untyped λ-calculi and the π-calculus

Greek and Romance unagreement in Calabria

The term ‘unagreement’ describes configurations with an apparent person-mismatch between a typically definite plural subject and non-third person verbal agreement found in several null subject languages. Previous works have suggested that languages which have an obligatory definite article in adnominal pronoun constructions (APCs) allow unagreement (cf. standard modern Greek emeis oi glossologoi “we (the) linguists”), while languages that rule out definite articles in APCs do not allow unagreement constructions (cf. standard Italian noi (*i) linguisti). This article presents new evidence from Calabrian Greek (Greko), which corresponds to the predictions for other varieties of Greek, and two southern Italian Romance varieties (northern and southern Calabrese): these varieties exhibit Italian-type apcs but still allow unagreement, contrary to expectations. We discuss how the Romance data may be accommodated by extending a previous account of unagreement and propose that the hybrid pattern observed in the Italo-Romance varieties is a result of historical contact with local Greek varieties.Georg Höhn acknowledges funding from the European Research Council Advanced Grant No. 269752 “Rethinking Comparative Syntax” for part of this research. Giuseppina Silvestri acknowledges funding from the Leverhulme-funded project “Fading voices in southern Italy: investigating languag