The indices of the binders that dominate the position p, those a trace at p could be bound
by.
The definition is too large to print here; read it in the source.
Used by bindersAbove_nil, bindersAbove_bind, bindersAbove_phrase
Docs / Syntax / Tree / QuantifierRaising
import Linglib.Syntax.Tree.QuantifierRaising · namespace PhraseStructure.Tree
Quantifier Raising moves a constituent to the edge of a tree that contains it, leaving a trace that a binder of the same index abstracts over, so that the moved constituent combines with the rest of the tree as its scope. The movement is covert: a tree is pronounced as it stands and interpreted as one of its logical forms, the trees that steps of raising derive from it, each of which has the words of the tree it is derived from. A step may raise from any subtree to that subtree's edge, and steps may be repeated, raise a trace, or raise what contains one, as in May's and Heim and Kratzer's theories.
PhraseStructure.Tree.bindersAbove: the indices of the binders dominating a position.PhraseStructure.Tree.raise, PhraseStructure.Tree.raiseOf: the constituent at an address,
or a given constituent, raised to the edge of the tree.PhraseStructure.Tree.PassesNoIsland: a constituent crosses no island on its way to the edge.PhraseStructure.Tree.Raises: one step of raising, within any subtree, under a theory of
islands.PhraseStructure.Tree.IsLogicalForm: the trees that raising derives from a tree.raise adjoins to the root, the mother an adjunction of the root's category whose host is the
binder. It is total, as RoseTree.replaceAt is: an address outside the tree leaves the tree
unchanged. No condition on the index is imposed, so a step may bind a trace it should not. A
landing site is the edge of a subtree, and adjoining there does not leave the subtree: the islands
a step crosses are the subtrees properly between the landing site and the constituent.
The indices of the binders that dominate the position p, those a trace at p could be bound
by.
The definition is too large to print here; read it in the source.
Used by bindersAbove_nil, bindersAbove_bind, bindersAbove_phrase
Built from
Built from
Built from
Quantifier Raising of the constituent at p: it adjoins to the tree, leaving a trace of index
n that a binder of the same index abstracts over.
The definition is too large to print here; read it in the source.
Used by raise_of_getElem?, raise_of_getElem?_eq_none, raiseOf, raiseOf_of_addressOf?, terminals_raise_perm, yield_raise_perm, Raises, raises_raise, IsLogicalForm.raise
Used in HeimKratzer1998
Quantifier Raising of the first occurrence of the constituent a.
Built from
Used by raiseOf_of_addressOf?, IsLogicalForm.raiseOf
Used in Barker2027, HeimKratzer1998
A theory of scope islands is a relation I, where I a b says that the subtree b is an island
for the constituent a: islandhood may depend on what moves as well as on what it would leave. A
step of raising is restricted by the islands it would cross, and the unrestricted theory is ⊥.
The constituent at p passes no island of I on its way to the edge of t: no subtree
properly between the root and the constituent is an island for it.
Used by instDecidablePassesNoIsland, passesNoIsland_bot, PassesNoIsland.mono, Raises, raises_raise, IsLogicalForm.raise, IsLogicalForm.raiseOf
Used in Barker2027
Built from
Built from
With more islands, fewer constituents pass.
Built from
One step of covert movement under the islands I: a constituent of a subtree raises to that
subtree's edge, passing no island.
Built from ,
Used by IsLogicalForm, raises_raise, Raises.mono, Raises.isLogicalForm, Raises.terminals_perm
t' is a logical form of t under the islands I when covert movement derives it.
Built from
Used by IsLogicalForm.refl, IsLogicalForm.trans, IsLogicalForm.raise, IsLogicalForm.raiseOf, IsLogicalForm.mono, Raises.isLogicalForm, IsLogicalForm.yield_perm
Used in Barker2027, HeimKratzer1998
Built from
A tree with a constituent raised to its edge is a logical form of it.
Built from , ,
A tree with a given constituent raised to its edge is a logical form of it.
Built from , ,
With more islands, a tree has fewer logical forms.
Built from
A logical form has the words of the tree it is derived from.
Built from