×

Found 51 Documents (Results 1–51)

The computational significance of Hausdorff’s maximal chain principle. (English) Zbl 07633512

Anselmo, Marcella (ed.) et al., Beyond the horizon of computability. 16th conference on computability in Europe, CiE 2020, Fisciano, Italy, June 29 – July 3, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12098, 239-250 (2020).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI

A diagram of choice: the curious case of Wallis’s attempted proof of the parallel postulate and the axiom of choice. (English) Zbl 1518.01005

Pietarinen, Ahti-Veikko (ed.) et al., Diagrammatic representation and inference. 11th international conference, Diagrams 2020, Tallinn, Estonia, August 24–28, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12169, 74-90 (2020).
MSC:  01A45 51-03
PDFBibTeX XMLCite
Full Text: DOI

On the computational content of Zorn’s lemma. (English) Zbl 1498.03153

Proceedings of the 2020 35th annual ACM/IEEE symposium on logic in computer science, LICS 2020, virtual event, July 8–11, 2020. New York, NY: Association for Computing Machinery (ACM). 768-781 (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Well quasi-orders and the functional interpretation. (English) Zbl 1496.03234

Schuster, Peter M. (ed.) et al., Well-quasi orders in computation, logic, language and reasoning. A unifying concept of proof theory, automata theory, formal languages and descriptive set theory. Based on the minisymposium on well-quasi orders: from theory to applications within the Jahrestagung der Deutschen Mathematiker-Vereinigung (DMV), Hamburg, Germany, September 21–25, 2015 and the Dagstuhl seminar 16031 on well quasi-orders in computer science, Schloss Dagstuhl, Germany, January 17–22, 2016. Cham: Springer. Trends Log. Stud. Log. Libr. 53, 221-269 (2020).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Database

all top 3

Main Field

Biographic Reference

Software