Table of Contents
Fetching ...

A Friedman--Sheard-style Theory for Classical Realisability

Daichi Hayashi, Graham E. Leigh

TL;DR

This work extends Krivine's classical realisability by formulating a Friedman--Sheard-style, type-free realisability theory $\mathsf{FSR}$ that supports self-referential reasoning. It introduces the generalised compositional realisability $\mathsf{GCR}$ and the Friedman--Sheard realisability system $\mathsf{FSR}$, along with a revision model to handle evolving interpretations and a proof-theoretic analysis showing $\mathsf{FSR}$ is conservative over $\mathsf{PA}$ and closely tied to the truth-theoretic framework $\mathsf{FS}$ viaInterpretations such as $\mathsf{FSR}^{\emptyset}$ and $\mathrm{TI}(<\varphi 20)$. The paper proves self-realisability for $\mathsf{FSR}$ and derives two key applications: a relative truth definability result for $\mathsf{FS}$ and a McGee-style analysis yielding an almost-$\omega$-inconsistency phenomenon, including a dedicated sentence $\gamma$ that exhibits this behavior. Overall, the results illuminate how self-referential realisability can emulate Friedman--Sheard truth constructs while preserving important proof-theoretic properties, suggesting avenues for deeper model-theoretic and ordinal analyses in self-referential arithmetic systems.

Abstract

In Hayashi and Leigh (2024), the authors formulate classical number realisability for first-order arithmetic and a corresponding axiomatic system based on Krivine's classical realisability interpretation. This paper presents a self-referential generalisation of previous results in the spirit of Friedman and Sheard (1987).

A Friedman--Sheard-style Theory for Classical Realisability

TL;DR

This work extends Krivine's classical realisability by formulating a Friedman--Sheard-style, type-free realisability theory that supports self-referential reasoning. It introduces the generalised compositional realisability and the Friedman--Sheard realisability system , along with a revision model to handle evolving interpretations and a proof-theoretic analysis showing is conservative over and closely tied to the truth-theoretic framework viaInterpretations such as and . The paper proves self-realisability for and derives two key applications: a relative truth definability result for and a McGee-style analysis yielding an almost--inconsistency phenomenon, including a dedicated sentence that exhibits this behavior. Overall, the results illuminate how self-referential realisability can emulate Friedman--Sheard truth constructs while preserving important proof-theoretic properties, suggesting avenues for deeper model-theoretic and ordinal analyses in self-referential arithmetic systems.

Abstract

In Hayashi and Leigh (2024), the authors formulate classical number realisability for first-order arithmetic and a corresponding axiomatic system based on Krivine's classical realisability interpretation. This paper presents a self-referential generalisation of previous results in the spirit of Friedman and Sheard (1987).

Paper Structure

This paper contains 14 sections, 41 theorems, 64 equations.

Key Result

lemma thmcounterlemma

The Tarski-biconditional is derivable in $\mathsf{CT}$ for every formula of $\mathcal{L}$. That is, for each formula $A(x_1, \dotsc, x_k)$ of $\mathcal{L}$ in which only the distinguished variables occur free, we have

Theorems & Definitions (78)

  • definition thmcounterdefinition: $\mathsf{CT}$
  • lemma thmcounterlemma
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • corollary thmcountercorollary
  • definition thmcounterdefinition: Compositional Realisability
  • remark thmcounterremark
  • proposition thmcounterproposition: hayashi2024compositional
  • definition thmcounterdefinition
  • definition thmcounterdefinition
  • ...and 68 more