Realizability interpretation of PA by iterated limiting PCA

DOI10.1017/S0960129513000856zbMath1342.03039arXiv1307.5521MaRDI QIDQ5740403

Yohji Akama

Publication date: 26 July 2016

Published in: Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.5521

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Combinatory logic and lambda calculus (03B40)

Cites Work

• Unnamed Item
• Models of arithmetic and recursive functions
• Limiting partial combinatory algebras
• Unitary Theories, Unitary Categories
• On the computational content of the axiom of choice
• Classical logic as limit completion
• Relative Interpretations
• On the interpretation of intuitionistic number theory
• Towards the animation of proofs -- testing proofs by examples

This page was built for publication: Realizability interpretation of PA by iterated limiting PCA