Turkish converbs

Turkish chains clauses with converbial suffixes on the verb of each medial clause before a single final verb, without switch-reference. -(y)Ip conjoins clauses of equal status in place of the tense, aspect and modality suffixes, -(y)ArAk gives the manner or means, -(y)IncA 'when' sequences two events, -(y)AlI 'since' marks a starting point, -mAdAn 'without doing' contains the negative, -DIkçA marks proportionality, and -(y)ken 'while' and -cAsInA 'as if' attach not to the stem but to a tensed one, -(y)ken being the copula on a position-3 marker or a nominal. The converbs take no person marker, except the third-person plural on -(y)ken and a person marker on -mIşçAsInA. Two more converbial subordinators go on a doubled verb: -(A/I)r … -mAz 'as soon as' and -(y)A … -(y)A, continuous manner.

Implementation notes

• Whether a converb takes a tense marker or the negative is read off the finite verb's template Turkish.Verb.template from the slot the converb follows.
• The clause-chaining typology over the converbs is in Studies/SarvasyAikhenvald2025.lean.

References

• [GK05]

inductive Turkish.Converb : Type

The converbial suffixes on a single verb, with vowel harmony shown by a capital archiphoneme and a buffer consonant in parentheses.

• ip : Converb

  -(y)Ip, conjunctive 'and, and then'.

• arak : Converb

  -(y)ArAk 'by doing, doing', manner and means, also conjunctive.

• inca : Converb

  -(y)IncA 'when'.

• ken : Converb

  -(y)ken 'while, as, when', the copula on a tensed stem or a nominal.

• ali : Converb

  -(y)AlI 'since', colloquial.

• madan : Converb

  -mAdAn 'without doing, before doing', containing the negative.

• casina : Converb

  -cAsInA 'as if', on the aorist or -mIş.

• dikca : Converb

  -DIkçA 'the more, as', proportional.

@[instance_reducible]

instance Turkish.instDecidableEqConverb : DecidableEq Converb

Equations

• Turkish.instDecidableEqConverb x✝ y✝ = if h : x✝.ctorIdx = y✝.ctorIdx then isTrue ⋯ else isFalse ⋯

def Turkish.instReprConverb.repr : Converb → ℕ → Std.Format

Equations

• Turkish.instReprConverb.repr Turkish.Converb.ip prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Turkish.Converb.ip")).group prec✝
• Turkish.instReprConverb.repr Turkish.Converb.arak prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Turkish.Converb.arak")).group prec✝
• Turkish.instReprConverb.repr Turkish.Converb.inca prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Turkish.Converb.inca")).group prec✝
• Turkish.instReprConverb.repr Turkish.Converb.ken prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Turkish.Converb.ken")).group prec✝
• Turkish.instReprConverb.repr Turkish.Converb.ali prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Turkish.Converb.ali")).group prec✝
• Turkish.instReprConverb.repr Turkish.Converb.madan prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Turkish.Converb.madan")).group prec✝
• Turkish.instReprConverb.repr Turkish.Converb.casina prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Turkish.Converb.casina")).group prec✝
• Turkish.instReprConverb.repr Turkish.Converb.dikca prec✝ = Repr.addAppParen (Std.Format.nest (if prec✝ ≥ 1024 then 1 else 2) (Std.Format.text "Turkish.Converb.dikca")).group prec✝

@[instance_reducible]

instance Turkish.instReprConverb : Repr Converb

Equations

• Turkish.instReprConverb = { reprPrec := Turkish.instReprConverb.repr }

@[instance_reducible]

instance Turkish.instFintypeConverb : Fintype Converb

Equations

• Turkish.instFintypeConverb = { elems := { val := ↑Turkish.Converb.enumList, nodup := Turkish.Converb.enumList_nodup }, complete := Turkish.instFintypeConverb._proof_1 }

def Turkish.Converb.morphs : Converb → List Morphology.Morph

The morphs of a converb.

Equations

• Turkish.Converb.ip.morphs = [Morphology.Morph.suff "(y)Ip"]
• Turkish.Converb.arak.morphs = [Morphology.Morph.suff "(y)ArAk"]
• Turkish.Converb.inca.morphs = [Morphology.Morph.suff "(y)IncA"]
• Turkish.Converb.ken.morphs = [Morphology.Morph.suff "(y)ken"]
• Turkish.Converb.ali.morphs = [Morphology.Morph.suff "(y)AlI"]
• Turkish.Converb.madan.morphs = Turkish.Negation.mA.morphs ++ [Morphology.Morph.suff "DAn"]
• Turkish.Converb.casina.morphs = [Morphology.Morph.suff "cAsInA"]
• Turkish.Converb.dikca.morphs = [Morphology.Morph.suff "DIkçA"]

def Turkish.Converb.form (c : Converb) : String

The form of a converb in boundary notation.

Equations

• c.form = Morphology.Morph.surface c.morphs

def Turkish.Converb.gloss : Converb → String

The gloss.

Equations

• Turkish.Converb.ip.gloss = "and, and then"
• Turkish.Converb.arak.gloss = "by doing, doing"
• Turkish.Converb.inca.gloss = "when"
• Turkish.Converb.ken.gloss = "while, as, when"
• Turkish.Converb.ali.gloss = "since"
• Turkish.Converb.madan.gloss = "without doing, before doing"
• Turkish.Converb.casina.gloss = "as if"
• Turkish.Converb.dikca.gloss = "the more, as"

def Turkish.Converb.relations : Converb → Finset Clause.Chaining.InterclauseRelation

The interclausal relations a converb encodes.

