<--- Back to Details
First PageDocument Content
Language / Polarity item / Presupposition / Downward entailing / Singular they / Double negative / Negation / Grammar / Linguistics / Semantics
Date: 2013-07-01 13:01:18
Language
Polarity item
Presupposition
Downward entailing
Singular they
Double negative
Negation
Grammar
Linguistics
Semantics

Presuppositional Indefinites Are Positive Polarity Items

Add to Reading List

Source URL: www.lingref.com

Download Document from Source Website

File Size: 314,69 KB

Share Document on Facebook

Similar Documents

Computational neuroscience / Neural networks / Artificial neural networks / Neuroscience / Cybernetics / Nervous system / Spiking neural network / Neuron / Artificial neuron / Nervous system network models / GalvesLcherbach model

Compositional Semantics of Spiking Neural P Systems Roberto Barbutia , Andrea Maggiolo-Schettinia, Paolo Milazzoa,∗, Simone Tinib a Dipartimento di Informatica, Universit` a di Pisa, Largo B. Pontecorvo 3, 56127 Pisa,

DocID: 1xW1Z - View Document

Theoretical computer science / Logic in computer science / Programming language semantics / Operational semantics / Semantics / International Colloquium on Automata /  Languages and Programming / Nominal / Process calculi

Rule Formats for Nominal Operational Semantics A very short and informal introduction Luca Aceto Gran Sasso Science Institute, L’Aquila, and ICE-TCS, School of Computer Science, Reykjavik University

DocID: 1xVWR - View Document

Theoretical computer science / Lambda calculus / Inter-process communication / Software engineering / Mathematical logic / Combinatory logic / Logic in computer science / Futures and promises / Evaluation strategy / Evaluation / Monitor / Futures contract

Contract Monitoring Semantics as Patterns of Communication Cameron Swords Amr Sabry Sam Tobin-Hochstadt

DocID: 1xVPL - View Document

Measure theory / FO / Finite model theory / Ergodic theory / Mathematics / Logic / Mathematical logic / Lie algebras / Hopf decomposition / Pattern language

Local Soundness for QBF Calculi? Martin Suda and Bernhard Gleiss TU Wien, Vienna, Austria Abstract. We develop new semantics for resolution-based calculi for Quantified Boolean Formulas, covering both the CDCL-derived ca

DocID: 1xVIK - View Document

Mathematics / Mathematical analysis / Theoretical computer science / Distribution / Functional analysis / Substitution / Denotational semantics / Markov chain

Experimental Biological Protocols with Formal Semantics Alessandro Abate2 , Luca Cardelli1,2 , Marta Kwiatkowska2 , Luca Laurenti2 , and Boyan Yordanov1 1

DocID: 1xVCq - View Document