Note on Degrees of Partial Functions

DOI10.2307/2034233zbMATH Open0101.01201OpenAlexW4247532688MaRDI QIDQ3282933FDOQ3282933

Authors: John Myhill 

Publication date: 1961

Full work available at URL: https://doi.org/10.2307/2034233

zbMATH Keywords

foundationsphilosophymathematical logic

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• On restricted forms of enumeration reducibility
• The \(n\)-rea enumeration degrees are dense
• Enumeration reducibility and computable structure theory
• Characterizing the continuous degrees
• The high/low hierarchy in the local structure of the \(\omega\)-enumeration degrees
• There exists a maximal 3-c.e. enumeration degree
• Some properties of an algebra of all sets of naturals e-reducible to a fixed set
• Bibliography of John Myhill
• Charakterisierung der Aufzählungsreduzierbarkeit
• Density of the cototal enumeration degrees

This page was built for publication: Note on Degrees of Partial Functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3282933)