Pith. sign in

REVIEW

The Grothendieck computability model

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2404.17923 v1 pith:LEB345OO submitted 2024-04-27 math.CT

The Grothendieck computability model

classification math.CT
keywords computabilitygrothendieckmodelcategoryfirst-projection-simulationintroducemodelsopfibration-simulation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.