The Grothendieck computability model
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:LEB345OOrecord.jsonopen to challenge →
classification
math.CT
keywords
computabilitygrothendieckmodelcategoryfirst-projection-simulationintroducemodelsopfibration-simulation
read the original abstract
Translating notions and results from category theory to the theory of computability models of Longley and Normann, we introduce the Grothendieck computability model and the first-projection-simulation. We prove some basic properties of the Grothendieck computability model, and we show that the category of computability models is a type-category, in the sense of Pitts. We introduce the notion of a fibration and opfibration-simulation, and we show that the first-projection-simulation is a split opfibration-simulation.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.