-
Honingh, A.K. (2006) The origin and well-formedness of tonal pitch structures.ILLC.Thesis, fully internal | UvA-DARE
-
Honingh, A.K. (2009) Compactness in the Euler-lattice: A parsimonious pitch spelling model.Musicae Scientiae, Vol. 13 (pp 117-138)Article | https://doi.org/10.1177/1029864909013001005 | UvA-DARE
-
Hoogland, E., Marx, M. (2000) Interpolation in guarded fragments.Technical Report. Institute for Logic Language and Computation.Working paper | UvA-DARE
-
Hoogland, E., Marx, M. (2002) Interpolation in the guarded fragment.Studia Logica, Vol. 70 (pp 273-409)Article | UvA-DARE
-
Hoogland, E. (1999) Algebraic Characterizations of Various Beth Definability Properties.vg logic/info (oud WINS).Report | UvA-DARE
-
Hoogland, E. (2000) Algebraic characterizations of various Beth definability properties.Studia Logica, Vol. 65 (pp 91-112)Article | UvA-DARE
-
Hoogland, E. (2001) Definability and Interpolation: Model-theoretic investigations.Institute for Logic, Language and Computation.Thesis, fully internal | UvA-DARE
-
Hornischer, L., Berto, F. (2025) The Logic of Dynamical Systems Is Relevant.Mind, Vol. 134 (pp 670–706)Article | https://doi.org/10.1093/mind/fzaf012 | UvA-DARE
-
Hornischer, L. (2019) Toward a Logic for Neural Networks.In Sedlár, I. Blicha, M. (Eds.), The Logica Yearbook 2018 (pp 133-148). College Publications.Chapter | UvA-DAREHornischer, L. (2020) Logics of Synonymy.Journal of Philosophical Logic, Vol. 49 (pp 767–805)Article | https://doi.org/10.1007/s10992-019-09537-5 | UvA-DAREHornischer, L. (2021) The Logic of Information in State Spaces.Review of Symbolic Logic, Vol. 14 (pp 155-186)Article | https://doi.org/10.1017/S1755020320000222 | UvA-DAREHornischer, L.A. (2021) Dynamical systems via domains: Toward a unified foundation of symbolic and non-symbolic computation.ILLC dissertation series. Institute for Logic, Language and Computation.Thesis, fully internal | UvA-DAREHoshi, T. (2009) Epistemic Dynamics and Protocol Information.Thesis, fully external | UvA-DAREHosseini, K., Beelen, K., Colavizza, G., Ardanuy, M.C. (2021) Neural Language Models for Nineteenth-Century English.Journal of Open Humanities Data, Vol. 7Article | https://doi.org/10.48550/arXiv.2105.11321 | UvA-DAREHoyer, P., Lee, T.J., Spalek, R. (2006) Negative weights makes adversaries stronger.Berkeley University.Working paper | UvA-DAREHoyer, P., Spalek, R. (2003) Quantum circuits with unbounded fan-out.In Symposium on Theoretical Aspects of Computer ScienceConference contribution | UvA-DAREHoyer, P., Spalek, R. (2005) Quantum Fan-out is Powerful.Theory of Computing, Vol. 1 (pp 83-101)Hoyer, P., Spalek, R. (2005) Tight adversary bounds for composite functions.Unknown Publisher.Hoyer, P., Spalek, R. (2005) Lower Bounds on Quantum Query Complexity.Bulletin of the European Association for Theoretical Computer Science, Vol. 87 (pp 78-103)Hsu, A.S., Chater, N., Vitányi, P. (2013) Language learning from positive evidence, reconsidered: A simplicity-based approach.Topics in Cognitive Science, Vol. 5 (pp 35-55)Article | https://doi.org/10.1111/tops.12005 | 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