Results 11 to 20 of about 7,729,210 (329)
Complex predicates are constructions in which a head attracts arguments from its predicate complement. Auxiliaries, copulas, predicative verbs, certain control or raising verbs, perception verbs, causative verbs and light verbs can head complex predicates.
Godard, Danièle, Samvelian, Pollet
openaire +2 more sources
Using Corpus Pattern Analysis (CPA) To Recognize Meanings of Zadan [PDF]
With the advent of huge corpora in recent decades, there has appeared a tendency among researchers to utilize them in lexicography. According to Miller (2018), a major issue involved in Persian lexicography is the presence of light verbs.
Gholamhossein Karimi Doostan +1 more
doaj +1 more source
Complex Predicates and the Functional Sequence
In this paper I argue that a fine-grained functional hierarchy of semantically contentful categories such as Tense, Aspect, Initiation, and Process has explanatory power in understanding the crosslinguistic distribution of complex predicates.
Peter Svenonius
doaj +1 more source
Converbal constructions in Selkup
In Selkup, converbs and converbal constructions are extensively used in a wide range of different syntactic functions. However, the corpus data show significant differences regarding the frequency within the individual Selkup dialectal groups (Northern ...
Anja Behnke
doaj +1 more source
Creating Surprise in Complex Predication
In many languages, the verbs take and go may combine with another predicate to yield an inceptive reading, where the onset of the event denoted by the main predicate is in some sense focalized. Some of these cases have a touch of surprise, unexpectedness,
Anna-Lena Wiklund
doaj +1 more source
Constructions à prédicats légers et quasi-légers [PDF]
Nous proposons d’étendre la classe des prédicats légers (lights verbs) pour y inclure les verbes causatifs et à restructuration de l’italien. Leur structure d’argument contient des positions vides et ils forment des prédicats complexes avec des prédicats
Di Sciullo, Anne-Marie +1 more
core +1 more source
On the complexity of Gödel's proof predicate [PDF]
AbstractThe undecidability of first-order logic implies that there is no computable bound on the length of shortest proofs of valid sentences of first-order logic. Some valid sentences can only have quite long proofs. How hard is it to prove such “hard” valid sentences?
Chen, Yijia, Flum, Jörg
openaire +2 more sources
On Automated Lemma Generation for Separation Logic with Inductive Definitions [PDF]
Separation Logic with inductive definitions is a well-known approach for deductive verification of programs that manipulate dynamic data structures. Deciding verification conditions in this context is usually based on user-provided lemmas relating the ...
B Cook +14 more
core +4 more sources
Argument coding in the experiential predicate tǝmʃʌ kǝrdǝn ‘to look’ in Garrusi Kurdish [PDF]
tǝmʃʌ kǝrdǝn ‘to look’ is an experiential predicate in Garrusi Kurdish whose arguments and event structure are represented as a coverb complex predicate. The present study explores how arguments are encoded in the predicate-argument construction of tǝmʃʌ
Mohammad Dabir-Moghaddam, Masoumeh Zarei
doaj +1 more source
Quantum communication complexity of symmetric predicates [PDF]
We completely (that is, up to a logarithmic factor) characterize the bounded-error quantum communication complexity of every predicate $f(x,y)$ depending only on $|x\cap y|$ ($x,y\subseteq [n]$). Namely, for a predicate $D$ on $\{0,1,...,n\}$ let $\ell_0(
Razborov, Alexander
core +3 more sources

