Preuves et jeux sémantiques
Denis Bonnay
Philosophia Scientiae
(2004)
- Volume: 8, Issue: 2, page 105-123
- ISSN: 1281-2463
Hintikka makes a distinction between two kinds of games: truth-constituting games and truth-seeking games. His well-known game-theoretical semantics for first-order classical logic and its independence-friendly extension belongs to the first class of games. In order to ground Hintikka’s claim that truth-constituting games are genuine verification and falsification games that make explicit the language games underlying the use of logical constants, it would be desirable to establish a substantial link between these two kinds of games. Adapting a result from Thierry Coquand, we propose such a link, based on a slight modification of Hintikka’s games, in which we allow backward playing for . In this new setting, it can be proven that sequent rules for first-order logic, including the cut rule, are admissible, in the sense that for each rule, there exists an algorithm which turns winning strategies for the premisses into a winning strategy for the conclusion. Thus, proofs, as results of truth-seeking games, can be seen as effectively providing the needed winning strategies on the semantic games.
Bonnay, Denis. "Preuves et jeux sémantiques." Philosophia Scientiae 8.2 (2004): 105-123. <http://eudml.org/doc/103721>.
@article{Bonnay2004,
author = {Bonnay, Denis},
journal = {Philosophia Scientiae},
language = {fre},
number = {2},
pages = {105-123},
publisher = {Éditions Kimé},
title = {Preuves et jeux sémantiques},
url = {http://eudml.org/doc/103721},
volume = {8},
year = {2004},
}
TY - JOUR
AU - Bonnay, Denis
TI - Preuves et jeux sémantiques
JO - Philosophia Scientiae
PY - 2004
PB - Éditions Kimé
VL - 8
IS - 2
SP - 105
EP - 123
LA - fre
UR - http://eudml.org/doc/103721
ER -
You must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.
