English
Related papers

Related papers: A logical analysis of Monty Hall and Sleeping Beau…

200 papers

Hintikka and Sandu originally proposed Independence Friendly Logic (IF) as a first-order logic of imperfect information to describe game-theoretic phenomena underlying the semantics of natural language. The logic allows for expressing…

Logic in Computer Science · Computer Science 2023-04-25 Dylan Bellier , Massimo Benerecetti , Dario Della Monica , Fabio Mogavero

The Sleeping Beauty Problem remains a paradoxical problem that penetrates multiple disciplines that include probability theory, self-locating belief, decision theory, cognitive science, the philosophy of mathematics and science. It asks the…

Physics and Society · Physics 2023-12-14 Hutan Ashrafian

We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Vaananen, and their compositional semantics due to Hodges. We show how Hodges' semantics can be seen as a special case of a general…

Logic · Mathematics 2015-03-18 Samson Abramsky , Jouko Vaananen

A dichotomy result of Sevenster (2014) completely classified the quantifier prefixes of regular Independence-Friendly (IF) logic according to the patterns of quantifier dependence they contain. On one hand, prefixes that contain "Henkin" or…

Logic · Mathematics 2019-10-01 Fausto Barbero

Logics of non-sense allow a third truth value to express propositions that are \emph{nonsense}. These logics are ideal formalisms to understand how errors are handled in programs and how they propagate throughout the programs once they…

Logic in Computer Science · Computer Science 2020-09-24 Can Başkent

Significant controversy remains about what constitute correct self-locating beliefs in scenarios such as the Sleeping Beauty problem, with proponents on both the "halfer" and "thirder" sides. To attempt to settle the issue, one natural…

Other Statistics · Statistics 2017-05-19 Vincent Conitzer

The Monty Hall puzzle has been solved and dissected in many ways, but always using probabilistic arguments, so it is considered a probability puzzle. In this paper the puzzle is set up as an orthodox statistical problem involving an unknown…

Other Statistics · Statistics 2020-10-07 Yudi Pawitan

The Sleeping Beauty problem is a problem of imperfect recall that has received considerable attention. One approach to solving the Sleeping Beauty problem is to allow Sleeping Beauty to make decisions based on her beliefs, and then…

General Finance · Quantitative Finance 2026-01-23 Ben Abramowitz

Ehrenfeucht-Fraisse games provide means to characterize elementary equivalence for first-order logic, and by standard translation also for modal logics. We propose a novel generalization of Ehrenfeucht- Fraisse games to hybrid-dynamic…

Logic in Computer Science · Computer Science 2025-06-12 Guillermo Badia , Daniel Gaina , Alexander Knapp , Tomasz Kowalski , Martin Wirsing

Whether it be in normal form games, or in fair allocations, or in voter preferences in voting systems, a certain pattern of reasoning is common. From a particular profile, an agent or a group of agents may have an incentive to shift to a…

Computer Science and Game Theory · Computer Science 2019-07-23 Ramit Das , R. Ramanujam , Sunil Simon

Game semantics and winning strategies offer a potential conceptual bridge between semantics and proof systems of logics. We illustrate this link for hybrid logic -- an extension of modal logic that allows for explicit reference to worlds…

Logic in Computer Science · Computer Science 2022-06-02 Robert Freiman

The Sleeping Beauty problem is a probability riddle with no definite solution for more than two decades and its solution is of great interest in many fields of knowledge. There are two main competing solutions to the problem: the halfer…

History and Overview · Mathematics 2024-03-26 Paulo S. Piva , Gabriel Ruffolo

We define a version of the Ehrenfeucht-Fra\"iss\'e game in the setting of metric model theory and continuous first-order logic and show that the second player having a winning strategy in a game of length $n$ exactly corresponds to being…

Logic · Mathematics 2024-04-26 Åsa Hirvonen , Joni Puljujärvi

In recent work, semantic games of independence-friendly logic were studied in strategic form in terms of (mixed strategy) Nash equilibria. The class of strategic games of independence-friendly logic is contained in the class of win-loss,…

Logic · Mathematics 2014-01-21 Merlijn Sevenster

We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…

Logic in Computer Science · Computer Science 2021-07-06 Bharat Adsul , Saptarshi Sarkar , A. V. Sreejith

We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player games with imperfect information, the problem turns out to…

Logic in Computer Science · Computer Science 2018-09-05 Raphaël Berthon , Bastien Maubert , Aniello Murano , Sasha Rubin , Moshe Vardi

We study first-order as well as infinitary logics extended with quantifiers closed upwards under embeddings. In particular, we show that if a chain of quasi-homogeneous structures is sufficiently long then a given formula of such a logic is…

Logic · Mathematics 2014-07-04 Jevgeni Haigora , Kerkko Luosto

Independence -- the study of what is relevant to a given problem of reasoning -- has received an increasing attention from the AI community. In this paper, we consider two basic forms of independence, namely, a syntactic one and a semantic…

Artificial Intelligence · Computer Science 2011-06-24 J. Lang , P. Liberatore , P. Marquis

We investigate quantitative extensions of modal logic and the modal mu-calculus, and study the question whether the tight connection between logic and games can be lifted from the qualitative logics to their quantitative counterparts. It…

Logic in Computer Science · Computer Science 2008-02-21 Diana Fischer , Erich Grädel , Lukasz Kaiser

The rational solution of the Monty Hall problem unsettles many people. Most people, including the authors, think it feels wrong to switch the initial choice of one of the three doors, despite having fully accepted the mathematical proof for…

Other Statistics · Statistics 2019-03-27 Torsten Enßlin , Margret Westerkamp
‹ Prev 1 2 3 10 Next ›