In memoriam Georges Kalinowski
We give a procedure to obtain falsity conditions for IF-sentences, using Skolemization. The expressive power of an IF-sentence can then be strongly captured by a pair of Σ11-sentences1. A result from [Burgess 2003] shows that, conversely, any pair of incompatible Σ11-sentences corresponds with an I...
Gardado en:
| Autor Principal: | |
|---|---|
| Formato: | Article ou chapitre numérique |
| Idioma: | Français |
| Publicado: |
2006
|
| Acceso en liña: | Accès Université d'Orléans et IFPM Accès Université d'Orléans et IFPM |
| Résumé: | We give a procedure to obtain falsity conditions for IF-sentences, using Skolemization. The expressive power of an IF-sentence can then be strongly captured by a pair of Σ11-sentences1. A result from [Burgess 2003] shows that, conversely, any pair of incompatible Σ11-sentences corresponds with an IF-sentence.In the second part, we reflect on the influence of the order of the steps (inside-out versus outside-in) in the Skolemization procedures for IF-logic. We also reflect on the nature of game theoretical negation. |
|---|