( en | de | ru )

 

Disambiguation of "Miller, Joseph S."

Author of the publication

copydeleteadd this publication to your clipboard
Connected choice and the Brouwer fixed point theorem.

, , , and . J. Math. Log., 19 (1): 1950004:1-1950004:46 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Joseph Miller

S Hüttelmaier

S Leopold

S Steinlechner

S Ulrich

 

Other publications of authors with the same name

Every 1-generic computes a properly 1-generic., , , , and . J. Symb. Log., 71 (4): 1385-1393 (2006)Degrees of unsolvability of continuous functions.. J. Symb. Log., 69 (2): 555-584 (2004)Denjoy, Demuth and density., , , and . J. Math. Log., 14 (1): 1450004 (2014)Counting the changes of random Δ20 sets., , , , and . J. Log. Comput., 25 (4): 1073-1089 (2015)Pa Relative to an Enumeration Oracle., , , and . J. Symb. Log., 88 (4): 1497-1525 (2023)The complements of Lower cones of Degrees and the degree spectra of Structures., , , , , and . J. Symb. Log., 81 (3): 997-1006 (2016)A Structural Dichotomy in the Enumeration Degrees., , , and . J. Symb. Log., 87 (2): 527-544 (2022)Computing from projections of random points., , and . J. Math. Log., 20 (1): 1950014 (2020)Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata.. HSCC, volume 1790 of Lecture Notes in Computer Science, page 296-309. Springer, (2000)On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals.. Computability and Complexity, volume 10010 of Lecture Notes in Computer Science, page 644-659. Springer, (2017)