Strengthening prompt simplicity

DOI10.2178/JSL/1309952528zbMATH Open1247.03074OpenAlexW2137859318MaRDI QIDQ3173534FDOQ3173534

Keng Meng Ng, David Diamondstone

Publication date: 10 October 2011

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1309952528

Recommendations

• Simplicity simplified
• Simplicity
• Strong semi-simplicity
• Simplicity Is the Point
• Prime simplicity
• From Stability to Simplicity
• A simplification of the theory of simplicity

zbMATH Keywords

lownesswtt-degreeprompt simplicitystrong promptnesssuperlow cuppability

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Cites Work

• Title not available (Why is that?)
• Lowness properties and randomness
• Strong jump-traceability. I: The computably enumerable case
• TOTALLY ω-COMPUTABLY ENUMERABLE DEGREES AND BOUNDING CRITICAL TRIPLES
• Promptness does not imply superlow cuppability

Cited In (2)

• Prompt simplicity, array computability and cupping
• Simplicity

This page was built for publication: Strengthening prompt simplicity

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