Iterated team semantics for a hierarchy of informational types

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985955%3A_____%2F22%3A00562184" target="_blank" >RIV/67985955:_____/22:00562184 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1016/j.apal.2022.103156" target="_blank" >https://doi.org/10.1016/j.apal.2022.103156</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.apal.2022.103156" target="_blank" >10.1016/j.apal.2022.103156</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Iterated team semantics for a hierarchy of informational types

Popis výsledku v původním jazyce

In this paper, we introduce and study a framework that is inspired by the team semantics for propositional dependence logic but deviates from it in several respects. Most importantly, instead of the two semantic layers used in dependence logic – possible worlds and teams – a whole hierarchy of contexts is introduced and different types of formulas are evaluated at different levels of this hierarchy. This leads to a rich stratification of informational types. In this framework, the dependence operator of dependence logic can be defined by the standard propositional connectives (negation, conjunction, disjunction and implication). We explore the formal aspects of this approach and apply it to a number of puzzling phenomena related to modalities and conditionals.

Název v anglickém jazyce

Iterated team semantics for a hierarchy of informational types

Popis výsledku anglicky

In this paper, we introduce and study a framework that is inspired by the team semantics for propositional dependence logic but deviates from it in several respects. Most importantly, instead of the two semantic layers used in dependence logic – possible worlds and teams – a whole hierarchy of contexts is introduced and different types of formulas are evaluated at different levels of this hierarchy. This leads to a rich stratification of informational types. In this framework, the dependence operator of dependence logic can be defined by the standard propositional connectives (negation, conjunction, disjunction and implication). We explore the formal aspects of this approach and apply it to a number of puzzling phenomena related to modalities and conditionals.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

60301 - Philosophy, History and Philosophy of science and technology

Projekt

<a href="/cs/project/GM21-23610M" target="_blank" >GM21-23610M: Logická struktura informačních kanálů</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2022

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

Annals of Pure and Applied Logic

ISSN

0168-0072

e-ISSN

1873-2461

Svazek periodika

173

Číslo periodika v rámci svazku

10

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

31

Strana od-do

103156

Kód UT WoS článku

000861683600007

EID výsledku v databázi Scopus

2-s2.0-85133663783