Quantifier order
Named by 2 essays across 2 fields — each of them below, with the objects they name alongside it.
Every row, or one column
For every person there is someone who loves them, and there is someone who loves everyone, are the same six words in a different order. Draw the relation as a grid and they become two obviously different questions — one about rows, one about columns.
No stable rule is safe from a lie
A stable matching always exists, and the side that proposes gets the best one it could hope for. This essay closes the ladder with the result that spoils it — one participant's whole strategy space searched, four submissions found that beat the truth, and a theorem saying no rule anywhere escapes.
Named alongside it
The objects these essays reach for when they reach for this one.
CounterexampleBlocking pairDeferred acceptanceNegationOrder latticePredicate logicPreference profileQuantifierRelationStable matchingStrategy proofnessUniformity