# Realizability interpretation of PA by iterated limiting PCA

@article{Akama2014RealizabilityIO,
title={Realizability interpretation of PA by iterated limiting PCA},
author={Y. Akama},
journal={Mathematical Structures in Computer Science},
year={2014},
volume={24}
}
• Y. Akama
• Published 2014
• Computer Science, Mathematics
• Mathematical Structures in Computer Science
For any partial combinatory algebra (PCA for short) $\mathcal{A}$, the class of $\mathcal{A}$-representable partial functions from $\mathbb{N}$ to $\mathcal{A}$ quotiented by the filter of cofinite sets of $\mathbb{N}$ is a PCA such that the representable partial functions are exactly the limiting partial functions of $\mathcal{A}$-representable partial functions (Akama 2004). The n-times iteration of this construction results in a PCA that represents any n-iterated limiting partial recursive… Expand
1 Citations

#### Topics from this paper

Analysis and Prediction of Exon Skipping Events from RNA-Seq with Sequence Information Using Rotation Forest
• Computer Science, Medicine
• International journal of molecular sciences
• 2017

#### References

SHOWING 1-10 OF 28 REFERENCES
Limiting partial combinatory algebras
• Y. Akama
• Mathematics, Computer Science
• Theor. Comput. Sci.
• 2004
Classical logic as limit completion
• S. Berardi
• Computer Science, Mathematics
• Mathematical Structures in Computer Science
• 2005
On the Interpretation of Intuitionistic Number Theory
• S. Kleene
• Mathematics, Computer Science
• J. Symb. Log.
• 1945
On the Computational Content of the Axiom of Choice
• Mathematics, Computer Science
• J. Symb. Log.
• 1998
Metamathematics of First-Order Arithmetic
• Mathematics, Computer Science
• Perspectives in mathematical logic
• 1993