Buridan formula
From Wikipedia, the free encyclopedia
In quantified modal logic, the Buridan formula and the converse Buridan formula (more accurately, schemata rather than formulas) (i) syntactically state principles of interchange between quantifiers and modalities; (ii) semantically state a relation between domains of possible worlds. The formulas are named in honor of the medieval philosopher Jean Buridan by analogy with the Barcan formula and the converse Barcan formula introduced as axioms by Ruth Barcan Marcus.[1]
The Buridan formula is:
- .
In English, the schema reads: If possibly everything is F, then everything is possibly F. It is equivalent in a classical modal logic (but not necessarily in other formulations of modal logic) to
- .
(If there exists an x that is necessarily F, then it is necessary that there exists an x that is F.)