September 4, 1997
Reed Solomon, Cornell University
Computable presentations of structures of low degree
September 9, 1997
Robert Milnikel, Cornell University
Omitting types and decidability
September 11, 1997
Joe Miller, Cornell University
Avoidable algebraic sets in Euclidean space
September 16, 1997
Robert Milnikel, Cornell University
Omitting types and decidability II
September 18, 1997
Joe Miller, Cornell University
Avoidable algebraic sets in Euclidean space II
September 23, 1997
Robert Milnikel, Cornell University
Omitting types and decidability
September 25, 1997
Denis Hirschfeldt
, Cornell University
The Baldwin-Lachlan theorem
September 30, 1997
Robert Milnikel
, Cornell University
Omitting types and decidability II
October 5, 1997
Denis Hirschfeldt, Cornell University
The Baldwin-Lachlan theorem II
October 7, 1997
Richard Shore, Cornell University
Decidable prime models
October 16, 1997
Bakhadyr Khoussainov, Cornell University
Randomness, computability and finitely presented algebras
October 21, 1997
Richard Shore, Cornell University
Decidable prime models (cont.)
October 28, 1997
Walker White, Cornell University
Homogeneity and computability
October 30, 1997
Walker White
, Cornell University
Homogeneity and computability, II
November 4, 1997
Reed Solomon, Cornell University
Saturation and computability
November 6, 1997
Andrea Sorbi, University of Siena (Italy)
The problem of embedding finite lattices into the $\Sigma^0_2$ e-degrees
November 11, 1997
Bakhadyr Khoussainov, Cornell University
Effective intuitionistic model theory
November 13, 1997
Bakhadyr Khoussainov, Cornell University
Effective intuitionistic model theory, II
November 18, 1997
Joseph Halpern, Cornell University
Degrees of belief, random worlds, and maximum entropy
November 20, 1997
Geofrey LaForte, Wellington, New Zealand
A Delta_2 set which is barely Sigma_2
November 25, 1997
Joseph Halpern, Cornell University
Plausibility measures and default reasoning
December 2, 1997
Vivian Morley, Cornell University
Finitely axiomatizable theories
December 4, 1997
Vivian Morley, Cornell University
Finitely axiomatizable theories II
January 22, 1998
Sergei Artemov, Cornell University
and Steklov Institute
Logic of proofs vs. typed lambda calculi
January 27, 1998
Richard Shore, Cornell University
Computable categoricity and degree spectra
January 29, 1998
Sergei Artemov, Cornell University and Steklov Institute
Logic of proofs vs. typed Lambda calculi II
February 3, 1998
Walker White, Cornell University
Computable categoricity and Scott families
February 5, 1998
Miklos Erdelyi-Szabo, Cornell University
Randomized Kripke schema and undecidability in the intuitionistic reals
February 10, 1998
Denis Hirschfeldt, Cornell University
Persistence of computable categoricity
February 12, 1998
Dexter Kozen, Cornell University
Hopkins' proof of Parikh's theorem
February 17, 1998
Robert Milnikel, Cornell University
Intrinsic and formally computable relations
February 18, 1998
William Calhoun, Bloomsburg University
The Pi^{0}_{2} enumeration degrees are not dense
February 24, 1998
Vivian Morley, Cornell University
Turing machine computations and finitely axiomatizable theories
February 26, 1998
Denis Hirschfeldt, Cornell University
A basis theorem for perfect sets
March 3, 1998
Vivian Morley, Cornell University
Turing machine computations and finitely axiomatizable theories II
March 5, 1998
Reed Solomon, Cornell University
On degrees of models of arithmetic
March 10, 1998
Jeniffer Seitzer, College of Mt. St. Joseph
Knowledge representation using normal logic programs
March 24, 1998
Suman Ganguli, Cornell University
Relatively intrinsically recursive relations
March 26, 1998
Sergei Artemov, Cornell University
and Moscow
Proof polynomials vs. lambda terms
March 31, 1998
Walker White, Cornell University
Metatheorems for priority arguments
April 2, 1998
Suman Ganguli, Cornell University
Degrees of models of arithmetic
April 7, 1998
Walker White, Cornell University
Metatheorems for priority arguments
April 9, 1998
Suman Ganguli, Cornell University
Degrees of models of arithmetic
April 14, 1998
Walker White, Cornell University
Metatheorems for priority arguments II
April 16, 1998
Joe Miller, Cornell University
The Krohn-Rhodes decomposition theorem for automata
April 23, 1998
Richard Shore, Cornell University
Degree spectra
April 23, 1998
Valentina Harizanov, George Washington University
Computability-theoretic properties of relations on computable models
April 28, 1998
J.M. Davoren, Cornell University
On continuous dynamics and modal logics
April 30, 1998
Julia Knight, Notre Dame University
Ash's program in computable structure theory