Nondensity of Double Bubbles in the D.C.E. Degrees

DOI10.1007/978-3-319-50062-1_33zbMATH Open1485.03149OpenAlexW2558744739MaRDI QIDQ2970979FDOQ2970979

Authors: Uri Andrews, Rutger Kuyper, Steffen Lempp, Mariya I. Soskova, M. M. Yamaleev 

Publication date: 4 April 2017

Published in: Computability and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-50062-1_33

Recommendations

• Nondegeneracy of standard double bubbles
• Non-linear stability of double bubbles under surface diffusion
• scientific article; zbMATH DE number 468938
• The Optimal Double Bubble for Density $r^p$
• Double bubbles in hyperbolic surfaces
• The structure of area-minimizing double bubbles
• Double bubbles for immiscible fluids in \(\mathbb R^n\)
• Double bubbles on the real line with log-convex density
• Non-spherical bubble collapse mechanics in binary solutions
• Double-diffusive density flows

zbMATH Keywords

d.c.e. setsexact degreesLachlan setsErshov hierarchy

Mathematics Subject Classification ID

Other Turing degree structures (03D28)

Cites Work

• On the r. e. predecessors of d. r. e. degrees
• Downward density of exact degrees
• On Downey's conjecture
• Title not available (Why is that?)
• Trial and error predicates and the solution to a problem of Mostowski
• Limiting recursion
• On the degrees less than 0'
• D.R.E. Degrees and the Nondiamond Theorem
• Lower Bounds for Pairs of Recursively Enumerable Degrees
• Title not available (Why is that?)
• On a hierarchy of sets. III
• Title not available (Why is that?)

Cited In (4)

• Downward density of exact degrees
• Primitive recursive equivalence relations and their primitive recursive complexity
• Turing computability: structural theory
• On the problem of definability of the computably enumerable degrees in the difference hierarchy

This page was built for publication: Nondensity of Double Bubbles in the D.C.E. Degrees

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