Haegeman, J., Swingle, B., Walter, M., Colter, J., Evenbly, G., Scholz, V.B. (2018) Rigorous Free-Fermion Entanglement Renormalization from Wavelet Theory.

Physical Review X, Vol. 8

Article | https://doi.org/10.1103/PhysRevX.8.011003 | UvA-DARE

Halava, V., Hirvensalo, M., de Wolf, R. (1999) Decidability and undecidability of marked PCP.

In Proceedings of 16th Annual Symposium on Theoretical Aspects of Computer Science (STACS'99) (pp 210-219). Springer.

Halava, V., Hirvensalo, M., de Wolf, R. (2001) Marked PCP is decidable.

Theoretical Computer Science, Vol. 255 (pp 193-204)

Article | https://doi.org/10.1016/S0304-3975(99)00163-2 | UvA-DARE

Haldar, S., Vitányi, P.M.B. (2002) Bounded concurrent timestamp systems using vector clocks.

Journal of the Association for Computing Machinery, Vol. 49 (pp 101-123)

Article | https://doi.org/10.1145/505241.505246 | UvA-DARE

Hall, M., Huurdeman, H., Koolen, M.H.A., Skov, M., Walsh, D. (2014) Overview of the INEX 2014 Interactive Social Book Search Track.

In Cappellato, L. Ferro, N. Halvey, M. Kraaij, W. (Eds.), Working Notes for CLEF 2014 Conference: Sheffield, UK, September 15-18, 2014 (pp 480-493) (CEUR Workshop Proceedings, Vol. 1180). CEUR-WS.

Hamami, Y., Roelofsen, F. (2015) Logics of questions.

Synthese, Vol. 192 (pp 1581-1584)

Editorial | https://doi.org/10.1007/s11229-015-0736-y | UvA-DARE

Hamami, Y., Roelofsen, F. (2015) Special Section on Logic of Questions.

Synthese, Vol. 192 (pp 1581-1784)

Special issue (Editorship) | http://link.springer.com/journal/11229/192/6/page/1 | UvA-DARE

Hamkins, J.D., Linetsky, D., Miller, R.G. (2007) The complexity of quickly decidable ORM-decidable sets.

In Cooper, S.B. 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 : proceedings (pp 488-496) (Lecture Notes in Computer Science, Vol. 4497). Springer.

Hamkins, J.D., Löwe, B. (2005) The Modal Logic of Forcing.

Technical Reports. Institute for Logic, Language and Computation.

Working paper | UvA-DARE

Hamkins, J.D., Löwe, B. (2008) The modal logic of forcing.

Transactions of the Americal Mathematical Society, Vol. 360 (pp 1793-1817)

Article | https://doi.org/10.1090/S0002-9947-07-04297-3 | UvA-DARE

Hamkins, J.D., Löwe, B. (2013) Moving up and down in the generic multiverse.

In Lodaya, K. (Eds.), Logic and Its Applications: 5th International Conference, ICLA 2013, Chennai, India, January 10-12, 2013 : proceedings (pp 139-147) (Lecture Notes in Computer Science
FoLLI Publications on Logic, Language and Information, Vol. 7750). Springer.

Hamkins, J.D., Miller, R.G. (2007) Post’s problem for ordinal register machines.

In Cooper, S.B. 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 : proceedings (pp 358-367) (Lecture Notes in Computer Science, Vol. 4497). Springer.

Hamkins, J.D. (2005) Infinitary computability with infinite time.

In Löwe, B. Cooper, B. (Eds.), New Computational Paradigms. Springer-Verlag.

Hamkins, J.D. (2007) A survey of infinite time Turing machines.

In Durand-Lose, J. Margenstern, M. (Eds.), Machines, Computations, and Universality: 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007 : proceedings (pp 62-71) (Lecture Notes in Computer Science, Vol. 4664). Springer.

Hamm, F., Kamp, J.A.W., van Lambalgen, M. (2006) There is no opposition between formal and cognitive semantics.

Theoretical Linguistics, Vol. 32 (pp 1-40)

Article | https://doi.org/10.1515/TL.2006.001 | UvA-DARE

Hamm, F., van Lambalgen, M. (2002) Formal foundations for semantic theories of nominalisation.

In Lang, E. Zimmermann, I. (Eds.), ZAS Papers in Linguistics: Nominalisation (pp 1-22). ZAS.

Han, A.L.-F., Wong, D.F., Chao, L.S., Lu, Y., He, L., Tian, L. (2014) A Universal Phrase Tagset for Multilingual Treebanks.

In Sun, M. Liu, Y. Zhao, J. (Eds.), Chinese Computational Linguistics and Natural Language Processing Based on Naturally Annotated Big Data: 13th China National Conference, CCL 2014, and Second International Symposium, NLP-NABD 2014, Wuhan, China, October 18-19, 2014 : proceedings (pp 247-258) (Lecture Notes in Computer Science
Lecture Notes in Artificial Intelligence, Vol. 8801). Springer.

Han, A.L.-F., Zeng, X., Wong, D.F., Chao, L.S. (2015) Chinese Named Entity Recognition with Graph-based Semi-supervised Learning Model.

In Yu, L.-C. Sui, Z. Zhang, Y. Ng, V. (Eds.), ACL-IJCNLP 2015: The 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing : proceedings of the Eighth SIGHAN Workshop on Chinese Language Processing : July 30-31, 2015, Beijing, Chi (pp 15-20). Association for Computational Linguistics.

Hanna, M., Belinkov, Y., Pezzelle, S. (2023) When Language Models Fall in Love: Animacy Processing in Transformer Language Models.

In Bouamar, H. Pino, J. Bali, K. (Eds.), The 2023 Conference on Empirical Methods in Natural Language Processing: EMNLP 2023 : Proceedings of the Conference : December 6-10, 2023 (pp 12120-12135). Association for Computational Linguistics.

Hansen, H.H., Kupke, C., Marti, J., Venema, Y. (2018) Parity Games and Automata for Game Logic.

In Madeira, A. Benevides, M. (Eds.), Dynamic Logic. New Trends and Applications: First International Workshop, DALI 2017, Brasilia, Brazil, September 23-24, 2017 : proceedings (pp 115-132) (Lecture Notes in Computer Science, Vol. 10669). Springer.