Extracting Herbrand trees in classical realizability using forcing

Abstract : Krivine presented in [Kri10] a methodology to combine Cohen's forcing with the theory of classical realizability and showed that the forcing condition can be seen as a reference that is not subject to backtracks. The underlying classical program transformation was then analyzed by Miquel [Miq11] in a fully typed setting in classical higher-order arithmetic (PAω⁺). As a case study of this methodology, we present a method to extract a Herbrand tree from a classical realizer of inconsistency, following the ideas underlying the compactness theorem and the proof of Herbrand's theorem. Unlike the traditional proof based on König's lemma (using a fixed enumeration of atomic formulas), our method is based on the introduction of a particular Cohen real. It is formalized as a proof in PAω⁺, making explicit the construction of generic sets in this framework in the particular case where the set of forcing conditions is arithmetical. We then analyze the algorithmic content of this proof.
Document type :
Conference papers
Complete list of metadatas

https://hal-ens-lyon.archives-ouvertes.fr/ensl-00814278
Contributor : Lionel Rieg <>
Submitted on : Wednesday, December 11, 2013 - 9:34:14 PM
Last modification on : Monday, October 15, 2018 - 2:34:01 PM
Long-term archiving on : Friday, March 14, 2014 - 10:51:40 AM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Lionel Rieg. Extracting Herbrand trees in classical realizability using forcing. Computer Science Logic 2013, Simona Ronchi Della Rocca, Sep 2013, Turin, Italy. pp.15, ⟨10.4230/LIPIcs.CSL.2013.i⟩. ⟨ensl-00814278v2⟩

Share

Metrics

Record views

215

Files downloads

88