Propositional Games with Explicit Strategies | Zendy

Bryan Renne | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Propositional Games with Explicit Strategies

Author(s) -

Bryan Renne

Publication year - 2006

Publication title -

electronic notes in theoretical computer science

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.242

H-Index - 60

ISSN - 1571-0661

DOI - 10.1016/j.entcs.2006.05.042

Subject(s) - propositional variable , mathematical proof , well formed formula , computer science , propositional calculus , zeroth order logic , embedding , theoretical computer science , autoepistemic logic , propositional formula , game semantics , semantics (computer science) , mathematics , programming language , intermediate logic , artificial intelligence , operational semantics , denotational semantics , description logic , multimodal logic , geometry

This paper introduces a game-theoretic semantics for LP, Artemov's Logic of Proofs, taking the viewpoint that LP is a logic of explicit strategies on propositional verification games. To demonstrate the utility of this viewpoint, we define an embedding of the well-known game of Nim into the propositional verification game, which allows us to extract a winning strategy on a winnable Nim instance by internalizing the proof in LP of the formalized version of that instance

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research