Logic Seminars

1996-97

Tuesday, September 3
Max Kanovich,Moscow and University of Pennsylvania
Resource automata


Thursday, September 5
Max Kanovich, Moscow and University of Pennsylvania
Resource automata, part 2

Thursday, September 12
Miklos Erdelyi-Szabo
Cornell University
Decidability in the intuitionisitic/constructive theory of the reals

Thursday, September 19
Miklos Erdelyi-Szabo, Cornell University
Decidability and the constructive/intuitionisitic theory of the real line II

Thursday, September 26
Denis Hirschfeldt, Cornell University
The density of branching degrees

Thursday, October 3
Denis Hirschfeldt, Cornell University
The density of branching degrees II

Thursday, October 10
Reed Solomon, Cornell University
The reverse mathematics of ordered groups

Thursday, October 17
Manuel Lerman, University of Connecticut
Embedding ranked partial lattices in the computability enumerable degrees

Thursday, October 24
Nat Miller, Cornell University
The role of diagrams in proofs

Thursday, October 31
Nat Miller, Cornell University
The role of diagrams in proofs II

Thursday, November 7
Walker White, Cornell University
The decision problem for two variable first order logic

Thursday, November 14
Dexter Kozen, Cornell University
Kleene algebra with tests and commutativity conditions

Thursday, November 21
Denis Hirschfeldt, Cornell University
Second order logic and Fagin's theorem for NP

Thursday, January 23
Sergei Artemov, Cornell University
On modal counterparts of intuitionistic logic

Tuesday, January 28
Suman Ganguli, Cornell University
Introduction to basic proof theory

Tuesday, February 4
Nathaniel Miller, Cornell University
Natural deduction versus Hilbert style systems

Thursday, February 6
Jennifer Davoren, Cornell University
On topological semantics of intuitionistic logic

Thursday, February 20
Jason Hickey, Cornell University
Nuprl: a system for formal mathematics, II

Tuesday, February 25
Reed Solomon, Cornell University
Cut elimination with applications

Thursday, February 27
Harold Hodes, Cornell University
An abstract view of constructive rules for a sentential connective:
inversion and complementation

Tuesday, March 4
Reed Solomon, Cornell University
Cut elimination with applications

Thursday, March 6
Howard Blair, Syracuse University
Remarks on logic programs and cellular automata

Tuesday, March 11
Walker White, Cornell University
Interpolation theorem in first order logic

Thursday, March 13
Reed Solomon, Cornell University
Reverse mathematics and ordered groups

Thursday, March 13
Denis Hirschfeldt, Cornell University
Undecidability and 1-types in any interval of the computably enumerable degrees

Tuesday, April 1
Todd Wilson, Cornell University
Normalization for natural deduction

Thursday, April 3
Miklos Erdelyi-Szabo, Cornell University
Topological completeness of the first order intuitionistic logic

Tuesday, April 8
Todd Wilson, Cornell University
Normalization for natural deduction II

Thursday, April 10
Victor Marek, University of Kentucky
Logic programming with costs

Tuesday, April 15
Robert Milnikel, Cornell University
Linear logic

Thursday, April 17
Sergei Artemov, Cornell University
Proof realizations of intuitionistic logic

Thursday, April 24
Robert Milnikel, Cornell University
Linear logic (conclusion)

Thursday, April 24
Denis Hirschfeldt, Cornell University
Proof theory of arithmetic

Tuesday, April 29,
Denis Hirschfeldt, Cornell University
Proof theory of arithmetic (conclusion)

Thursday, May 1
Andre Scedrov, University of Pennsylvania
Proof games, optimization and complexity