Amorós, L., Iezzi, A., Lauter, K., Martindale, C., Sotáková, J. (2021) Explicit connections between supersingular isogeny graphs and Bruhat–Tits trees.

In Cojocaru, A.C. Ionica, S. Lorenzo García, E. (Eds.), Women in Numbers Europe III: Research Directions in Number Theory (pp 39-73) (Association for Women in Mathematics Series, Vol. 24). Springer.

Andersson, Claes, Törnberg, A., Törnberg, P. (2014) Author reply..

Current Anthropology, Vol. 55 (pp 169-171)

Comment/Letter to the editor | UvA-DARE

Andrade-Lotero, E., Dutilh-Novaes, C. (2009) A reconstruction of hierarchical relations between incompatibility-entailment, committive, and permissive consequences.

In Amoretti, C. Penco, C. Pitto, F. (Eds.), Proceedings of the Workshop on Bob Brandom's Recent Philosophy of Language: Towards an Analytic Pragmatism (TAP-2009): Genoa, Italy, April 19-23, 2009 (pp 90-98) (CEUR Workshop Proceedings, Vol. 444). CEUR-WS.

Andrade-Lotero, E.J. (2012) Models of language: towards a practice-based account of information in natural language.

Institute for Logic, Language and Computation.

Thesis, fully internal | UvA-DARE

Andrade, E. (2009) Compositionality from a "use-theoretic" perspective.

In Munz, V.A. Puhl, K. Wang, J. (Eds.), Language and world: Pre-proceedings of 32nd International Wittgenstein Symposium (pp 25-26)

Andreka, H., Goranko, V., Mikulas, S., Nemeti, I., Sain, I. (1995) Effective Temporal Logic of Programs.

In Szalas, A. Bolc, E. (Eds.), Time and Logic. UCL Press.

Andreka, H., van Benthem, J.F.A.K., Bezhanishvili, N., Nemeti, I. (2014) Changing a semantics: opportunism or courage?.

In Manzano, M Sain, I. Alonso, E. (Eds.), The life and work of Leon Henkin: essays on his contributions (pp 307-337) (Studies in Universal Logic). Birkhäuser.

Andréka, H., van Benthem, J.F.A.K., Németi, I. (2017) On a New Semantics for First-Order Predicate Logic.

Journal of Philosophical Logic, Vol. 46 (pp 259–267)

Article | https://doi.org/10.1007/s10992-017-9429-y | UvA-DARE

Andréka, H., van Benthem, J.F.A.K., Németi, I. (2023) A note on the submodel preservation property in fragments of first-order logic.

ArXiv.

Preprint | https://doi.org/10.48550/arXiv.2303.13222 | UvA-DARE

Anscombe, S., Jahnke, F. (2024) Characterizing NIP henselian fields.

Journal of the London Mathematical Society, Vol. 109

Article | https://doi.org/10.1112/jlms.12868 | UvA-DARE

Anttila, A., Häggblom, M., Yang, F. (2025) Axiomatizing modal inclusion logic and its variants.

Archive for Mathematical Logic, Vol. 64 (pp 755–793)

Article | https://doi.org/10.1007/s00153-024-00957-y | UvA-DARE

Anttila, A.I. (2025) Not nothing: Nonemptiness in team semantics.

Thesis, fully internal | UvA-DARE

Antunes, L., Buhrman, H., Matos, A., Souto, A., Teixeira, A. (2016) Distinguishing Two Probability Ensembles with One Sample from each Ensemble.

Theory of Computing Systems, Vol. 59 (pp 517-531)

Article | https://doi.org/10.1007/s00224-015-9661-1 | UvA-DARE

Antunes, L., Costa, A ., Matos, A., Vitanyi, P. (2007) Computational Depth of Infinite Strings Revisited.

In Cooper, S.B. Kent, T.F. Löwe, B. Sorbi, A. (Eds.), Computation and Logic in the Real World: Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007 : local proceedings (pp 36-44)

Antunes, L., Matos, A., Souto, A., Vitányi, P. (2008) Depth as randomness deficiency.

Institute for Logic, Language and Computation.

Working paper | http://arxiv.org/abs/0809.2546 | UvA-DARE

Antunes, L., Matos, A., Souto, A., Vitányi, P. (2009) Depth as randomness deficiency.

Theory of Computing Systems, Vol. 45 (pp 724-739)

Article | https://doi.org/10.1007/s00224-009-9171-0 | UvA-DARE

Antunes, L., Souto, A., Vitányi, P.M.B. (2013) On Logical Depth and the Running Time of Shortest Programs.

ArXiv.

Preprint | https://doi.org/10.48550/arXiv.1310.6976 | UvA-DARE

Antunes, L.F., Souto, A., Vitányi, P.M.B. (2017) On the rate of decrease in logical depth.

Theoretical Computer Science, Vol. 702 (pp 60-64)

Article | https://doi.org/10.1016/j.tcs.2017.08.012 | UvA-DARE

Apers, S., de Wolf, R. (2020) Quantum Speedup for Graph Sparsification, Cut Approximation and Laplacian Solving.

In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science: FOCS 2020 : proceedings : 16-19 November 2020, virtual conference (pp 637-648). IEEE.

Apt, K., Conitzer, V., Guo, M., Markakis, E. (2008) Welfare undominated Groves mechanisms.

In Papadimitriou, C. Zhang, S. (Eds.), Internet and Network Economics: 4th International Workshop, WINE 2008, Shanghai, China, December 17-20, 2008 : proceedings (pp 426-437) (Lecture Notes in Computer Science, Vol. 5385). Springer.