-
Heemskerk, E.M., Mokken, R.J., Fennema, M. (2003) From Stakeholders to Shareholders. Corporate Governance Networks in The Netherlands 1976-1996.In SSRN Electronic Paper CollectionChapter | https://doi.org/10.2139/ssrn.411580 | UvA-DAREHeguiabehere, J.M. (2002) Pre- and postcondition reasoning for dynamic first order logic.In Proceedings of the Kurt Gödel SocietyConference contribution | UvA-DAREHeguiabehere, J.M. (2003) Building logic toolboxes.Institute for Logic, Language and Computation.Thesis, fully internal | UvA-DAREHeijink, H., Desain, P., Honing, H., Windsor, W.L. (2000) Make me a match: an evaluation of different approaches to score-performance macthing.Computer Music Journal, Vol. 24 (pp 43-56)Article | https://doi.org/10.1162/014892600559173 | UvA-DAREHella, L., Väänänen, J. (2015) The Size of a Formula as a Measure of Complexity.In Hirvonen, Å. Kontinen, J. Kossak, R. Villaveces, A. (Eds.), Logic without borders: essays on set theory, model theory, philosophical logic, and philosophy of mathematics (pp 193-214) (Ontos Mathematical Logic). De Gruyter.Hemaspaandra, L.A., Torenvliet, L. (1996) Optimal advice.Theoretical Computer Science, Vol. 154 (pp 367-377)Article | https://doi.org/10.1016/0304-3975(95)00076-3 | UvA-DAREHemaspaandra, L.A., Torenvliet, L. (2002) Theory of Semi-Feasible Algorithms.EATCS Monographs in Theoretical Computer Science. Springer-Verlag.Book | UvA-DAREHemaspaandra, L.A., Torenvliet, L. (2006) P-Selectivity, Immunity, and the power of one bit.Lecture Notes in Computer Science, Vol. 3831 (pp 323-331)Article | UvA-DAREHemaspaandra, L.A., Torenvliet, L. (2010) Theory of semi-feasible algorithms.Monographs in Theoretical Computer Science: an EATCS Series. Springer.Book | UvA-DAREHenderson, J., Merlo, P., Titov, I., Musillo, G. (2013) Multilingual Joint Parsing of Syntactic and Semantic Dependencies with a Latent Variable Model.Computational Linguistics, Vol. 39 (pp 949-998)Article | https://doi.org/10.1162/COLI_a_00158 | UvA-DAREHendriks, A., de Jongh, D. (1996) Finitely generated Magari algebras and arithmetic.In Agliano, P. Ursini, A. (Eds.), Logic and algebra (pp 137-160). Marcel Dekker, Inc..Chapter | UvA-DAREHendriks, A., de Jongh, D. (2001) Characterization of strongly equivalent logic programs in intermediate logics.PP series ILLC. Institute for Logic Language and Computation.Working paper | UvA-DAREHendriks, A. (1996) Computations in Propositional Logic.Thesis, fully internal | UvA-DAREHendriks, A. (1999) System Description: Akka, A workbench for Mathematical Logic.In de Rijke, M. (Eds.), M4M. Methods for Modalities 1. ILLC.Chapter | UvA-DAREHendriks, A. (1999) Effective Logic Computation, Klaus Truemper [Review of: (1999) Effective Logic Computation].Journal of Logic, Language and Information, Vol. 8Book/Film/Article/Exhibition review | UvA-DAREHendriks, A. (2000) Doing logic by computer: interpolation in fragments of intuitionistic propositional logic.Annals of Pure and Applied Logic, Vol. 104 (pp 97-112)Hendriks, A. (2001) Explorations in extensions of intuitionistic propositional logic.In de Rijke, M. e.a. (Eds.), Workshop Proceedings Methods for Modalities 2. Amsterdam University Press.Conference contribution | UvA-DAREHendriks, A. (2004) Explorations and Computations in bidirectional intuitionistic propositional Logic.In Liber Amicorum voor Dick de Jongh. Amsterdam University Press.Conference contribution | UvA-DAREHendriks, H.L.W. (1993) Studied flexibility : categories and types in syntax and semantics.Institute for Logic, Language and Computation.Thesis, fully internal | UvA-DAREHendriks, H.L.W. (1999) The Logic of Tune. A Proof-Theoretic Analysis of Intonation.In Lecomte, A. (Eds.), LACL 97. Logical Aspects of Cumputational Linguistics (pp 132-159) (LNCS-LNAI Series). Springer Verlag.Chapter | 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