Singleton enumeration reducibility and arithmetic

DOI10.1093/logcom/ext043zbMath1327.03034OpenAlexW2097389540MaRDI QIDQ5406117

Daniele Marsibilio, Andrea Sorbi

Publication date: 1 April 2014

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/ext043

zbMATH Keywords

first-order theorysecond-order arithmeticQ-reducibilitys-reducibility

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (3)

Bounded enumeration reducibility and its degree structure ⋮ Irreducible, singular, and contiguous degrees ⋮ \(Q\)-reducibility and \(m\)-reducibility on computably enumerable sets

This page was built for publication: Singleton enumeration reducibility and arithmetic