DeepAI AI Chat
Log In Sign Up

Sequential algorithms and the computational content of classical proofs

by   Thomas Powell, et al.

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. We discuss general constructions on algorithms which represent specific patterns which often appear in classical reasoning, and in particular, we develop a computational interpretation of the rule of dependent choice which is phrased purely on the level of algorithms, giving us a clearer insight into the computational meaning of proofs in classical analysis.


page 1

page 2

page 3

page 4


Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs

The problem of giving a computational meaning to classical reasoning lie...

On the Compressed-Oracle Technique, and Post-Quantum Security of Proofs of Sequential Work

We revisit the so-called compressed oracle technique, introduced by Zhan...

Constructive Galois Connections

Galois connections are a foundational tool for structuring abstraction i...

Dempster-Shafer Belief Function - A New Interpretation

We develop our interpretation of the joint belief distribution and of ev...

Circular Proofs as Session-Typed Processes: A Local Validity Condition

Proof theory provides a foundation for studying and reasoning about prog...

Visibility Reasoning for Concurrent Snapshot Algorithms

Visibility relations have been proposed by Henzinger et al. as an abstra...

On an Interpretation of ResNets via Solution Constructions

This paper first constructs a typical solution of ResNets for multi-cate...