Buridan formula

English

Etymology

Named in honour of the medieval philosopher Template:W.

Proper noun

1. Template:Lb In quantified modal logic, the formula $◊\mathrm{\forall }xFx\to \mathrm{\forall }x◊Fx$, meaning "if possibly everything is F, then everything is possibly F".