Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Ordinal analysis of partial combinatory algebras (2010.12452v2)

Published 23 Oct 2020 in math.LO and cs.LO

Abstract: For every partial combinatory algebra (pca), we define a hierarchy of extensionality relations using ordinals. We investigate the closure ordinals of pca's, i.e. the smallest ordinals where these relations become equal. We show that the closure ordinal of Kleene's first model is $\omega_1\textit{CK}$ and that the closure ordinal of Kleene's second model is $\omega_1$. We calculate the exact complexities of the extensionality relations in Kleene's first model, showing that they exhaust the hyperarithmetical hierarchy. We also discuss embeddings of pca's.

Citations (5)

Summary

We haven't generated a summary for this paper yet.