Back to Results
First PageMeta Content
Mathematics / Mathematical analysis / Theory of computation / Computability theory / Theoretical computer science / Computation in the limit / Computable function / Differential forms on a Riemann surface / Congruence lattice problem


DEGREES BOUNDING PRINCIPLES AND UNIVERSAL INSTANCES IN REVERSE MATHEMATICS LUDOVIC PATEY ABSTRACT. A Turing degree d bounds a principle P of reverse mathematics if every computable instance of P has a d-computable soluti
Add to Reading List

Document Date: 2015-07-04 03:53:43


Open Document

File Size: 246,54 KB

Share Result on Facebook