Results 1  10
of
19
Games in Philosophical Logic
, 1999
"... Semantic games are an important evaluation method for a wide range of logical languages, and are frequently resorted to when traditional methods do not easily apply. A case in point is a family of independencefriendly (IF) logics which allow regulation over information flow in formulas, and thus pe ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
(Show Context)
Semantic games are an important evaluation method for a wide range of logical languages, and are frequently resorted to when traditional methods do not easily apply. A case in point is a family of independencefriendly (IF) logics which allow regulation over information flow in formulas, and thus perfect information fails in the games associated with such formulas. This mechanism of imperfect information is studied in this paper. It is noted that imperfect information of players often gives rise to the gametheoretic phenomenon of imperfect recall. Furthermore, independencefriendliness in epistemic logic is investigated. We also discuss a couple of misunderstandings that have occurred in the literature concerning IF firstorder logics and gametheoretical semantics, related to such issues as intuitionism, constructivism, truthdefinitions, mathematical prose, and the status of set theory. By straighten out these misunderstandings, we hope to show the importance of the role semantics ga...
Guarded Quantification in Least Fixed Point Logic
, 2002
"... We develop a variant of Least Fixed Point logic based on First Order logic with a relaxed version of guarded quantification. We develop a Game Theoretic Semantics of this logic, and find that under reasonable conditions, guarding quantification does not reduce the expressibility of Least Fixed Point ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We develop a variant of Least Fixed Point logic based on First Order logic with a relaxed version of guarded quantification. We develop a Game Theoretic Semantics of this logic, and find that under reasonable conditions, guarding quantification does not reduce the expressibility of Least Fixed Point logic. But guarding quantification increases worstcase time complexity.
Logic games, from tools to models of interaction
 Dissertation, Marie Curie Centre ‘Gloriclass’, Institute for Logic, Language and Computation, University of Amsterdam
, 2007
"... This paper is based on tutorials on “Logic and Games ” at the 7th ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
This paper is based on tutorials on “Logic and Games ” at the 7th
Model checking logics of strategic ability: Complexity
 In Specification and Verification of MultiAgent Systems
, 2010
"... Abstract This chapter is about model checking and its complexity in some of the main temporal and strategic logics, e.g. LTL, CTL, and ATL. We discuss several variants of ATL (perfect vs. imperfect recall, perfect vs. imperfect information) as well as two different measures for model checking with c ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Abstract This chapter is about model checking and its complexity in some of the main temporal and strategic logics, e.g. LTL, CTL, and ATL. We discuss several variants of ATL (perfect vs. imperfect recall, perfect vs. imperfect information) as well as two different measures for model checking with concurrent game structures (explicit vs. implicit representation of transitions). Finally, we summarize some results about higher order representations of the underlying models. 1
unknown title
"... The century that was Logic has played an important role in modern philosophy, especially, in alliances with philosophical schools such as the Vienna Circle, neopositivism, or formal language variants of analytical philosophy. The original impact was via the work of Frege, Russell, and other pioneer ..."
Abstract
 Add to MetaCart
(Show Context)
The century that was Logic has played an important role in modern philosophy, especially, in alliances with philosophical schools such as the Vienna Circle, neopositivism, or formal language variants of analytical philosophy. The original impact was via the work of Frege, Russell, and other pioneers, backed up by the prestige of research into the foundations of mathematics, which was fast bringing to light those amazing insights that still impress us today. The Golden Age of the 1930s deeply affected philosophy, and heartened the minority of philosophers with a formalanalytical bent. As Brand Blanshard writes in Reason and Analysis (1964) – I quote from memory here, to avoid the usual disappointment when rereading an original text: &quot;It was as if a little band of stragglers, in weary disarray after a lost battle, suddenly found Napoleon's legions marching right alongside of them...&quot; In the 1940s and 1950s, people like Carnap, Reichenbach, Quine, and their students made logicbased methodology a highly visible modus operandi in the field. Then, in the 1960s, what came to be called 'philosophical logic ' began to flourish, and logicians like Hintikka, Geach, Dummett, Kripke, Lewis, and Stalnaker came to prominence, not
Negotiation Games and Conflict Resolution in Logical Semantics
"... The purpose of this paper is to explore the extent in which the idea of using negotiation games in tandem with the theory of semantic games is relevant to the concept of meaning in logical semantics. The need for such negotiations is argued to arise when some formulas are logically noncoherent, whi ..."
Abstract
 Add to MetaCart
(Show Context)
The purpose of this paper is to explore the extent in which the idea of using negotiation games in tandem with the theory of semantic games is relevant to the concept of meaning in logical semantics. The need for such negotiations is argued to arise when some formulas are logically noncoherent, which in turn may take place because of conflicts between the players playing the associated nonstrictly competitive semantic languagegames on these formulas.
Models for commandresponse interfaces
, 2003
"... It is only relatively recently that in computer science we have begin to exploit the idea that proofs are essentially executable programs, although it emerged from intuitionistic mathematics some decades before the first digital computers ran programs. One application, as it were from logic to compu ..."
Abstract
 Add to MetaCart
It is only relatively recently that in computer science we have begin to exploit the idea that proofs are essentially executable programs, although it emerged from intuitionistic mathematics some decades before the first digital computers ran programs. One application, as it were from logic to computer science, has been in the design of ever more expressive type systems for programming. The situation is currently that typecheckers have been written for a range of experimental functional programming languages in which the type systems are sufficiently rich to express propositions, logical connectives, predicates, quantifiers, relations, predicate transformers, temporal and modal operators, and everything any one has ever asked for to write fully precise mathematical specifications, or the reasoning that underlies the construction of a program to meet a precise specification. The kind of programs we can write using these type systems are programs that denote mathematical values; they do not of themselves actually do anything or exhibit behaviour. Rather, we do something with them, or make practical application of them, or somehow use a mathematical value as a guide to action. Put crudely, the puzzles