Peano arithmetic, games and descent recursion

DOI10.1016/J.APAL.2024.103550MaRDI QIDQ7032980zbMATH OpenFDO

Authors Emanuele Frittaion

Publication date 4 February 2025

Published in Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.APAL.2024.103550

zbMATH Keywords

Coquand's game semanticscut eliminationelementary descent recursionPeano arithmetic

Mathematics Subject Classification ID

Foundations of classical theories (including reverse mathematics) (03B30) Cut-elimination and normal-form theorems (03F05) Recursive ordinals and ordinal notations (03F15) First-order arithmetic and fragments (03F30)

Cites work

• A semantics of evidence for classical arithmetic
• Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
• Elementary descent recursion and proof theory
• Estimation of the length of interactions in arena game semantics
• Finite investigations of transfinite derivations
• Game semantics and the geometry of backtracking: a new complexity analysis of interaction
• Gödel's Reformulation of Gentzen's First Consistency Proof For Arithmetic: The No-Counterexample Interpretation
• scientific article; zbMATH DE number 107511 (Why is no real title available?)
• scientific article; zbMATH DE number 1241698 (Why is no real title available?)
• scientific article; zbMATH DE number 3327279 (Why is no real title available?)
• scientific article; zbMATH DE number 3333259 (Why is no real title available?)
• scientific article; zbMATH DE number 3095470 (Why is no real title available?)
• Notation systems for infinitary derivations
• On full abstraction for PCF: I, II and III
• On the computational content of the axiom of choice
• Proofs and computations

This page was built for publication: Peano arithmetic, games and descent recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7032980)