Conference and Workshops Slides.

• ASL annual meeting. Chicago, IL, June 2003.
Embedding Jump Upper Semilattices into the Turing Degrees.
• Computability and Logic Workshop. Heidelberg, Germany, June 2003.
Embedding Jump Upper Semilattices into the Turing Degrees (2nd part).
• Southeastern Logic Symposium. Gainesvile, FL, March 2004.
There is no order in the Generalized High/Low Hierarchy.
• Logic, Computability and Randomness. Cordoba, Argentina, September 2004.
  
Up to equimorphism, hyperarithmetic is recursive (25 min).   (1 hour version).
• Fall 2004, AMS Central Section Meeting, Evanston, IL, October 2004.
  On Fraïssé's Conjecture and some equivalent statements.
  
• Joint Mathematics meetings. Atlanta, GA, January 2005.
  On the proof-theoretic strength of Jullien's results.
• ASL annual meeting, Stanford, CA, March 2005.
  A minimal pair of K-degrees. Joint work with Barbara F. Csima.
• Computational Prospects of infinity. Singapore, July-August 2005.
  Indecomposable linear orderings and Theories of Hyperarithmetic Analysis.
• Southeastern Logic Symposium. Gainesvile, FL, March 10-12 of 2006.
  Plenary talk. Equimorphism invariants for scattered linear orderings.
  
•  AMS Central Section Meeting.  Notre Dame, IN, April, 8,9 of 2006.
  Computable linearizations of well-partial-orderings.
  
• Greater Boston Logic Conference, Boston, MA, May 12-14 of 2006.
  Well-quasi-orderings and computability theory.
  
• Annual Meeting of the ASL, Montreal, Canada,  May 17-21 of 2006.
  Plenary talk. Equimorphisms types of Linear Orderings.
  
• ASL Summer Meeting "Logic Colloquium '06". Nijmegen, Netherlands, 27 July- 2 Aug. of 2006.
   Plenary talk. Embeddability and decidability in the Turing Degrees.
• Proof Theory of arithmetic, Kyoto, Japan, August 21st-23rd of 2006.
  Aspects of Computability Theory.
  Theories of Hyperarithmetic Analysis.
  
• Workshop on Computability, Randomness and Model theory, Auckland, New Zealand, Nov 8-9 2006.
  Equimorphism invariants for scattered linear orderings.
  
• Mini-Workshop: Logic, Combinatorics and Independence Results, Oberwolfach, Germany, Nov 26th - Dec 2nd, 2006.
  Theories of Hyperarithmetic Analysis.
• Joint Meeting of the AMS - NZMS 2007. Wellington, New Zealand, Dec 12-15 2007.
  On the back-and-forth types of Boolean Algebras.
• Computability, Complexity and Randomness. Nanjing, China, May 19-23 2008.
  Extensions of Embeddings in the degrees below the Turing Jump.
• Effective Mathematics of the Uncountable. New York, NY, Aug 18-22 2008.
  From Büchi to Borel Structures.
• AMS Eastern Section Meeting. Middletown, CT, October 11,12 of 2008.
  When Low information is no information.
  
• Computability, Reverse Mathematics and Combinatorics. Banff, Canada. Dec 7-12 2008.
  On the Strength Fraïssé's Conjecture.
• Conference  in Honor of Harvey Friedman 60th Birthday. Columbus, OH, May 2009.
  Theories of Hyperarithmetic Analysis - A survey.
• ASL Annual Meeting. South Bend, IN, May 2009.
  The Veblen Ordinal Functions for Computability Theorists.
• CiE. Heidelberg, Germany, July 2009.
  On the Jump of a Structure.
• Workshop in Computablity Theory, Sofia, Bulgaria, August 2009.
  On complete sets of Pi-n relations of a structure.
• Tutorial. Coloquio Matemático del Uruguay, Montevideo, Uruguay, December 2009.
  Matemática Computable
• Plenary talk. Mal'tsev Meeting, Novosibirsk, Russia, May 2-6 2010.
  Counting the back-and-forth relations.
• AMS fall Sectional meeting. Notre Dame, IN, November 2010.
  Non-hyperaithmetic is a spectrum.
  
• ASL annual meeting - Special session for L. Harrington. Berkeley, CA, March 2011.
  The boundary of determinacy in Second Order Arithmetic.
  
• Plenary talk. CiE, Sofia, Bulgaria, June 2011.
  The jump of a structure.
  
• Infinity Conference, Barcelona, July 2011.
  The boundary of determinacy in Second Order Arithmetic.
  
• Computational Prospects of Infinity II, Singapore, August 2011.
  The jump of a structure.
  
• Packard Foundation Meeting, Monterrey, CA. September 2011.
  Reverse mathematics.
  
• Tutorial. Oberwolfach seminar in Proof theory. Oberwolfach, Germany, October 2011.
  Ordinal Analysis and Computability Theory.
  
• Plenary Talk. 3er Coloquio Uruguayo de Matemática. Montevideo, Uruguay, December 2011.
  Matemática Reversa.
• Workshop in computability theory. Oberwolfach, Germany, February 2012.
  Properties of classes of structures.
• AMS Sectional Meeting, Washington, DC. March 2012.
  Theories of classes of structures.
  
• Plenary Talk. ASL Annual Meeting. Madison, WI, April 2012.
  The Complexity within well-quasi-orderings. 
• Plenary talk. Latin American Symposium on Mathematical Logic, Bogota, Colombia, June 2012.
  Determinacy in reverse mathematics.
  
• Plenary talk. The Incomputable. Cambridge, UK. June 2012.
  Definability in computable structure theory.
• Tutorial. Logic Colloquium, Manchester, UK, July 2012.
  Reverse mathematics.