منابع مشابه
A Note on Complex Predicate Formation: Evidence from Auxiliary Selection, Re exivization, and Past Participle Agreement in French and Italian
French and Italian confront us with an interesting puzzle in the analysis of complex predicates. In both languages we nd constructions { involving e.g. causative verbs and so{called restructuring verbs (in Italian 2 ) { for which various authors have motivated an analysis in terms of complex predicate formation. 3 The most compelling criterion in support of this analysis is (object) clitic clim...
متن کاملComplex Predicates and Agreement In Polysynthetic Languages*
The term “complex predicate” in syntactic theory is still semantically transparent; it can refer to any predicate that a particular researcher finds difficult—whether due to semantic complexity, syntactic complexity, morphological complexity, or whatever. For purposes of this work, I use the term to mean a single “inflectional domain” which contains two or more distinct morphemes, each of which...
متن کاملModeling Verb Order in Complex Multi-Verbal Predicate Constructions
1. Introduction) Verb order is an important issue in complex multi-verbal predicate constructions, for example, serial verb constructions (SVCs). With more than one verb in the construction, how are the verbs sequenced? What constraints are at play to govern their order? In this paper, we attempt to investigate several constraints that are related to the issue. We also propose a different ranki...
متن کاملSimplifying Design and Analysis of Complex Predicate Encryption Schemes
Wee (TCC’14) and Attrapadung (Eurocrypt’14) introduced predicate and pair encodings, respectively, as a simple way to construct and analyze attribute-based encryption schemes, or more generally predicate encryption. However, many schemes do not satisfy the simple information theoretic property proposed in those works, and thus require much more complicated analysis. In this paper, we propose a ...
متن کاملPredicate Subtyping with Predicate Sets
We show how PVS-style predicate subtyping can be simulated in HOL using predicate sets, and explain how to perform subtype checking using this model. We illustrate some applications of this to specification and verification in HOL, and also demonstrate some limits of the approach. Finally we report on the effectiveness of a subtype checker used as a condition prover in a contextual rewriter.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Linguistics
سال: 2013
ISSN: 1948-5425
DOI: 10.5296/ijl.v5i1.3304