1999 European Summer Meeting of the Association for Symbolic Logic

[1]  Michael Rathjen,et al.  The strength of some Martin-Löf type theories , 1994, Arch. Math. Log..

[2]  R. Downey,et al.  T-degrees, jump classes, and strong reducibilities , 1987 .

[3]  Yuichi Komori.  Predicate logics without the structure rules , 1986, Stud Logica.

[4]  R. Solovay.  Provability interpretations of modal logic , 1976 .

[5]  Charles Sayward.  Prior's theory of truth , 1987 .

[6]  Alasdair Urquhart.  Implicational Formulas in Intuitionistic Logic , 1974, J. Symb. Log..

[7]  George Boolos,et al.  To Be Is to Be a Value of a Variable (or to Be Some Values of Some Variables) , 1984 .

[8]  Anand Pillay,et al.  On groups and fields definable in o-minimal structures , 1988 .

[9]  Frank Stephan,et al.  Recursion Theoretic Properties of Frequency Computation and Bounded Queries , 1995, Inf. Comput..

[10]  André Nies,et al.  The Theory of the Recursively Enumerable Weak Truth-Table Degrees Is Undecidability , 1992, J. Symb. Log..

[11]  Nick Benton,et al.  Computational types from a logical perspective , 1998, Journal of Functional Programming.

[12]  Sabine Gornemann,et al.  A Logic Stronger Than Intuitionism , 1971, J. Symb. Log..

[13]  Victor L. Selivanov,et al.  Fine hierarchies and Boolean terms , 1995, Journal of Symbolic Logic.

[14]  Predicate superintuitionistic logics without interpolation , 1996 .

[15]  Wolfgang Thomas,et al.  Classifying Regular Events in Symbolic Logic , 1982, J. Comput. Syst. Sci..

[16]  Ehud Hrushovski,et al.  Unimodular Minimal Structures , 1992 .

[17]  Samuel R. Buss,et al.  Intuitionistic Validity in T-Normal Kripke Structures , 1993, Ann. Pure Appl. Log..

[18]  Andreas Blass.  The Rudin-Keisler ordering of $P$-points , 1973 .

[19]  Maria Grazia Scutellà,et al.  Polynomially Solvable Satisfiability Problems , 1988, Inf. Process. Lett..

[20]  Krzysztof Mazur,et al.  $F_σ$-ideals and $ω_1 ω^*_1$-gaps in the Boolean algebras Ρ(ω)/I. , 1991 .

[21]  Martin Odersky,et al.  Defining context-dependent syntax without using contexts , 1993, TOPL.

[22]  R. Jensen,et al.  The fine structure of the constructible hierarchy , 1972 .

[23]  Kai Frederick Wehmeier.  Classical and Intuitionistic Models of Arithmetic , 1996, Notre Dame J. Formal Log..

[24]  C. Jockusch.  Semirecursive sets and positive reducibility , 1968 .

[25]  Dieter Klemke.  Ein Henkin-Beweis für die Vollständigkeit eines Kalküls relativ zur Grzegorczyk-Semantik , 1971 .

[26]  Gerhard Jäger,et al.  A well-ordering proof for Feferman's theoryT0 , 1983, Arch. Math. Log..