Reasoning About Games

Fitting, Melvin

doi:10.1007/s11225-011-9358-7

Cited by 5 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An oracle is said to have state-based rationality if at each state in the ParaIMI model, the oracle gives the most rational response (not only the correct one), that is, the answer that brings the highest pay-off. Such a state based rationality can be represented by a proposition [11,42]. The strategy that is constructed with the responses of the oracle that has state-based rationality will be called the rational strategy.…”

Section: Formal Matters: Paraimimentioning

confidence: 99%

Towards Paraconsistent Inquiry

Baskent

2016

AJL

View full text Add to dashboard Cite

In this paper, we discuss Hintikka’s theory of interrogative approach to inquiry with a focus on bracketing. First, we dispute the use of bracketing in the interrogative model of inquiry arguing that bracketing provides an indispensable component of an inquiry. Then, we suggest a formal system based on strategy logic and logic of paradox to describe the epistemic aspects of an inquiry, and obtain a naturally paraconsistent system. We then apply our framework to some cases to illustrate its use.

show abstract

Section: Formal Matters: Paraimimentioning

confidence: 99%

Towards Paraconsistent Inquiry

Baskent

2016

AJL

View full text Add to dashboard Cite

show abstract

“…In this paper, we focus on a specific combination of the standard epistemic logic (EL) for reasoning about knowledge, and the dynamic logic of programs for reasoning about actions (PDL). The same combination has been axiomatically investigated in [25] and [7]. These works are mostly concerned with the following principles connecting knowledge and action:…”

Section: Our Proposalmentioning

confidence: 99%

“…Perfect Recall (PR) claims that agents never forget information once it is acquired. The third condition, called the Church-Rosser axiom in [25], is more evocative known as Reasoning Ability (RA) from [7]. It says that if an agent comes to know that A after some kind of execution of α, then the agent already knows that α could represent a way to obtain A.…”

Section: Our Proposalmentioning

confidence: 99%

Proof theory of epistemic logic of programs

Maffezioli

Naibo

2013

LLP

View full text Add to dashboard Cite

A combination of epistemic logic and dynamic logic of programs is presented. Although rich enough to formalize some simple game-theoretic scenarios, its axiomatization is problematic as it leads to the paradoxical conclusion that agents are omniscient. A cut-free labelled Gentzen-style proof system is then introduced where knowledge and action, as well as their combinations, are formulated as rules of inference, rather than axioms. This provides a logical framework for reasoning about games in a modular and systematic way, and to give a step-by-step reconstruction of agents omniscience. In particular, its semantic assumptions are made explicit and a possible solution can be found in weakening the properties of the knowledge operator.

show abstract

“…Since its introduction by Fischer and Ladner in [9], the scope of dynamic logic has widened to many other areas such as game theory (see [12,18,27]), epistemic logic (see [32]) or natural language (see [31]). The subject is under constant and active development (see [1,2,8,19] for example) and we refer to [17] for an introductory monograph.…”

Section: Introductionmentioning

confidence: 99%

Propositional dynamic logic for searching games with errors

Teheux

2014

Journal of Applied Logic

View full text Add to dashboard Cite

We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the n + 1valued Kripke models and a corresponding language based on a modal extension of Łukasiewicz many-valued logic. We illustrate the definitions by providing a framework for an analysis of the Rényi -Ulam searching game with errors.Our main result is the axiomatization of the theory of the n + 1valued Kripke models. This result is obtained through filtration of the canonical model of the smallest n+1-valued propositional dynamic logic.2010 Mathematics Subject Classification. 03B45, 03B70, 03B50. 2012 ACM Classification. Theory of computation → Logic and verification.

show abstract

Reasoning About Games

Cited by 5 publications

References 10 publications

Towards Paraconsistent Inquiry

Towards Paraconsistent Inquiry

Proof theory of epistemic logic of programs

Propositional dynamic logic for searching games with errors

Contact Info

Product

Resources

About