2026-07-21T20:26:14Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:4221 2024-03-06T10:34:55Z ddc:004 open_access

Extracting Herbrand trees in classical realizability using forcing Rieg, Lionel classical realizability forcing Curry-Howard correspondence Herbrand trees Krivine presented in [Krivine, 2011] 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 [Miquel, 2011] in a fully typed setting in classical higher-order arithmetic (PA-omega^+). 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 completeness 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-omega^+, 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Lionel Rieg 2013 Is Part Of LIPIcs, Volume 23, Computer Science Logic 2013 (CSL 2013) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2013.597 urn:nbn:de:0030-drops-42212 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.597 eng https://creativecommons.org/licenses/by/3.0/legalcode