2000 character limit reached
Characterizing partitioned assemblies and realizability toposes
Published 28 Apr 2014 in math.CT | (1404.6997v2)
Abstract: We give simple characterizations of the category PAsm(A) of partitioned assemblies, and of the realizability topos RT(A) over a partial combinatory algebra A. This answers the question for an 'extensional characterization' of realizability toposes.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.