Bauwens, B., & Terwijn, S. A. (2009). Notes on sum-tests and independence tests. Theory of Computing Systems, 48(2), 247–268. https://doi.org/10.1007/s00224-009-9240-4 ( reposiTUm)

Terwijn, S. A. (2008). On the structure of the Medvedev lattice. Journal of Symbolic Logic, 73(2), 543–558. https://doi.org/10.2178/jsl/1208359059 ( reposiTUm)

Terwijn, S. A. (2007). Kripke models, distributive lattices, and Medvedev degrees. Studia Logica, 85(3), 319–332. https://doi.org/10.1007/s11225-007-9054-9 ( reposiTUm)

Hitchcock, J. M., Lutz, J. H., & Terwijn, S. A. (2007). The arithmetical complexity of randomness and dimension. ACM Transactions on Computational Logic, HTTP://PORTAL.ACM.ORG/CITATION.CFM?ID=1227845(8). http://hdl.handle.net/20.500.12708/168738 ( reposiTUm)

Calude, C., Staiger, L., & Terwijn, S. A. (2006). On partial randomness. Annals of Pure and Applied Logic, 138, 20–30. http://hdl.handle.net/20.500.12708/172057 ( reposiTUm)

Downey, R., Hirschfeldt, D. R., Nies, A., & Terwijn, S. A. (2006). Calibrating randomness. Bulletin of Symbolic Logic, 12, 411–491. http://hdl.handle.net/20.500.12708/172059 ( reposiTUm)

Terwijn, S. A. (2006). Constructive logic and the Medvedev lattice. Notre Dame Journal of Formal Logic, 47, 73–82. http://hdl.handle.net/20.500.12708/172058 ( reposiTUm)

Terwijn, S. A. (2006). The Medvedev lattice of computably closed sets. Archive for Mathematical Logic, 45, 179–190. http://hdl.handle.net/20.500.12708/172030 ( reposiTUm)

Terwijn, S. A. (2005). Randomness, relativization and Turing degrees. Journal of Symbolic Logic, 70(2), 515–535. http://hdl.handle.net/20.500.12708/171947 ( reposiTUm)

Terwijn, S. A. (2005). Probabilistic logic and induction. Journal of Logic and Computation, 15(4), 507–515. http://hdl.handle.net/20.500.12708/171945 ( reposiTUm)

Terwijn, S. A. (2009). Decidability and undecidability in probability logic. In S. Artemov & A. Nerode (Eds.), Logical Foundations of Computer Science. Springer Verlag. https://doi.org/10.1007/978-3-540-92687-0_30 ( reposiTUm)

Terwijn, S. A. (2006). Learning and computing in the limit. In Proceedings of the ASL Logic Colloquium 2002 (pp. 349–359). Association for Symbolic Logic. http://hdl.handle.net/20.500.12708/40634 ( reposiTUm)

Terwijn, S. A. (2005). Kripke models, distributive lattices, and Medvedev degrees. In New Computational Paradigms, CiE 2005 (LNCS 3526) (p. 486). Springer. http://hdl.handle.net/20.500.12708/40585 ( reposiTUm)

Terwijn, S. A. (2007). Constructive logic and computational lattices. 3rd MATHLOGAPS Workshop, Aussois, France, EU. http://hdl.handle.net/20.500.12708/118297 ( reposiTUm)

Terwijn, S. A. (2007). Algorithmic randomness and Turing degrees. Séminaire "Complexité, Logique et Informatique, Université Paris VII, Paris, France, EU. http://hdl.handle.net/20.500.12708/118299 ( reposiTUm)

Terwijn, S. A. (2007). Kripke models, distributive lattices, and Medvedev degrees. Informatik Seminar, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118298 ( reposiTUm)

Terwijn, S. A. (2007). Intervals in the Medvedev lattice. Conference on Logic, Computability and Randomness, 2007, Buenos Aires, Argentina, Non-EU. http://hdl.handle.net/20.500.12708/118300 ( reposiTUm)

Terwijn, S. A. (2007). On the structure of the Medvedev lattice. Moscow-Vienna Workshop on Logic and Computation 2007, TU Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118296 ( reposiTUm)

Terwijn, S. A. (2007). Embeddings into the Medvedev lattice. Collegium Logicum 2007, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118295 ( reposiTUm)

Terwijn, S. A. (2006). Randomness and relativization. Wissenswertes aus der Mathematik, TU Wien, Wien, Austria. http://hdl.handle.net/20.500.12708/117900 ( reposiTUm)

Terwijn, S. A. (2006). Randomness and relativization. Logic Seminar of the University of Vienna, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/117901 ( reposiTUm)

Terwijn, S. A. (2006). On the difference between Martin-Löf randomness and Schnorr randomness. 2nd meeting on Kolmogorov complexity and applications, Dagstuhl, Wadern, Germany, EU. http://hdl.handle.net/20.500.12708/117902 ( reposiTUm)

