×

Found 495 Documents (Results 1–100)

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

The consistency of arithmetic from a point of view of constructive tableau method with strong negation, Part I: the system without complete induction. arXiv:2010.07368

Preprint, arXiv:2010.07368 [math.LO] (2020).
BibTeX Cite
Full Text: arXiv

On relating theories: proof-theoretical reduction. (English) Zbl 1469.03160

Centrone, Stefania (ed.) et al., Mathesis universalis, computability and proof. Based on the Humboldt-Kolleg “Proof theory as mathesis universalis”, held at the German-Italian Centre for European Excellence, Villa Vigoni, Loveno di Menaggio, Como, Italy, July 24–28, 2017. Cham: Springer. Synth. Libr. 412, 311-331 (2019).
PDFBibTeX XMLCite
Full Text: DOI Link

Computational interpretations of classical reasoning: from the epsilon calculus to stateful programs. (English) Zbl 1469.03161

Centrone, Stefania (ed.) et al., Mathesis universalis, computability and proof. Based on the Humboldt-Kolleg “Proof theory as mathesis universalis”, held at the German-Italian Centre for European Excellence, Villa Vigoni, Loveno di Menaggio, Como, Italy, July 24–28, 2017. Cham: Springer. Synth. Libr. 412, 255-290 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

From mathesis universalis to provability, computability, and constructivity. (English) Zbl 1469.03113

Centrone, Stefania (ed.) et al., Mathesis universalis, computability and proof. Based on the Humboldt-Kolleg “Proof theory as mathesis universalis”, held at the German-Italian Centre for European Excellence, Villa Vigoni, Loveno di Menaggio, Como, Italy, July 24–28, 2017. Cham: Springer. Synth. Libr. 412, 203-234 (2019).
PDFBibTeX XMLCite
Full Text: DOI

From mathesis universalis to fixed points and related set-theoretic concepts. (English) Zbl 1469.03140

Centrone, Stefania (ed.) et al., Mathesis universalis, computability and proof. Based on the Humboldt-Kolleg “Proof theory as mathesis universalis”, held at the German-Italian Centre for European Excellence, Villa Vigoni, Loveno di Menaggio, Como, Italy, July 24–28, 2017. Cham: Springer. Synth. Libr. 412, 113-129 (2019).
PDFBibTeX XMLCite
Full Text: DOI

Setoid type theory – a syntactic translation. (English) Zbl 1434.03034

Hutton, Graham (ed.), Mathematics of program construction. 13th international conference, MPC 2019, Porto, Portugal, October 7–9, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11825, 155-196 (2019).
MSC:  03B38 03B40 03F25
PDFBibTeX XMLCite
Full Text: DOI

A functional interpretation with state. (English) Zbl 1453.03065

Proceedings of the 2018 33rd annual ACM/IEEE symposium on logic in computer science, LICS 2018, Oxford, UK, July 9–12, 2018. New York, NY: Association for Computing Machinery (ACM). 839-848 (2018).
MSC:  03F25 03F10 03F30
PDFBibTeX XMLCite
Full Text: DOI

Takeuti’s well-ordering proof: finitistically fine? (English) Zbl 1404.03006

Zack, Maria (ed.) et al., Research in history and philosophy of mathematics. The CSHPM 2017 annual meeting in Toronto, Ontario, Canada, May 2017. Cham: Birkhäuser (ISBN 978-3-319-90855-7/hbk; 978-3-319-90983-7/ebook). Proceedings of the Canadian Society for History and Philosophy of Mathematics/La Société Canadienne d’Histoire et de Philosophie des Mathématiques, 167-180 (2018).
PDFBibTeX XMLCite
Full Text: DOI Link

Interpretations of Presburger arithmetic in itself. (English) Zbl 1503.03046

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10703, 354-367 (2018).
MSC:  03F30 03F25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software