@cite{aloni-2022}: BSML Applied to Permission Disjunction #
@cite{aloni-2022}
Phenomena-level instantiation of BSML for the classic free choice example: "You may have coffee or tea" → "You may have coffee AND you may have tea."
The core BSML theory (formulas, support, enrichment, FC theorems) lives in
Theories/Semantics/Dynamic/Systems/BSML/. This file provides the concrete
deontic model and verifies the FC predictions computationally.
Example world type for "You may have coffee or tea"
- neither : PermissionWorld
- onlyCoffee : PermissionWorld
- onlyTea : PermissionWorld
- both : PermissionWorld
Instances For
Equations
- One or more equations did not get rendered due to their size.
Instances For
The proposition "coffee is permitted"
Equations
- Phenomena.Modality.Studies.Aloni2022.coffeePermitted Phenomena.Modality.Studies.Aloni2022.PermissionWorld.onlyCoffee = true
- Phenomena.Modality.Studies.Aloni2022.coffeePermitted Phenomena.Modality.Studies.Aloni2022.PermissionWorld.both = true
- Phenomena.Modality.Studies.Aloni2022.coffeePermitted x✝ = false
Instances For
The proposition "tea is permitted"
Equations
Instances For
All permission worlds
Equations
- One or more equations did not get rendered due to their size.
Instances For
Deontic model: universal accessibility
Equations
- One or more equations did not get rendered due to their size.
Instances For
Restrictive deontic model: from 'neither', only 'neither' is accessible
Equations
- One or more equations did not get rendered due to their size.
Instances For
The formula ◇(coffee ∨ tea)
Equations
Instances For
Team representing "free choice holds" (both options available)
Equations
- One or more equations did not get rendered due to their size.
Instances For
Team where neither is permitted (with restricted accessibility)