Equations

• Turkish.Converb.ip.relations = {Clause.Chaining.InterclauseRelation.sequential, Clause.Chaining.InterclauseRelation.additive}
• Turkish.Converb.arak.relations = {Clause.Chaining.InterclauseRelation.manner, Clause.Chaining.InterclauseRelation.simultaneous, Clause.Chaining.InterclauseRelation.additive}
• Turkish.Converb.inca.relations = {Clause.Chaining.InterclauseRelation.sequential}
• Turkish.Converb.ali.relations = {Clause.Chaining.InterclauseRelation.sequential}
• Turkish.Converb.ken.relations = {Clause.Chaining.InterclauseRelation.simultaneous}
• Turkish.Converb.madan.relations = {Clause.Chaining.InterclauseRelation.manner}
• Turkish.Converb.casina.relations = {Clause.Chaining.InterclauseRelation.manner}
• Turkish.Converb.dikca.relations = ∅

def Turkish.Converb.follows : Converb → Verb.Slot

The last slot of the finite verb whose exponent may precede the converb, which is the negative for the converbs on the stem, a position-3 marker for -(y)ken and -cAsInA, and the possibility suffix for -mAdAn, which contains the negative itself.

Equations

• Turkish.Converb.ip.follows = Turkish.Verb.Slot.negation
• Turkish.Converb.arak.follows = Turkish.Verb.Slot.negation
• Turkish.Converb.inca.follows = Turkish.Verb.Slot.negation
• Turkish.Converb.ali.follows = Turkish.Verb.Slot.negation
• Turkish.Converb.dikca.follows = Turkish.Verb.Slot.negation
• Turkish.Converb.ken.follows = Turkish.Verb.Slot.tam
• Turkish.Converb.casina.follows = Turkish.Verb.Slot.tam
• Turkish.Converb.madan.follows = Turkish.Verb.Slot.possibility

def Turkish.Converb.Admits (c : Converb) (s : Verb.Slot) : Prop

An exponent of the slot may precede the converb, since the slot is the one the converb follows or the finite verb's template admits it before that one.

Equations

• c.Admits s = (c.follows = s ∨ [s, c.follows] ∈ Turkish.Verb.template.matches')

@[instance_reducible]

instance Turkish.Converb.instDecidableAdmits (c : Converb) (s : Verb.Slot) : Decidable (c.Admits s)

Equations

• c.instDecidableAdmits s = { decide := decide (c.follows = s) || decide ([s, c.follows] ∈ Turkish.Verb.template.matches'), reflects_decide := ⋯ }

def Turkish.Converb.InherentlyNegative (c : Converb) : Prop

The converb is inherently negative.

Equations

• c.InherentlyNegative = (c = Turkish.Converb.madan)

@[instance_reducible]

instance Turkish.Converb.instDecidablePredInherentlyNegative : DecidablePred InherentlyNegative

Equations

• x✝.instDecidablePredInherentlyNegative = Turkish.Converb.instDecidablePredInherentlyNegative._aux_1 x✝

def Turkish.Converb.Negatable (c : Converb) : Prop

The converb can be negated, being negative itself or admitting the negative before it.

Equations

• c.Negatable = (c.InherentlyNegative ∨ c.Admits Turkish.Verb.Slot.negation)

@[instance_reducible]

instance Turkish.Converb.instDecidablePredNegatable : DecidablePred Negatable

Equations

• x✝.instDecidablePredNegatable = { decide := decide x✝.InherentlyNegative || decide (x✝.Admits Turkish.Verb.Slot.negation), reflects_decide := ⋯ }

def Turkish.Converb.Tensed (c : Converb) : Prop

A tense, aspect or modality marker may precede the converb.

Equations

• c.Tensed = c.Admits Turkish.Verb.Slot.tam

@[instance_reducible]

instance Turkish.Converb.instDecidablePredTensed : DecidablePred Tensed

Equations

• One or more equations did not get rendered due to their size.

def Turkish.Converb.PersonMarked (c : Converb) : Prop

The converb may carry a person marker, the third-person plural on -(y)ken and a person marker on -mIşçAsInA.

Equations

• c.PersonMarked = (c = Turkish.Converb.ken ∨ c = Turkish.Converb.casina)

@[instance_reducible]

instance Turkish.Converb.instDecidablePredPersonMarked : DecidablePred PersonMarked

Equations

• x✝.instDecidablePredPersonMarked = { decide := decide (x✝ = Turkish.Converb.ken) || decide (x✝ = Turkish.Converb.casina), reflects_decide := ⋯ }

def Turkish.Converb.verbForm : Converb → UD.VerbForm

The verb form of a converb.

Equations

• x✝.verbForm = UD.VerbForm.Conv

@[instance_reducible]

instance Turkish.Converb.instMedialForm : Clause.Chaining.MedialForm Converb

The converbs as medial forms, neutral to switch-reference, encoding their relations, and indexing the subject where they may carry a person marker.

Equations

• One or more equations did not get rendered due to their size.

def Turkish.arMaz : List (List Morphology.Morph)

-(A/I)r … -mAz 'as soon as', the positive and negative aorist on a doubled verb.

Equations

• Turkish.arMaz = [[Morphology.Morph.suff "(A/I)r"], Turkish.Negation.mA.morphs ++ [Morphology.Morph.suff "z"]]

def Turkish.aA : List (List Morphology.Morph)

-(y)A … -(y)A, emphatic continuous manner on a doubled verb.

Equations

• Turkish.aA = [[Morphology.Morph.suff "(y)A"], [Morphology.Morph.suff "(y)A"]]