Logos

OPERATIONopr.spa.negacion-multiple

negación múltiple

The requirement that a negative word after the verb be accompanied by a negative particle before it, and that the particle be absent when the negative word precedes the verb.

Two negative elements in one clause do not cancel; they state one negation twice, and the second statement is obligatory rather than permitted. The rule has two halves and both are requirements: the particle must be there when the negative word follows the verb, and must not be there when it precedes. Stating only the first half is the common shortcut and it produces ungrammatical sentences in the other position, which is why both halves are written into the trigger. No source this graph carries states this rule, and it is asserted here from the language's own behaviour rather than taken from a reference that states it; whether any reference states it explicitly has not been checked by the author of this node. The coverage method is recorded as estimated because the two positions are easy to enumerate and the set of words that count as negative is not, so the figure describes the rule's shape rather than a count of cases.

statusstatus
documentedasserted, and the sources agree
provenanceprovenance
authoredwritten for Logos, from first principles
derivation statusderivation_status
unstatednobody has said whether it follows from anything
saliencesalience
No salience. Where no frequency source applies the object carries none, rather than a default or a guess (03-schema.md §3.5).
aliasesaliases
  • metalanguagenegative concord
sourcessources
An empty list, which is an assertion: this rests on nothing external, and somebody checked. It is not the same as nobody having looked.

What it does, and when it fires

operation.rule

The domain it works in, and the firing condition as a sentence. The checkable form of that condition is the selects group below.

domaindomain
syntacticit arranges or constrains words in a structure
triggertrigger

A clause contains a negative word, and that word's position relative to the verb decides whether the preverbal particle appears.

How much it covers

operation.coverage

How many cases the operation actually derives, out of how many it claims, and how that was counted.

derives 2 of 2estimated

None among the two positions. The operation does not state which words belong to the negative set, which is a stored list, and it does not cover the reading in which two negatives cancel each other, which the language reaches by other means and which this rule would misdescribe.

the number is an estimate and nothing counted it, and the count closes: nothing is left over

Everything joined to this object

One group per typed edge, in both directions. A1b guarantees no object node is an orphan, so this is the whole navigation: an object with no edges would have failed the build rather than reached this page.

What this object is a kind of

Walking this object's own `is-a` edges: what it is a kind of. Several branches from one object are several classification axes, not competing supertypes.

objects
1
places drawn
1
multi-parent
None in this view. This subgraph happens to be a tree, which the explorer draws as one without assuming it is one.

Siblings are listed by name, then by id to break ties. That is a display choice made here and not an order the graph asserts.

Fan-out per dimension

A4

One row per dimension, largest first. That is a display order, not a verdict: 03-schema.md declares no threshold above which fan-out is too much, so this reports the count and grades nothing.

  • case13 values
  • mood8 values
  • voice8 values
  • aspect7 values
  • aktionsart6 values
  • number6 values
  • person6 values
  • tense6 values
  • comparison4 values
  • evidentiality4 values
  • gender4 values
  • politeness4 values
  • valency4 values
  • animacy3 values
  • definiteness3 values
  • deixis3 values
  • finiteness2 values
  • information structure2 values
  • interrogativity2 values
  • polarity2 values
  • switch-reference2 values

What kinds of this object there are

Walking the `is-a` edges that point at this object: what kinds of it there are. An object reachable two ways is drawn in both places and is still one object.

objects
1
places drawn
1
multi-parent
None in this view. This subgraph happens to be a tree, which the explorer draws as one without assuming it is one.

Siblings are listed by name, then by id to break ties. That is a display choice made here and not an order the graph asserts.

applies-to

edges.applies-to

the operation's input

this operation applies to

via

edges.via

this realizer, this way

this object realizes

derives

edges.derives

the why-chain