| Polyhedral completeness in intermediate and modal logics S Adam-Day | 7 | 2019 |
| Zero-one laws of graph neural networks S Adam-Day, I Ceylan Advances in Neural Information Processing Systems 36, 2024 | 4 | 2024 |
| Polyhedral completeness of intermediate logics: the Nerve Criterion S Adam-Day, N Bezhanishvili, D Gabelaia, V Marra The Journal of Symbolic Logic 89 (1), 342-382, 2024 | 3 | 2024 |
| Bisimulations of potentialist systems S Adam-Day arXiv preprint arXiv:2206.10359, 2022 | 3 | 2022 |
| The intermediate logic of convex polyhedra S Adam-Day, N Bezhanishvili, D Gabelaia, V Marra arXiv preprint arXiv:2307.16600, 2023 | 2* | 2023 |
| On the continuous gradability of the cut-point orders of R-trees S Adam-Day Topology and its Applications 306, 107937, 2022 | 2 | 2022 |
| Uniform, rigid branchwise-real trees S Adam-Day arXiv preprint arXiv:2206.15344, 2022 | 1 | 2022 |
| Graph neural network outputs are almost surely asymptotically constant S Adam-Day, M Benedikt, İİ Ceylan, B Finkelshtein arXiv preprint arXiv:2403.03880, 2024 | | 2024 |
| Branchwise-real trees and bisimulations of potentialist systems S Adam-Day University of Oxford, 2023 | | 2023 |
| Polyhedral semantics for intermediate logics S Adam-Day, N Bezhanishvili, D Gabelaia, V Marra | | |
| Non-mathematical Content by Mathematical Means S Adam-Day | | |
| The nerve criterion and polyhedral completeness of intermediate logics S Adam-Day, N Bezhanishvili, D Gabelaia, V Marra | | |
| Principles of Reflection in Higher-Order Logic S Adam-Day | | |
| Models of IZF Set Theory S Adam-Day | | |
David GabelaiaResearcher, Razmadze Mathematical InstituteVerified email at rmi.ge
