Logic Colloquium’ 96: Proceedings of the Colloquium held in San Sebastián, Spain, July 9–15, 1996

This Volume Contains Eleven Contributions By Invited Speakers At The Annual Logic Colloquium Which Was Held In San Sebastian, Spain, In July 1996. They Cover Model Theory, Proof Theory, Recursion And Complexity Theory, Logic For Artificial Intelligence And Formal Semantics Of Natural Languages, And Include Both Recent Results And Survey Articles On The Central Topics In Logic Written By Specialists For A Wide Audience. From The Contents: Preface -- N. Asher: The Logical Foundations Of Discourse Interpretation -- H. Buhrman, L. Torenvliet: Complete Sets And Structure In Subrecursive Classes -- D. Evans, D. Gray: Kernels And Cohomology Groups For Some Finite Covers -- V. Kanovei: On Star Schemata Of Kossak And Paris -- U. Kohlenbach: Arithmetizing Proofs In Analysis -- R. Kossak: Satisfaction Classes And Autormorphisms Of Models Of Pa -- M. Pentus: Free Monoid Completeness Of The Lambeck Calculus Allowing Empty Premises -- (for Complete Contents, See Contents Internet). J.m. Larrazabal, D. Lascar, G. Mints, Eds. Includes Bibliographical References. Content: Front Matter....Pages i-vii The Logical Foundations of Discourse Interpretation....Pages 1-44 Complete Sets and Structure in Subrecursive Classes....Pages 45-77 Kernels and cohomology groups for some finite covers....Pages 79-99 On “star” schemata of Kossak and Paris....Pages 101-114 Arithmetizing proofs in analysis....Pages 115-158 Satisfaction classes and automorphisms of models of PA....Pages 159-169 Free monoid completeness of the Lambek calculus allowing empty premises....Pages 171-209 Simple groups definable in O-minimal structures....Pages 211-218 Two-Dimensional Temporal Logic....Pages 219-236 Rather Classless, Highly Saturated Models of Peano Arithmetic....Pages 237-246 Incompleteness theorems and $ S_2^i $ versus $ S_2^{i + 1} $ ....Pages 247-261 This text contains 11 contributions by invited speakers at the annual Logic Colloquium which was held in San Sebastian, in July 1996. They cover model theory, proof theory, recursion and complexity theory, logic for artificial intelligence and formal semantics of natural artificial languages.