@inproceedings{10.1145/3373718.3394745,
    Address = {New York, NY, USA},
    Author = {Powell, Thomas},
    BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science},
    ISBN = {9781450371049},
    Keywords = {continuous functionals, domain theory, Zorn's lemma, higher-order computability, G\"{o}del's functional interpretation},
    Location = {Saarbr\"{u}cken, Germany},
    Pages = {768--781},
    Publisher = {Association for Computing Machinery},
    Series = {LICS '20},
    Title = {On the Computational Content of Zorn's Lemma},
    URL = {https://doi.org/10.1145/3373718.3394745},
    Year = {2020},
    bdsk-url-1 = {https://doi.org/10.1145/3373718.3394745},
    date-added = {2020-07-04 09:52:48 +0200},
    date-modified = {2020-07-04 09:52:48 +0200},
    numpages = {14},
    doi = {10.1145/3373718.3394745}
}

@inproceedings{10.1145/3373718.3394745, Address = {New York, NY, USA}, Author = {Powell, Thomas}, BookTitle = {Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science}, ISBN = {9781450371049}, Keywords = {continuous functionals, domain theory, Zorn's lemma, higher-order computability, G\"{o}del's functional interpretation}, Location = {Saarbr\"{u}cken, Germany}, Pages = {768--781}, Publisher = {Association for Computing Machinery}, Series = {LICS '20}, Title = {On the Computational Content of Zorn's Lemma}, URL = {https://doi.org/10.1145/3373718.3394745}, Year = {2020}, bdsk-url-1 = {https://doi.org/10.1145/3373718.3394745}, date-added = {2020-07-04 09:52:48 +0200}, date-modified = {2020-07-04 09:52:48 +0200}, numpages = {14}, doi = {10.1145/3373718.3394745} }