| |
Talks
Title:
Definability in the enumeration degrees.
Status:
Talk given at the Research Seminar at the Kurt Gödel Research Center for Mathematical Logic, May 2011.
Title:
Definability in the local structures of the enumeration degrees.
Status:
Talk given at the Logic Seminar at the University of Chicago, March 2011.
Formats: 
Title:
Definability in the local structures of the enumeration degrees and the omega-enumeration degrees.
Status:
Talk given at the Logic Seminar at the University of Notre Dame, March 2011.
Formats: 
Title:
Definability in the local structures of the enumeration degrees and the omega-enumeration degrees.
Status:
Talk given at: Logic Seminar at Cornell University, March 2011.
Formats: 
Title:
Definability in the local structures of the enumeration degrees and the omega-enumeration degrees.
Status:
Talk given at the Computability Seminar at the University of Leeds, December 2010.
Formats: 
Title:
Local definability of K-pairs in the enumeration degrees.
Status:
Plenary session talk given at Second Session of the Workshop in Computability Theory 2011, , University of Chicago Center in Paris, July 23-24.
Formats: 
Title:
Definability and Interpretability in the Sigma-0-2 enumeration degrees.
Status:
Plenary session talk given at Mal'tsev Meeting, , Novosibirsk, May 2-6, 2010.
Formats: 
Title:
Charectarizing the Strength of the Local Theory of the Enumeration Degrees.
Status:
Special session talk given at The 14th SouthEastern Logic Symposium, Gainesville, February 2010.
Formats: 
Title:
A Locally Definable Set of Low Enumeration
Degrees. Work in Progress.
Status:
Talk given at Dipartimento di Scienze Matematiche ed Informatiche "Roberto Magari", Siena, September 2009.
Formats: 
Title:
Embedding Partial Orderings in Degree Structures (Short version)
Status:
Contributed talk given at the conference Computability in Europe 2009, Heidelberg, July 2009.
Formats: 
Title:
Embedding Partial Orderings in Degree Structures
Status:
Talk given at the Computability Seminar at the University of Leeds, May 2009.
Formats: 
Title:
The Local Structure of the Enumeration degrees
Status:
Talk given at the Proof Theory Seminar, Department of Mathematics, Ludwig Maximilians Universitaet, Munich, July 2008.
Formats: 
Title:
The Limitations of Cupping in the Local Structure of the Enumeration Degrees
Status:
Contributed talk given at the conference Computability in Europe 2008, Athens, June 2008.
Formats: 
Title:
Cupping Classes of &Sigma20 Enumeration Degrees
Status:
Talk given at Dipartimento di Scienze Matematiche ed Informatiche "Roberto Magari", Siena, Feb 2008.
Formats: 
Title:
Enumeration Degrees
Status:
Talk given at MATHLOGAPS Third Training Workshop, Aussois, June 2007.
Formats: 
Title:
A Non-splitting Theorem in the Enumeration Degrees
Status:
Contributed talk given at the conference Computability in Europe 2007, Siena, June 2007.
Formats: 
Title:
Cupping &Delta2 Enumeration Degrees to 0'
Status:
Contributed talk given at the conference Computability in Europe 2007, Siena, June 2007.
Formats: 
Title:
The Strongest Nonsplitting Theorem
Status:
Talk given at the 4th International Conference, TAMC 2007, Shanghai, China, May 2007.
Formats: 
Title:
A Gentle Approach to Harrington Non-splitting and Beyond
Status:
Talk given at the Logic Seminar at the University of Leeds, February 2007.
Formats: 
Title:
An Introduction to a New Characterization of the Low-n Degrees
Status:
Talk given at the Computability Seminar at the University of Leeds, Novemeber 2006.
Formats: Part 1 , Part 2 
Title:
A Generalization of Harrington's Nonsplitting Theorem
Status:
Talk given at MATHLOGAPS Second Training Workshop, Leeds August 2006.
Formats: 
Title:
Genericity and Nonbounding
Status:
Contributed talk given at the conference Computability in Europe 2006, Swansea, June 2006.
Formats: 
Title:
Introduction to Harrington's Nonsplitting Theorem
Status:
Talk given at the Computablity Seminar, University of Leeds, May 2006.
Formats: Part 1 , Part 2 
Title:
A Generic Set that Does Not Bound a Minimal Pair in the Enumeration Degrees
Status:
Contributed talk given at the Third Annual Conference on Computation and Logic, TAMC06, Beijing, May 2006.
Formats: 
|
|