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