Logic Seminar (MATH 781-782)

Logic Seminar (MATH 781-782)

List of Talks given in 1996-97

Thu., August 29   Robert Milnikel, Cornell University
Finite automata and finite model theory
Tue., September 3   Max Kanovich, Moscow and University of Pennsylvania
Resource automata
Thu., September 5   Max Kanovich, Moscow and University of Pennsylvania
Resource automata, part 2
Tue., September 10   Robert Milnikel, Cornell University
Finite automata and finite model theory II
Thu., September 12   Miklos Erdelyi-Szabo, Cornell University
Decidability in the intuitionisitic/constructive theory of the reals
Tue., September 17   Reed Solomon, Cornell University
The finite model property
Thu., September 19   Miklos Erdelyi-Szabo, Cornell University
Decidability and the constructive/intuitionisitic theory of the real line II
Tue., September 24   Vivian Morley, Cornell visitor
Inductive definitions
Thu., September 26   Denis Hirschfeldt, Cornell University
The density of branching degrees
Tue., October 1   Vivian Morley, Cornell visitor
Inductive definitions II
Thu., October 3   Denis Hirschfeldt, Cornell University
The density of branching degrees II
Tue., October 8   Vivian Morley, Cornell visitor
Inductive definitions III
Thu., October 10   Reed Solomon, Cornell University
The reverse mathematics of ordered groups
Thu., October 17   Manuel Lerman, University of Connecticut
Embedding ranked partial lattices in the computability enumerable degrees
Tue., October 22   Joe Miller, Cornell University
Inductive definability
Thu., October 24   Nat Miller, Cornell University
The role of diagrams in proofs
Tue., October 29   Joe Miller, Cornell University
Inductive definability: partial fixed points
Thu., October 31   Nat Miller, Cornell University
The role of diagrams in proofs II
Tue., November 5   Robert Milnikel, Cornell University
Complexity classes: a quick review
Thu., November 7   Walker White, Cornell University
The decision problem for two variable first order logic
Tue., November 12   Suman Ganguli, Cornell University
First order reductions
Thu., November 14   Dexter Kozen, Cornell University
Kleene algebra with tests and commutativity conditions
Tue., November 19   Reed Solomon, Cornell University
Complexity of least fixed point logic
Thu., November 21   Denis Hirschfeldt, Cornell University
Second order logic and Fagin's theorem for NP
Tue., November 26   Reed Solomon, Cornell University
Complexity of partial fixed point logic
Tue., December 3   Joe Miller, Cornell University
Transitive closure operators
Thu., January 23   Sergei Artemov, Cornell University
On modal counterparts of intuitionistic logic
Tue., January 28   Suman Ganguli, Cornell University
Introduction to basic proof theory
Tue., February 4   Nathaniel Miller, Cornell University
Natural deduction versus Hilbert style systems
Thu., February 6   Jennifer Davoren, Cornell University
On topological semantics of intuitionistic logic
Thu., February 20   Jason Hickey, Cornell University
Nuprl: a system for formal mathematics, II
Tue., February 25   Reed Solomon, Cornell University
Cut elimination with applications
Thu., February 27   Harold Hodes, Cornell University
An abstract view of constructive rules for a sentential connective: inversion and complementation
Tue., March 4   Reed Solomon, Cornell University
Cut elimination with applications
Thu., March 6   Howard Blair, Syracuse University
Remarks on logic programs and cellular automata
Tue., March 11   Walker White, Cornell University
Interpolation theorem in first order logic
Thu., March 13   Reed Solomon, Cornell University
Reverse mathematics and ordered groups
Thu., March 13   Denis Hirschfeldt, Cornell University
Undecidability and 1-types in any interval of the computably enumerable degrees
Tue., April 1   Todd Wilson, Cornell University
Normalization for natural deduction
Thu., April 3   Miklos Erdelyi-Szabo, Cornell University
Topological completeness of the first order intuitionistic logic
Tue., April 8   Todd Wilson, Cornell University
Normalization for natural deduction II
Thu., April 10   Victor Marek, University of Kentucky
Logic programming with costs
Tue., April 15   Robert Milnikel, Cornell University
Linear logic
Thu., April 17   Sergei Artemov, Cornell University
Proof realizations of intuitionistic logic
Thu., April 24   Robert Milnikel, Cornell University
Linear logic (conclusion)
Thu., April 24   Denis Hirschfeldt, Cornell University
Proof theory of arithmetic
Tue., April 29   Denis Hirschfeldt, Cornell University
Proof theory of arithmetic (conclusion)
Thu., May 1   Andre Scedrov, University of Pennsylvania
Proof games, optimization and complexity