National audienceHintikka and Sandu have developed IF logic as a genuine alternative to classical first-order logic : liberalizing dependence schemas between quantifiers, IF would carry out all the ideas already underlying classical logic. But they are alternatives to Hintikka's game-theoretic approach; one could use instead Henkin quantifiers. We will present here some arguments of both technical and philosophical nature in favor of IF. We will show that its notion of independence, once extended to connectives, can indeed claim to be fully general, and that IF logic provides an analysis of independence patterns. This last point will be argued for thanks to an explanation of the epistemic content of IF, through a partial translation into mo...
In this paper, we present a prenex form theorem for a version of Independence Friendly logic, a logi...
In this paper, we present a prenex form theorem for a version of Independence Friendly logic, a logi...
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound var...
National audienceHintikka and Sandu have developed IF logic as a genuine alternative to classical fi...
La logique IF prétend constituer une alternative à la logique classique du premier ordre : en libéra...
This paper investigates the formalization of independence in logic, in particular between quantifier...
In the literature on logics of imperfect information it is often stated, incorrectly, that the Game-...
The doctoral dissertation introduces independence-friendly (IF) modal logic as an extension of stand...
This thesis studies game-theoretically oriented semantics which provide an alternative to traditiona...
Nous introduisons une extension aux points fixes de la logique IF (faite pour l’indépendance) de Hin...
International audienceIn this paper, we introduce a new approach to independent quantifiers, as orig...
AbstractIn this paper, we introduce a new approach to independent quantifiers, as originally introdu...
We analyze the expressive resources of IF logic that do not stem from Henkin (partially-ordered) qua...
It is well-known that Independence Friendly (IF) logic is equivalent to existential secondorder logi...
AbstractIn classical logics, the meaning of a formula is invariant with respect to the renaming of b...
In this paper, we present a prenex form theorem for a version of Independence Friendly logic, a logi...
In this paper, we present a prenex form theorem for a version of Independence Friendly logic, a logi...
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound var...
National audienceHintikka and Sandu have developed IF logic as a genuine alternative to classical fi...
La logique IF prétend constituer une alternative à la logique classique du premier ordre : en libéra...
This paper investigates the formalization of independence in logic, in particular between quantifier...
In the literature on logics of imperfect information it is often stated, incorrectly, that the Game-...
The doctoral dissertation introduces independence-friendly (IF) modal logic as an extension of stand...
This thesis studies game-theoretically oriented semantics which provide an alternative to traditiona...
Nous introduisons une extension aux points fixes de la logique IF (faite pour l’indépendance) de Hin...
International audienceIn this paper, we introduce a new approach to independent quantifiers, as orig...
AbstractIn this paper, we introduce a new approach to independent quantifiers, as originally introdu...
We analyze the expressive resources of IF logic that do not stem from Henkin (partially-ordered) qua...
It is well-known that Independence Friendly (IF) logic is equivalent to existential secondorder logi...
AbstractIn classical logics, the meaning of a formula is invariant with respect to the renaming of b...
In this paper, we present a prenex form theorem for a version of Independence Friendly logic, a logi...
In this paper, we present a prenex form theorem for a version of Independence Friendly logic, a logi...
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound var...