1995 European Summer Meeting of the Association for Symbolic Logic

[1]  G. M. Kelly,et al.  Coherence in closed categories , 1971 .

[2]  Oleg V. Belegradek.  The Model Theory of Unitriangular Groups , 1994, Ann. Pure Appl. Log..

[3]  Drew McDermott,et al.  Nonmonotonic Logic II: Nonmonotonic Modal Theories , 1982, JACM.

[4]  Drew McDermott,et al.  Non-Monotonic Logic I , 1987, Artif. Intell..

[5]  Silvio Micali,et al.  The Knowledge Complexity of Interactive Proof Systems , 1989, SIAM J. Comput..

[6]  Stephen G. Simpson,et al.  The Baire category theorem in weak subsystems of second-order arithmetic , 1993, Journal of Symbolic Logic.

[7]  Bjarni Jónsson,et al.  Representation of modular lattices and of relation algebras , 1959 .

[8]  Ludomir Newelski,et al.  A proof of Saffe's conjecture , 1990 .

[9]  Valentina S. Harizanov.  Some Effects of Ash-Nerode and Other Decidability Conditions on Degree Spectra , 1991, Ann. Pure Appl. Log..

[10]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[11]  Richard Friedberg,et al.  A criterion for completeness of degrees of unsolvability , 1957, Journal of Symbolic Logic.

[12]  Gerhard Jäger,et al.  Systems of Explicit Mathematics with Non-Constructive µ-Operator, Part I , 1993, Ann. Pure Appl. Logic.

[13]  Michael Rathjen,et al.  Proof-theoretic analysis of KPM , 1991, Arch. Math. Log..

[14]  Miklós Ajtai,et al.  ∑11-Formulae on finite structures , 1983, Ann. Pure Appl. Log..

[15]  M. Scheepers,et al.  Remarks on sets related to trigonometric series , 1995 .

[16]  John Cartmell,et al.  Generalised algebraic theories and contextual categories , 1986, Ann. Pure Appl. Log..

[17]  Spaces not distinguishing pointwise and quasinormal convergence of real functions , 1991 .

[18]  Etienne Grandjean.  First-Order Spectra with One Variable , 1990, J. Comput. Syst. Sci..

[19]  Fernando Ferreira.  A note on a result of Buss concerning bounded theories and the collection scheme. , 1995 .

[20]  Manuel Blum,et al.  Noninteractive Zero-Knowledge , 1991, SIAM J. Comput..

[21]  Jack H. Lutz.  Almost Everywhere High Nonuniform Complexity , 1992, J. Comput. Syst. Sci..

[22]  Dov M. Gabbay,et al.  Extending the Curry-Howard interpretation to linear, relevant and other resource logics , 1992, Journal of Symbolic Logic.

[23]  S. G. Simpson,et al.  Which set existence axioms are needed to prove the separable Hahn-Banach theorem? , 1986, Ann. Pure Appl. Log..

[24]  S. Feferman.  A Language and Axioms for Explicit Mathematics , 1975 .

[25]  Alberto Policriti,et al.  Decidability of ∃*∀-Sentences in Membership Theories , 1996, Math. Log. Q..

[26]  Gerhard Jäger,et al.  Second order theories with ordinals and elementary comprehension , 1995, Arch. Math. Log..

[27]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .

[28]  G. Beer.  METRIC SPACES ON WHICH CONTINUOUS FUNCTIONS ARE UNIFORMLY CONTINUOUS AND HAUSDORFF DISTANCE , 1985 .

[29]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[30]  John T. Baldwin,et al.  First-order theories of abstract dependence relations , 1984, Ann. Pure Appl. Log..

[31]  Jean-Yves Girard,et al.  Linear Logic , 1987, Theor. Comput. Sci..

[32]  Samuel R. Buss.  A conservation result concerning bounded theories and the collection axiom , 1987 .

[33]  Hendrik Pieter Barendregt,et al.  Systems of illative combinatory logic complete for first-order propositional and predicate calculus , 1993, Journal of Symbolic Logic.

[34]  H. Gaifman.  Concerning measures in first order calculi , 1964 .

[35]  Christopher J. Ash,et al.  Recursive Structures and Ershov's Hierarchy , 1996, Math. Log. Q..

[36]  Ronald Fagin,et al.  On Monadic NP vs. Monadic co-NP , 1995, Inf. Comput..

[37]  Ludomir Newelski.  ℳ-rank and meager groups , 1996, Fundamenta Mathematicae.

[38]  Andrea Cantini,et al.  Asymmetric Interpretations for Bounded Theories , 1996, Math. Log. Q..

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

[40]  Vladimir V. Rybakov,et al.  Rules of inference with parameters for intuitionistic logic , 1992, Journal of Symbolic Logic.

[41]  Joseph R. Shoenfield,et al.  Degrees of unsolvability , 1959, North-Holland mathematics studies.

[42]  Gerhard Jäger.  Fixed Points in Peano Arithmetic with Ordinals , 1993, Ann. Pure Appl. Log..

[43]  Valentina S. Harizanov,et al.  Frequency Computations and the Cardinality Theorem , 1992, J. Symb. Log..

[44]  Heinrich Herre,et al.  Generalized Compactness of Nonmonotonic Inference Operations , 1995, J. Appl. Non Class. Logics.

[45]  Markus Marzetta.  Universes in the Theory of Types and Names , 1992, CSL.

[46]  James Ax,et al.  The Elementary Theory of Finite Fields , 1968 .

[47]  Dimiter Vakarelov,et al.  Modal Logics for Knowledge Representation Systems , 1989, Theor. Comput. Sci..

[48]  E. Barker.  Intrinsically gs;0alpha; relations , 1988, Ann. Pure Appl. Log..

[49]  James H. Schmerl,et al.  Binary Relational Structures Having Only Countably Many Nonisomorphic Substructures , 1991, J. Symb. Log..

[50]  R. Gurevic.  Equational Theory of Positive Numbers with Exponentiation is Not Finitely Axiomatizable , 1990, Ann. Pure Appl. Log..

[51]  Marek Karpinski,et al.  Randomness, Provability, and the Seperation of Monte Carlo Time and Space , 1987, Computation Theory and Logic.

[52]  Zdzislaw Pawlak,et al.  Information systems theoretical foundations , 1981, Inf. Syst..

[53]  Peter Freyd.  Properties Invariant within Equivalence Types of Categories , 1976 .

[54]  Ludomir Newelski.  ℳ-rank and meager types , 1995 .

[55]  Ewa Orlowska,et al.  Representation of Nondeterministic Information , 1984, Theor. Comput. Sci..

[56]  Raymond Reiter,et al.  A Logic for Default Reasoning , 1987, Artif. Intell..

[57]  Steven Garavaglia.  Model theory of topological structures , 1978 .

[58]  M. Atsuji.  Uniform continuity of continuous functions of metric spaces. , 1958 .

[59]  Robert C. Moore.  Semantical Considerations on Nonmonotonic Logic , 1985, IJCAI.

[60]  Ronald Fagin,et al.  Reachability is harder for directed than for undirected finite graphs , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[61]  Ludomir Newelski.  A Model and Its Subset , 1992, J. Symb. Log..

[62]  A. Macintyre,et al.  Definable sets over finite fields. , 1992 .

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

[64]  Mihaly Makkai,et al.  Avoiding the axiom of choice in general category theory , 1996 .

[65]  G.D. Plotkin,et al.  LCF Considered as a Programming Language , 1977, Theor. Comput. Sci..

[66]  Jorge Almeida.  On pseudovarieties, varieties of languages, filters of congruences, pseudoidentities and related topics , 1990 .