23,263 research outputs found
Iterated reflection principles over full disquotational truth
Iterated reflection principles have been employed extensively to unfold
epistemic commitments that are incurred by accepting a mathematical theory.
Recently this has been applied to theories of truth. The idea is to start with
a collection of Tarski-biconditionals and arrive by finitely iterated
reflection at strong compositional truth theories. In the context of classical
logic it is incoherent to adopt an initial truth theory in which A and 'A is
true' are inter-derivable. In this article we show how in the context of a
weaker logic, which we call Basic De Morgan Logic, we can coherently start with
such a fully disquotational truth theory and arrive at a strong compositional
truth theory by applying a natural uniform reflection principle a finite number
of times
Proof-theoretic Analysis of Rationality for Strategic Games with Arbitrary Strategy Sets
In the context of strategic games, we provide an axiomatic proof of the
statement Common knowledge of rationality implies that the players will choose
only strategies that survive the iterated elimination of strictly dominated
strategies. Rationality here means playing only strategies one believes to be
best responses. This involves looking at two formal languages. One is
first-order, and is used to formalise optimality conditions, like avoiding
strictly dominated strategies, or playing a best response. The other is a modal
fixpoint language with expressions for optimality, rationality and belief.
Fixpoints are used to form expressions for common belief and for iterated
elimination of non-optimal strategies.Comment: 16 pages, Proc. 11th International Workshop on Computational Logic in
Multi-Agent Systems (CLIMA XI). To appea
- …