| No. | Title | Author | Year |
|---|---|---|---|
| 1 | Gödel’s Theorem Without Tears - Essential Incompleteness in Synthetic Computability | Kirst, Dominik et al. | 2023 |
| 2 | An Analysis of Tennenbaum’s Theorem in Constructive Type Theory | Hermes, Marc et al. | 2022 |
| 3 | Computational Back-And-Forth Arguments in Constructive Type Theory | Kirst, Dominik | 2022 |
| 4 | Undecidability of Dyadic First-Order Logic in Coq | Hostert, Johannes et al. | 2022 |
| 5 | Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq | Kirst, Dominik et al. | 2021 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 5 |