×

Iterated team semantics for a hierarchy of informational types. (English) Zbl 07587333

Summary: 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.

MSC:

03B60 Other nonclassical logic
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] van Benthem, J.; Martinez, M., Stories of logic and information, (Adriaans, P.; van Benthem, J., Handbook of the Philosophy of Information (2008), Elsevier Science: Elsevier Science Amsterdam), 217-280
[2] (Bimbó, K. E., J. Michael Dunn on Information Based Logics (2016), Springer: Springer Cham) · Zbl 1343.03001
[3] Ciardelli, I., Questions in Logic (2016), University of Amsterdam: University of Amsterdam Amsterdam, Ph.D. Thesis
[4] Ciardelli, I., Dependence statements are strict conditionals, (Bezhanishvili, G.; D’Agostino, G.; Metcalfe, G.; Studer, T., Advances in Modal Logic 2018 (2018), College Publications: College Publications London), 123-142 · Zbl 1418.03046
[5] DeRose, K., Epistemic possibilities, Philos. Rev., 100, 581-605 (1991)
[6] Gauker, C., Conditionals in Context (2005), MIT Press: MIT Press Cambridge, MA
[7] Gauker, C., A strictly stronger relative must, Thought, 1-8 (2021)
[8] Hawke, P.; Steinert-Threlkeld, S., Informational dynamics of epistemic modals, Synthese, 195, 4309-4342 (2018) · Zbl 1452.03052
[9] Hawke, P.; Steinert-Threlkeld, S., Semantic expressivism for epistemic modals, Linguist. Philos., 1-37 (2020)
[10] (Jech, T., Set Theory (2002), Springer: Springer Berlin)
[11] Klev, A., A proof-theoretic account of the miners paradox, Theoria, 82, 351-369 (2016)
[12] Kolodny, N.; MacFarlane, J., Ifs and oughts, J. Philos., 107, 115-143 (2010)
[13] Kripke, S. A., Semantical analysis of intuitionistic logic, (Crossley, J.; Dummett, M. A.E., Formal Systems and Recursive Functions (1965), North-Holland Publishing: North-Holland Publishing Amsterdam), 92-130 · Zbl 0137.00702
[14] Punčochář, V., Weak negation in inquisitive semantics, J. Log. Lang. Inf., 24, 323-355 (2015) · Zbl 1369.03108
[15] Punčochář, V.; Gauker, C., Indicative conditionals in objective contexts, Theoria, 86, 651-687 (2020)
[16] Stalnaker, R., Indicative conditionals, Philos., 5, 269-286 (1975)
[17] Veltman, F., Data semantics and the pragmatics of indicative conditionals, (Traugott, E. C.; ter Meulen, A.; Reilly, J. S.; Ferguson, C. A., On Conditionals (1986), Cambridge University Press: Cambridge University Press Cambridge), 147-168
[18] Wansing, H., The Logic of Information Structures (1993), Springer: Springer Berlin · Zbl 0788.03001
[19] Yalcin, S., A counterexample to modus tollens, J. Philos. Log., 41, 1001-1024 (2012) · Zbl 1283.03062
[20] Yang, F.; Väänänen, J., Propositional logics of dependence, Ann. Pure Appl. Log., 167, 557-589 (2016) · Zbl 1355.03021
[21] Yang, F.; Väänänen, J., Propositional team logics, Ann. Pure Appl. Log., 168, 1406-1441 (2017) · Zbl 1422.03058
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.