Sequential algorithms and strongly stable functions (Q2570134): Difference between revisions

The author develops a graph-theoretic approach to game semantics by shifting from sequential game plays on trees to sequential games played on acyclic graphs. This clarifies the sequential nature of hypercoherence spaces, and the reasons why the sequential algorithm hierarchy collapses extensionally to strongly stable hierarchy. The results underline more asynchronous and concurrent forms of game semantics --- even in the study of sequentiality.