Sökning: "Small Clause"

Hittade 4 avhandlingar innehållade orden Small Clause.

  1. 1. Small Clauses in Swedish : Towards a Unified Account

    Författare :Katarina Lundin; Svenska; []
    Nyckelord :HUMANIORA; HUMANITIES; ECM; object with infinitive; absolute construction; EPP; Agree; tense; matrix clause; periphrastic passive; light verbs; reflexive pronouns; participles; vP; TP; Small Clause; Nordiska språk språk och litteratur ; Scandinavian languages and literature; Merge; chain formation; object predicative; CP;

    Sammanfattning : In this thesis I offer a unified syntactic account of the small clauses involved in Swedish object-with-infinitive constructions (ECM), object predicative constructions and absolute constructions. In the present framework, this similarity is conceptually appealing and is also supported by empirical data. LÄS MER

  3. 2. Adnominal Possession and Ditransitives

    Författare :Mikko Kupula; Cecilia Falk; Eva Hedin; Melita Stavrou; Stockholms universitet; []
    Nyckelord :HUMANIORA; HUMANITIES; Modern Greek; minimalism; adnominal possession; ditransitive constructions; possessor raising; applicative constructions; phase extension; event variable; dative; locative; clitics; Modern Greek language; Nygrekiska; nygrekiska; Modern Greek;

    Sammanfattning : This dissertation presents the findings of an investigation of adnominal possession and ditransitives on the basis of data from Modern Greek. The general thesis of the dissertation is that possessive DPs constitute nominal counterparts to ditransitive constructions. LÄS MER

  4. 3. Space in Proof Complexity

    Författare :Marc Vinyals; Jakob Nordström; Yehudayoff Amir; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; proof complexity; resolution; polynomial calculus; cutting planes; space complexity; computational complexity; pebble games; communication complexity; CDCL; Computer Science; Datalogi;

    Sammanfattning : ropositional proof complexity is the study of the resources that are needed to prove formulas in propositional logic. In this thesis we are concerned with the size and space of proofs, and in particular with the latter.Different approaches to reasoning are captured by corresponding proof systems. LÄS MER

  5. 4. Short Proofs May Be Spacious : Understanding Space in Resolution

    Författare :Jakob Nordström; Johan Håstad; Albert Atserias; KTH; []
    Nyckelord :NATURVETENSKAP; NATURAL SCIENCES; Proof complexity; resolution; space; length; width; separation; lower bound; pebble game; pebbling formula; Beviskomplexitet; resolution; minne; längd; bredd; separation; undre gräns; pebblingspel; pebblingformel; Theoretical computer science; Teoretisk datalogi;

    Sammanfattning : Om man ser på de bästa nu kända algoritmerna för att avgöra satisfierbarhet hos logiska formler så är de allra flesta baserade på den så kallade DPLL-metoden utökad med klausulinlärning. De två viktigaste gränssättande faktorerna för sådana algoritmer är hur mycket tid och minne de använder, och att förstå sig på detta är därför en fråga som har stor praktisk betydelse. LÄS MER