-
de Jongh, D., Zhao, Z. (2015) Positive Formulas in Intuitionistic and Minimal Logic.In Aher, M. Hole, D. Jeřábek, E. Kupke, C. (Eds.), Logic, Language, and Computation: 10th International Tbilisi Symposium on Logic, Language, and Computation, TbiLLC 2013, Gudauri, Georgia, September 23-27, 2013: revised selected papers (pp 175-189) (Lecture Notes in Computer Science, Vol. 8984). Springer.Conference contribution | https://doi.org/10.1007/978-3-662-46906-4_11 | UvA-DAREde Jongh, D. (1998) The logic of the provability.In Buss, S. (Eds.), Handbook of proof theory (pp 475-546) (-). North- Holland Elsevier.Chapter | UvA-DAREde Jongh, D. (1998) Solution of a problem of David Guaspari.In Orlowska, E. (Eds.), Logic at work: Essays dedicated to the memory of Helena Rasiowa (pp 246-254) (-). Physica- verlag Springer.Chapter | UvA-DAREde Jongh, D. (2000) Learning and Grammar.In Quesada, J.F. Salguero, F.J. Nepomuceno, A. (Eds.), Logic, Language and Information, Proceedings of the First Workshop on Logica and Language (pp 139-146). Editorial Kronos.Conference contribution | UvA-DAREde Jongh, D. (2001) Intuicionismo.In Murcho, Desidério Branquinho, Joao (Eds.), Enciclopedia de Termos Lógico-Filosóficos (pp 413-417)Chapter | UvA-DAREde Jongh, D. (2004) Volledigheid en Onvolledigheid.Technical Reports. Institute for Logic, Language and Computation.Working paper | UvA-DAREde Jongh, D. (2007) The Incompleteness Theorems, their content and their meaning.Zhexue Dongtai, Vol. 2006 (pp 47-55)Article | UvA-DAREde Jongh, D. (2007) Intuicionismo.Azafea, Vol. 8 (pp 53-69)Article | UvA-DAREde Keijzer, B., Apt, K.R. (2013) The H-index can be Easily Manipulated.Bulletin of the European Association for Theoretical Computer Science, Vol. 110 (pp 79-85)de Keulenaar, E.V., Tuters, M., Kisjes, I., von Beelen, K. (2019) On Altpedias: partisan epistemics in the encyclopaedias of alternative facts.Artnodes : e-journal on art, science and technology, Vol. 24 (pp 22-33)Article | https://doi.org/10.7238/a.v0i24.3300 | UvA-DAREde Nivelle, H., de Rijke, M. (2003) Deciding the guarded fragments by resolution.Journal of Symbolic ComputationArticle | UvA-DAREde Nivelle, H. (1997) A classification of non-liftable orders for resolution.In McCune, W. (Eds.), Conference on Automated Deduction 14 (pp 336-350). Springer Verlag.Chapter | UvA-DAREde Nivelle, J.M.G.G., Areces, C.E. (1999) Prefixed resolution.Technical Report ILLC. vg logic/info (oud WINS).Report | UvA-DAREde Nivelle, J.M.G.G., de Rijke, M. (2000) The Boyer-Moore theorem prover.In Hazewinkel, M. (Eds.), Encyclopedia of Mathematics, Supplement II (pp 83-84). Kluwer.Chapter | UvA-DAREde Nivelle, J.M.G.G., de Rijke, M. (2000) Theorem prover.In Hazewinkel, M. (Eds.), Encyclopedia of Mathematics, Supplement II (pp 452-453). Kluwer.Chapter | UvA-DAREde Nivelle, J.M.G.G., Ganzinger, H. (1999) A Superposition Decision Procedure for the Guarded Fragment with Equality.In Longo, G. (Eds.), Fourteenth Annual IEEE Symposium on Logic in Computer Science (pp 295-303)Chapter | UvA-DAREde Rijke, M., Areces, C.E., de Nivelle, J.M.G.G. (1999) Prefixed Resolution: A Resolution Method for Modal and Description Logic.In Ganzinger, H. (Eds.), Automated Deduction-CADE-16 (pp 187-201) (LNCS). Springer Verlag.Chapter | UvA-DAREde Rijke, M., Heguiabehere, J.M., Infante Lopez, G.G. (2001) Structured problems for modal satisfiability testing.In Areces, C. de Rijke, M. (Eds.), Proceedings of M4M Workshop, 2001Conference contribution | UvA-DAREde Rijke, M., Heguiabehere, J.M. (2001) The random modal qbf test set.In Proceedings IJCAR Workshop on Issues in the Design and Experimental Evaluation of Systems for Modal and Temporal Logics (pp 58-67)Conference contribution | UvA-DAREde Rijke, M., Ó Nualláin, B.S., van Benthem, J.F.A.K. (2001) Ensemble-based prediction of SAT search behaviour.In Kautz, H. Selman, B. (Eds.), Electronic Notes in Discrete Mathematics, volume 9. Elsevier Science Publishers.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