Independence and Hintikka games

نویسنده

  • Theo M.V. Janssen
چکیده

This paper investigates the formalization of independence in logic, in particular between quantifiers. We first illustrate that this form of independence plays a role in many fields. A logic that has the possibility to express such a form of independence is Independence Friendly logic (introduced by Hintikka); its semantics is defined by means of strategies in a sequential game. It will be shown that this logic gives results that are in not in accordance with intuitions on independence. An alternative semantics is presented where the logic is interpreted by means of a strategic game. The semantics exploits one assumption: the players are assumed to be rational (they do not play a strategy if there is a better one available). It is shown that this semantics gives results that are in accordance with intuitions about independence.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Imperfect Information in Logic and Concurrent Games

This paper builds on a recent definition of concurrent games as event structures and an application giving a concurrent-game model for predicate calculus. An extension to concurrent games with imperfect information, through the introduction of ‘access levels’ to restrict the allowable strategies, leads to a concurrent-game semantics for a variant of Hintikka and Sandu’s Independence-Friendly (I...

متن کامل

A Strategic Perspective on if Games

Hintikka and Sandu’s Independence-friendly logic ([5] and [6]) has traditionally been associated with extensive games of imperfect information. In this paper we set up a strategic framework for the evaluation of IF logic la Hintikka and Sandu. We show that the traditional semantic interpretation of IF logic can be characterized in terms of Nash equilibria. We note that moving to the strategic f...

متن کامل

On independence-friendly fixpoint logics

We introduce a fixpoint extension of Hintikka and Sandu’s IF (independence-friendly) logic. We obtain some results on its complexity and expressive power. We relate it to parity games of imperfect information, and show its application to defining independence-friendly modal mu-calculi. Philosophia Scientiæ, 8 (2), 2004, 125–144.

متن کامل

Independence and games

Hintikka 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 philosophi...

متن کامل

Team building in dependence

Hintikka and Sandu’s Independence-Friendly Logic was introduced as a logic for partially ordered quantification, in which the independence of (existential) quantifiers from previous (universal) quantifiers is written by explicit syntax. It was originally given a semantics by games of imperfect information; Hodges then gave a (necessarily) second-order Tarskian semantics. More recently, Väänänen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006