Corpus ID: 57189169

Sequential algorithms and the computational content of classical proofs

@article{Powell2018SequentialAA,
  title={Sequential algorithms and the computational content of classical proofs},
  author={Thomas Powell},
  journal={ArXiv},
  year={2018},
  volume={abs/1812.11003}
}
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… Expand

Topics from this paper

An algorithmic approach to the existence of ideal objects in commutative algebra

References

SHOWING 1-10 OF 28 REFERENCES
A Game-Theoretic Computational Interpretation of Proofs in Classical Analysis
Sequential Algorithms on Concrete Data Structures
Extracting constructive content from classical proofs
Computational interpretations of classical reasoning: From the epsilon calculus to stateful programs
Sequential abstract-state machines capture sequential algorithms
On the Interpretation of Non-Finitist Proofs - Part I
  • G. Kreisel
  • Mathematics, Computer Science
  • J. Symb. Log.
  • 1951
A constructive interpretation of Ramsey's theorem via the product of selection functions
A functional interpretation with state
Applied Proof Theory - Proof Interpretations and their Use in Mathematics
  • U. Kohlenbach
  • Mathematics, Computer Science
  • Springer Monographs in Mathematics
  • 2008
Gödel’s functional interpretation and the concept of learning
  • Thomas Powell
  • Computer Science
  • 2016 31st Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)
  • 2016
...
1
2
3
...