Terwijn, S. A. (2006). Intermediate logics and factors of the Medvedev lattice. 3rd Paris-Vienna Workshop on Proof Theory, Paris, France, EU. http://hdl.handle.net/20.500.12708/117899 ( reposiTUm)

Terwijn, S. A. (2006). Intervals in the Medvedev lattice. Utrecht University, Utrecht, Netherlands, EU. http://hdl.handle.net/20.500.12708/117898 ( reposiTUm)

Terwijn, S. A. (2005). Intuitionistic logic and Medvedev degrees. University of Athens, Athen, Greece, EU. http://hdl.handle.net/20.500.12708/117653 ( reposiTUm)

Terwijn, S. A. (2005). Constructive logic and factors of the Medvedev lattice. Second Florence - Vienna Workshop on Logic and Computation, Florenz, Italy, EU. http://hdl.handle.net/20.500.12708/117652 ( reposiTUm)

Terwijn, S. A. (2005). Computability and randomness. University of Cape Town, Cape Town, South Africa, Non-EU. http://hdl.handle.net/20.500.12708/117651 ( reposiTUm)

Terwijn, S. A. (2005). Logic and Medvedev degrees. Universität Heidelberg, Heidelberg, Germany, EU. http://hdl.handle.net/20.500.12708/117656 ( reposiTUm)

Terwijn, S. A. (2005). Randomness, diagonalization, and domination properties. ASL meeting Stanford, Stanford, USA, Non-EU. http://hdl.handle.net/20.500.12708/117657 ( reposiTUm)

Terwijn, S. A. (2005). Kripke models, distributive lattices, and Medvedev degrees. Computability in Europe, Amsterdam, Netherlands, EU. http://hdl.handle.net/20.500.12708/117655 ( reposiTUm)

Terwijn, S. A. (2005). Constructive logic and Medvedev degrees. Computational Prospects of Infinity, Singapore, Singapore, Non-EU. http://hdl.handle.net/20.500.12708/117654 ( reposiTUm)

Terwijn, S. A. (2004). Logic and Medvedev degrees. 3rd International Moscow-Vienna worksop on Logic and Computation, Moskau, Russland, Austria. http://hdl.handle.net/20.500.12708/117327 ( reposiTUm)

Terwijn, S. A. (2004). Logic and probabilistic induction. Vienna-Paris Wokshop on Proofs and Complexity, Paris, Frankreich, Austria. http://hdl.handle.net/20.500.12708/117302 ( reposiTUm)

Terwijn, S. A. (2004). Introduction to algorithmic randomness. Workshop on Computability in Hierarchies and Topological Spaces, Siena, Italy, Austria. http://hdl.handle.net/20.500.12708/117303 ( reposiTUm)

Terwijn, S. A. (2004). Logic, computation and Medvedev degrees. Workshop on Computability in Hierarchies and Topological Spaces, Siena, Italy, Austria. http://hdl.handle.net/20.500.12708/117304 ( reposiTUm)

Terwijn, S. A. (2004). Uniformly enumerable families. 1st Florence-Vienna Workshop on Logic and Computation, Florence, Italy, Austria. http://hdl.handle.net/20.500.12708/117306 ( reposiTUm)

Terwijn, S. A. (2004). Algorithmic randomness. City University of New York logic seminar, New York, USA, Austria. http://hdl.handle.net/20.500.12708/117305 ( reposiTUm)

Terwijn, S. A. (2003). Limit computability and constructive measure. Meeting on Kolmogorov complexity, Wadern, Germany, Austria. http://hdl.handle.net/20.500.12708/116506 ( reposiTUm)

Terwijn, S. A. (2003). Schnorr measure and randomness revisited. Workshop on Computability and Logic, Heidelberg, Germany, Austria. http://hdl.handle.net/20.500.12708/116505 ( reposiTUm)

Terwijn, S. A. (2003). Effective measure and Hausdorff dimension. University of Wellington, Wellington, New Zealand, Austria. http://hdl.handle.net/20.500.12708/116507 ( reposiTUm)

Terwijn, S. A. (2003). Complexity and randomness. University of Auckland, Auckland, New Zealand, Austria. http://hdl.handle.net/20.500.12708/116508 ( reposiTUm)

Terwijn, S. A. (2003). Complexity and randomness. Logic Seminar of the University of Turin, Turin, Italy, Austria. http://hdl.handle.net/20.500.12708/116500 ( reposiTUm)

Terwijn, S. A. (2003). Randomness and Turing degrees. Computer Science Seminar of the Vienna University of Technology, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/116501 ( reposiTUm)

Terwijn, S. A. (2003). The arithmetical complexity of dimension and randomness. 17th International Workshop CSL 2003, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/116503 ( reposiTUm)

Terwijn, S. A. (2003). Uniformly enumerable families. 5th International Symposium on Language, Logic and Computation, Tbilisi, Georgia, Austria. http://hdl.handle.net/20.500.12708/116502 ( reposiTUm)

Terwijn, S. A. (2007). Constructive logic and computational lattices [Professorial Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/186402 ( reposiTUm)