Zobrazeno 1 - 4
of 4
pro vyhledávání: '"Krzysztof Mierzewski"'
Autor:
Krzysztof Mierzewski
Publikováno v:
The Review of Symbolic Logic. 15:553-590
Several authors have investigated the question of whether canonical logic-based accounts of belief revision, and especially the theory of AGM revision operators, are compatible with the dynamics of Bayesian conditioning. Here we show that Leitgeb’s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b122b0acd67ba67ebf82a143e994d63a
https://doi.org/10.1017/s1755020320000404
https://doi.org/10.1017/s1755020320000404
Publikováno v:
Review of Symbolic Logic, 15(1), 36-63. Cambridge University Press
We investigate the modal logic of stepwise removal of objects, both for its intrinsic interest as a logic of quantification without replacement, and as a pilot study to better understand the complexity jumps between dynamic epistemic logics of model
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4cecc5edfccf5850cbe1bd7cf1ec7ba1
http://arxiv.org/abs/2103.05117
http://arxiv.org/abs/2103.05117
Publikováno v:
Knowledge, Proof and Dynamics ISBN: 9789811522208
The poison game is a two-player zero-sum game played on directed graphs, first introduced by Duchet and Meyniel (1993) in the context of graph theory, where one of the players travels along the edges of a graph, while the other modifies the underlyin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4c25760037210b01ad21eec4bc008aac
https://doi.org/10.1007/978-981-15-2221-5_1
https://doi.org/10.1007/978-981-15-2221-5_1
Autor:
Krzysztof Mierzewski
Publikováno v:
Electronic Proceedings in Theoretical Computer Science. 335:249-250
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56d6b2dc51e5b8741ea43a152b7db439
https://doi.org/10.4204/eptcs.335.23
https://doi.org/10.4204/eptcs.335.23