-
Review of Symbolic Logic, Vol. 14 (pp 766-811)Article | https://doi.org/10.1017/S1755020319000686 | UvA-DARE
-
Özgün, A., Schoonen, T. (2022) The Logical Development of Pretense Imagination.Erkenntnis, Vol. 89 (pp 2121–2147)Article | https://doi.org/10.1007/s10670-021-00476-9 | UvA-DARE
-
Oziewicz, Z., Velázquez-Quesada, F.R. (2009) Multigraph of multigraphs.Academic research, Vol. 23 (pp 69-99)Article | UvA-DARE
-
Ozols, M., Allerstorfer, R., Christandl, M., Grinko, D., Nechita, Ion, Rochette, Denis, Verduyn Lunel, P.H. (2023) Monogamy of highly symmetric states.ArXiv.Preprint | https://doi.org/10.48550/arXiv.2309.16655 | UvA-DARE
-
Ozols, M., Cornelissen, A., Mande, N.S., de Wolf, R. (2021) Exact quantum query complexity of computing Hamming weight modulo powers of two and three.ArXiv.Preprint | https://doi.org/10.48550/arXiv.2112.14682 | UvA-DARE
-
Ozols, M., Grinko, D., Burchardt, A. (2023) Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information.ArXiv.Preprint | https://doi.org/10.48550/arXiv.2310.02252 | UvA-DARE
-
Ozols, M., Grinko, D. (2024) Linear programming with unitary-equivariant constraints.Communications in Mathematical PhysicsArticle | https://doi.org/10.48550/arXiv.2207.05713 | UvA-DARE
-
Ozols, M., Walter, M. (2018) Hoe programmeer je een kwantumcomputer?. Translated title of the contribution: How to program a quantum computer?ag connectArticle | UvA-DARE
-
Ozols, M., Walter, M. (2019) The Quantum Quest.Quantum Quest.Web publication or website | https://www.quantum-quest.org/ | UvA-DARE
-
Özyıldız, D., Qing, C., Roelofsen, F., Romero, M., Uegaki, W. (2023) A Crosslinguistic Database for Combinatorial and Semantic Properties of Attitude Predicates.In Beinborn, L. Goswami, K. Muradoğlu, S. Sorokin, A. Kumar, R. Shcherbakov, A. Ponti, E.M. Cotterell, R. Vylomova, E. (Eds.), The 5th Workshop on Research in Computational Linguistic Typology and Multilingual NLP: SIGTYP 2023 : Proceedings of the Workshop : May 6, 2023 (pp 65-75). Association for Computational Linguistics.Conference contribution | https://doi.org/10.18653/v1/2023.sigtyp-1.7 | UvA-DAREPacuit, E., Arló-Costa, H. (2006) Classical Systems of First-Order Modal Logic.Studia Logica, Vol. 84 (pp 171-210)Article | UvA-DAREPacuit, E., Parikh, R., Cogan, E. (2006) The Logic of Knowledge Based Obligation.Synthese, Vol. 149 (pp 311-341)Article | UvA-DAREPacuit, E., Parikh, R. (2006) Social Interaction, Knowledge, and Social Software.In Goldin, D. Smolka, S. Wegner, P. (Eds.), Interactive Computation: The New Paradigm (pp 441-461). Springer-Verlag.Chapter | UvA-DAREPacuit, E., Parikh, R. (2007) Reasoning about Communication Graphs.In van Benthem, J Löwe, B Gabbay, D (Eds.), Interactive Logic (pp 135-157) (Texts in Logic and Games). AUP.Chapter | UvA-DAREPacuit, E. (2007) Towards a Logical Analysis of Adjusted Winner.In Gupta, A Parikh, R van Benthem, J (Eds.), Logic at the Crossroads: An Interdisciplinary View (pp 318-330). Allied Publishers Pvt. Ltd.Chapter | UvA-DAREPacuit, E. (2007) Some Comments on History Based Structures.Journal of Applied Logic, Vol. 5 (pp 613-624)Article | UvA-DAREPacuit, E. (2007) Understanding the Brandenburger-Keisler Belief Paradox.Studia Logica, Vol. 86 (pp 435-454)Article | UvA-DAREPagin, P., van Rooij, R., Akerman, J. (2013) Philosophy of language and mind.Synthese, Vol. 190 (pp 1731-1733)Editorial | https://doi.org/10.1007/s11229-013-0258-4 | UvA-DAREPal, S., Mitra, M., Kamps, J. (2011) Evaluation effort, reliability and reusability in XML retrieval.Journal of the American Society for information Science and Technology, Vol. 62 (pp 375-394)Article | https://doi.org/10.1002/asi.21403 | UvA-DAREPalmigiano, A., Re, R. (2010) Topological groupoid quantales.Studia Logica, Vol. 95 (pp 125-137)Article | https://doi.org/10.1007/s11225-010-9251-9 | UvA-DARE
The data of this list is taken from the Pure database. If you find output is missing from the list, please follow the previous link to find out how to submit to Pure. In case there are mistakes in PURE, please contact illc at uva.nl