Interactive Realizability and the elimination of Skolem functions in Peano Arithmetic
نویسندگان
چکیده
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservative over Peano Arithmetic alone for arithmetical formulas. This result – which shows that the Excluded Middle principle can be used to eliminate Skolem functions – has been previously proved by other techniques, among them the epsilon substitution method and forcing. In our proof, we employ Interactive Realizability, a computational semantics for Peano Arithmetic which extends Kreisel’s modified realizability to the classical case.
منابع مشابه
Eliminating Skolem Functions in Peano Arithmetic with Interactive Realizability
We present a new syntactical proof that first-order Peano Arithmetic with Skolem axioms is conservative over Peano Arithmetic alone for arithmetical formulas. This result – which shows that the Excluded Middle principle can be used to eliminate Skolem functions – has been previously proved by other techniques, among them the epsilon substitution method and forcing. In our proof, we employ Inter...
متن کاملInteractive Realizability for Classical Peano Arithmetic with Skolem Axioms
Interactive realizability is a computational semantics of classical Arithmetic. It is based on interactive learning and was originally designed to interpret excluded middle and Skolem axioms for simple existential formulas. A realizer represents a proof/construction depending on some state, which is an approximation of some Skolem functions. The realizer interacts with the environment, which ma...
متن کاملRealizability for Peano Arithmetic with Winning Conditions in HON Games
We build a realizability model for Peano arithmetic based on winning conditions for HON games. First we define a notion of winning strategies on arenas equipped with winning conditions. We prove that the interpretation of a classical proof of a formula is a winning strategy on the arena with winning condition corresponding to the formula. Finally we apply this to Peano arithmetic with relativiz...
متن کاملInteractive Realizability for second-order Heyting arithmetic with EM1 and SK1
We introduce a classical realizability semantics based on interactive learning for full second-order Heyting Arithmetic with excluded middle and Skolem axioms over Σ1-formulas. Realizers are written in a classical version of Girard’s System F. Since the usual computability semantics does not apply to such a system, we introduce a constructive forcing/computability semantics: though realizers ar...
متن کاملInteractive Learning Based Realizability and 1-Backtracking Games
We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game semantics. In particular, any realizer of an implication-and-negation-free arithmetical formula embodies a winning recursive strategy for the 1-Backtracking version of Tarski games. We also give examples of realizer and winnin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012