Game Semantics and SCG

http://www.pps.jussieu.fr/~curien/Game-semantics.pdf

Game semantics has had forerunners in logic, recursion theory, and semantics.

In logic, the earliest forerunners are Lorenzen and his coworkers [40]. They considered
the activity of proving a formula as a strategy in what they caled a dialogue
game between two players: Proponent, who is responsible for building the proof,
and Opponent, who chooses to refute the formula or any of the intermediate conclusions
in the (unravelling of the) proof. Unfortunately, most of this work focused on
provability more than on proofs themselves.

(Cartwright, Curien, Felleisen 92 [20]) The model of sequential algorithms (an
early precursor of the game models, due to Berry-Curien [13]) of PCF is not
fully abstract. Adding catch (cf. section 2), the same model becomes fully
abstract (for PCF+catch, thus).

------

http://open-site.org/Science/Mathematics/Logic/Game_Semantics/
Lorenzen, in the late 1950s, was the first to introduce a game semantics. Since then, numerous sorts of game semantics have been introduced and studied in logic. The primary motivation for Lorenz and his student Lorenzen was to find a game-semantical, or dialogue-semantical (as they preferred to call it) justification for intuitionistic logic. Felscher's work signified a climax of this "game semantics for intuitionistic logic" line. Blass was the first to observe connections between game semantics and linear logic. The "game semantics for linear logic" approach was further developed or modified by Abramsky, Jagadeesan, Hyland, Ong and others. Japaridze started treating games as foundational entities in their own right, elaborating a concept of games meant to formalize the intuitive notion of interactive computational problems, and basing his computability logic on such games. 

===============
Game semantics		
Focus on provability (existence of a winning strategy).

SCG
Collection of evidence whether a theorem is true or false.

Game Semantics
Game semantics is an approach in logic that defines the basic semantical concepts of truth or validity in terms of games. 
Game semantics
Game semantics formalize the intuitive notion of 
interactive computational problems.

SCG is an approach in computer science for agents to
collaboratively
solve and pose hard computational problems from 
specific niches (subsets of those problems)
using games and ranking the 
resource-consumption and quality of 
solving and posing by evaluating
the contributions of each agent.

SCG is an approach in computer science to
collect evidence for or against facts in a domain
and its subdomains.
The strength of the evidence depends
on the strength of the participating agents.

The facts can be about algorithmic properties.