Sequential algorithms and the computational content of classical proofs

28 Dec 2018 Powell Thomas

We develop a correspondence between the theory of sequential algorithms and classical reasoning, via Kreisel's no-counterexample interpretation. Our framework views realizers of the no-counterexample interpretation as dynamic processes which interact with an oracle, and allows these processes to be modelled at any given level of abstraction... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • LOGIC IN COMPUTER SCIENCE
  • DATA STRUCTURES AND ALGORITHMS