Tho Modal Logic of Minimal Upper Bounds

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autor principal: Knudstorp, Søren Brinck
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915032653103104
author Knudstorp, Søren Brinck
author_facet Knudstorp, Søren Brinck
contents To formalize patterns of information increase and decrease, Van Benthem (1996) proposed modal information logic (MIL), a modal logic over partial orders. In MIL, points are interpreted as information states and least upper bounds, when existent, as informational sums. A natural counterpart to this logic is the modal logic of minimal upper bounds (MIN), interpreting minimal, rather than least, upper bounds as informational sums. This paper presents the logic MIN, and in the main result, it is shown that the modal language cannot distinguish the two interpretations: a formula is valid in MIN if and only if it is valid in MIL. Leveraging the work of [11], as corollaries, an axiomatization of MIN and a proof of decidability are obtained.
format Preprint
id arxiv_https___arxiv_org_abs_2411_15940
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Tho Modal Logic of Minimal Upper Bounds
Knudstorp, Søren Brinck
Logic
To formalize patterns of information increase and decrease, Van Benthem (1996) proposed modal information logic (MIL), a modal logic over partial orders. In MIL, points are interpreted as information states and least upper bounds, when existent, as informational sums. A natural counterpart to this logic is the modal logic of minimal upper bounds (MIN), interpreting minimal, rather than least, upper bounds as informational sums. This paper presents the logic MIN, and in the main result, it is shown that the modal language cannot distinguish the two interpretations: a formula is valid in MIN if and only if it is valid in MIL. Leveraging the work of [11], as corollaries, an axiomatization of MIN and a proof of decidability are obtained.
title Tho Modal Logic of Minimal Upper Bounds
topic Logic
url https://arxiv.org/abs/2411.15940