Easy Proofs of Löwenheim-Skolem Theorems by Means of Evaluation Games

Details

Serval ID
serval:BIB_6C3AAE857E2A
Type
Inproceedings: an article in a conference proceedings.
Collection
Publications
Institution
Title
Easy Proofs of Löwenheim-Skolem Theorems by Means of Evaluation Games
Title of the conference
Proceedings of the Fourth International Conference on Tools for Teaching Logic
Author(s)
Duparc J.
Publisher
Schloss Dagstuhl
Address
Rennes, France
Publication state
Published
Issued date
2015
Editor
Huertas M.A., Marcos J., Manzano M., Pinchinat S., Schwarzentruber F.
Volume
abs/1507.03665
Series
LIPIcs–Leibniz International Proceedings in Informatics
Pages
27-34
Language
english
Notes
DBLP:journals/corr/Duparc15
Abstract
We propose a proof of the downward Löwenheim-Skolem that relies on strategies deriving from evaluation games instead of the Skolem normal forms. This proof is simpler, and easily understood by the students, although it requires, when defining the semantics of first-order logic to introduce first a few notions inherited from game theory such as the one of an evaluation game.
Keywords
Model theory, Löwenheim-Skolem, Game Theory, Evaluation Game,First-Order Logic
Create date
06/04/2016 17:18
Last modification date
21/08/2019 5:14
Usage data