Moritz Müller talks
Moritz Müller
moritz.mueller@univie.ac.at
Talks
2018
Partially definable forcing
Dagstuhl Seminar 18051 Proof Compexity, Schloss Dagstuhl, Germany.
2017
On the relative strength of finitary combinatory principles.
KGRC Forschungsseminar, Universität Wien, Austria.
Proof complexity.
Algebra Seminar, TU Wien, Austria.
Cobham recursive set functions.
Barcelona Set Theory Seminar, Universitat de Barcelona, Spain.
2016
Proof Complexity II
Departamento de Lenguajes y Sistemas Informaticos, Facultad de Informatica, UPV-EHU, San-Sebastian (Donostia), Spain.
Proof Complexity I
Departamento de Lenguajes y Sistemas Informaticos, Facultad de Informatica, UPV-EHU, San-Sebastian (Donostia), Spain.
Proof Complexity
Habilitationsvortrag, Fakultät für Mathematik, Universität Wien, Austria.
2015
Cobham recursive set functions and weak set theories.
Kurt Gödel Research Center (KGRC), University of Vienna, Austria.
Cobham recursive set functions.
Departamento de Lenguajes y Sistemas Informaticos, Facultad de Informatica UPV-EHU, San-Sebastian (Donostia), Spain.
Cobham recursive set functions.
BASICS 2015 Summer School, Logic Summer School in China 2015, Zhejiang Normal University, Jinhua, China.
Forcing against weak arithmetics.
Oberseminar Mathematische Logik, University of Freiburg, Germany.
2014
Topological dynamics of unordered Ramsey structres.
Kurt Gödel Research Center (KGRC), University of Vienna, Austria.
About homomorphism problems.
Algorithmic Model Theory (AlMoTh), Uni Kassel, Germany, February 2014.
2013
Revisiting space in proof complexity: treewidth and pathwidth.
38th Mathematical Foundations of Computer Science (MFCS), IST Austria, Klosterneuburg, Austria, August 2013.
Weak pigeonhole principles
KGRC, Vienna, Austria, March 2013.
Graph invariants in proof complexity
Algorithmic Model Theory (AlMoTh), TU Berlin, Germany, February 2013.
Graph invariants in proof complexity
École Polytechnique, Laboratoire d'Informatique (LIX), Paris, France, February 2013.
Forcing against weak arithmetics
Séminaire Complexité Logique et Informatique, Université Paris Diderot, Paris 7, France, February 2013.
2012
Some definitorial suggestions for parameterized proof complexity
7th International Symposium of Parameterized and Exact Computation, Ljubljana, Slovenia, September 2012.
Hard instances for algorithms and proof systems
Computability in Europe (CiE), Turing Centenary Conference, Cambridge, UK. June 2012.
Parameterizations of strong proof systems
Mini-Workshop on Logic, Proofs and Algorithms, Vienna Center for Logic and Algorithms (VCLA), Vienna, Austria, June 2012.
Refutation complexity of relativized spectra
Kurt Gödel Research Center (KGRC), University of Vienna, Austria, April 2012.
On the refutation complexity of relativized spectra
Algorithmic Model Theory (AlMoTh), University of Ilmenau, Germany, February 2012.
On lower bounds for Res(k)
Vienna Center of Logic and Algorithms (VCLA), Vienna, Austria. January 2012.
2011
Positive Horn definability in Aleph0-categorical structures
Kurt Gödel Research Center (KGRC), University of Vienna, Austria, October 2011.
Some definitorial suggestions for parameterized proof complexity
Proof Complexity workshop, Banff International Research Station (BIRS), Banff, Canada. October 2011.
Partially definable forcing and bounded arithmetic
Infinity Conference, Centre de Resecra Matematica (CRM), Bellaterra (Barcelona), Spain. July 2011.
Consistency and optimality
Computability in Europe (CiE), Sofia, Bulgaria, June 2011.
Partially definable forcing
Algorithmic Model Theory (AlMoTh), University of Leipzig, Germany, February 2011.
2010
Undefinable forcing in bounded arithmetic
Prague Logic Seminar, Mathematical Institute, Academy of Sciences, Czech Republic, November 2010.
Probabilistic algorithmic optimality
International Workshop Logical Approaches to Barriers in Computing and Complexity, University of Greifswald, Germany, February 2010.
2009
Kernelization theory
International Workshop on Kernelization (WorKer'09), University of Bergen, Norway, September 2009.
Effective Hausdorff dimension
Escuela de Matematicas, Universidad Industrial de Santander, Colombia, April 2009.
Aesthetic principles in the work of E. A. Poe and Kolmogorov Complexity
Interdisciplinary conference Faktum versus Fiktum on mathematics in literature, University of Freiburg, Germany, March 2009.
2008
Parameterized intractability
Mini-Symposium: Intractability and Cognitive Modelling, Radboud University Nijmegen, The Netherlands, June 2008.
Parameterized derandomization
3rd International Workshop on Parameterized and Exact Computation, Victoria, Canada, May 2008.
Kernelization lower bounds
Algorithmic Model Theory (AlMoTh) , University of Freiburg, Germany, February 2008.
2007
Weighted satisfiability problems for circuits with weird gates
Department of Technology Management, University of Eindhoven, The Netherlands. June 2007.
The parameterized complexity of uniqueness promisses
Informatics Department, University of Bergen, Norway, June 2007.
2006
Randomized approximations of parameterized counting problems
2nd International Workshop on Parameterized and Exact Computation, Zürich, Switzerland, September 2006.
Approximation of parameterized counting problems
Algorithmic Model Theory (AlMoTh), RWTH Aachen, Germany, February 2006.