LOGIC COLLOQUIUM 1997
Contributed Papers
Papers accepted for presentation in person:
- Yoshihiro Abe (Yokohama):
'Distributivity and \Pi^1_1-indescribability in
P_\kappa \lambda' (Set Theory Section)
- Gabriel Aguilera, Inma P. de Guzman, Manuel Ojeda-Aciego (Malaga):
'DP-Distributions: A New Efficiency Strategy for the TAS
Reduction Method' (Theoretical Computer Science)
- Kiwamu Aoyama and Kenji Fukuzaki (Kagoshima, Japan):
'Direct Proof of the Equivalence of the
Induction Scheme and the Least Number
Principle for Open Formulas' (Model Theory)
- M.M. Arslanov and I.Sh. Kalimullin (Kazan State University):
'Weak Presentation of Partial Orderings'
(Computability Theory)
- Serikhzan A. Badaev (Almaty):
'Effectively Minimal Enumerations'
(Computability Theory)
- Arnold Beckmann (Münster):
'How to Separate Fragments of Bounded Arithmetic
by Methods from Ordinal Analysis' (Proof Theory)
- Anatoly P. Beltiukov (University of Udmurtia, Russia):
'Hierarchy of Small Subrecursive
Operator Classes Based on Bounded Recursion' (Computability Theory)
- Elias Tahhan Bittar (Clermont-Ferrand):
'Strong Normalization Proofs for Cut
Elimination in Gentzen's Sequent Calculi'
(Proof Theory)
- Aleksander Blaszczyk (Silesian University):
'Regular Subalgebras of Complete Boolean Algebras'
- Dumitru Busneag (Craiova):
'Valuations on Hilbert Algebras'
- Domenico Cantone and Pietro Ursino (University of Catania):
'A Unifying Approach to Computable
Set Theory' (Theoretical Computer Science)
- Enrique Casanovas (Barcelona):
'A Test for Expandability'
(Model Theory)
- F. Collot (Paris):
'It Exists No Cardinal Between the Countable and the Continuum'
(Set Theory)
- Thierry Coquand, Erik Palmgren (Chalmers University of
Technology and University of Göteborg):
'Intuitionistic Choice and Classical Logic'
(Proof Theory)
- Michel De Glas (CNRS-EHESS-Paris Sorbonne):
'Subintuitionistic Logic and Locology' (Proof Theory)
- Antonino Drago (Napoli):
'Vasiliev's Paraconsistent Logic Interpreted by Means of
the Dual Role Played by the Double Negation Law'
(Philosophy)
- Antonino Drago (Napoli):
'The Relevance of Weyl's Elementary Mathematics for
Scientific Theories' (Philosophy)
- M. Droste (Dresden), J.K. Truss (Leeds),
and R. Warren (Leeds):
'Simple Automorphism Groups of Cycle-free Partial Orders'
(Model Theory)
- Birgit Elbl (Munich):
'Cut Elimination for a Calculus with
Context-Dependent Rules' (Proof Theory)
- Ali Enayat:
'Conservative Elementary Extensions of Models of Set Theory'
(Set Theory)
- Don Faust (Northern Michigan University):
'Evidence Logic'
(Philosophy)
- S. Ghilardi (Milano) and M. Zawadowski (Warswawa):
'Grothendieck Topologies on Finite Algebras'
- Evan Griffiths (Madison, Wisconsin):
'Completely Mitotic Degrees and Jump Classes'
(Computability Theory)
- Joanna Grygiel (Czestochowa, Poland):
'Constructability of free sets of generators of filters
in boolean algebras'
- Petr Hájek (Prague):
'Strong Completeness of Gödel Logic' (Proof Theory)
- Valentina Harizanov (Washington DC):
'Intrinsically \Delta_2^0 Relations in
Computable Structures'
- Sachio Hirokawa (Kyushu University),
Yuichi Komori (Chiba University), Misao Nagayama
(Woman's Christian
University, Japan):
'A Simple Proof of
P-W Problem' (Proof Theory)
- A. Ivanov (Wroclaw, Poland):
'Strongly Minimal Theories of Bounded Valency and Finite
Axiomatisability' (Model Theory)
- Reinhard Kahle (University of Bern):
'Uniform Limit in Explicit Mathematics with Universes'
(Proof Theory)
- Vladimir Kanovei (Moscow):
'Two Trichotomy Theorems on Colourability of
Non-Analytic Graphs' (Set Theory)
- Adam Kolany (University of Silesia, Katowice, Poland):
'Hypergraphs in Logic-Current State of the Theory'
- Lars Kristiansen (Oslo):
'Information Content and Computational Complexity of
Recursive Sets' (Computability Theory)
- Oliver Kullmann (Frankfurt):
'Some New Tools for SAT Decision' (Theoretical
Computer Science)
- Jean Larson (University of Florida):
'A Partition from a Scale' (Set Theory)
- Jeffrey S. Leaning (Gainesville, USA):
'Models with One Measurable Cardinal and Many Measures'
(Set Theory)
- Jui-Lin Lee (Academy of Sciences of the Czech Republic):
'Branching Program, Commutator, and Icosahedron'
(Theoretical Computer Science)
- Remi Legrand (LITP - Universite de Paris 6):
'Needed Horn Clause Logic' (Theoretical Computer Science)
- Kerkko Luosto (Helsinki):
'Resumptions of Cardinality Quantifiers'
- Alberto Marcone (Torino):
'Descriptive Set Theory and Ordinary Differential Equations'
(Set Theory)
- Benoit Mariou (Paris VII):
'Saturated Models and Ehrenfeucht-Mostowski Models'
(Model Theory)
- Carmi Merimovich (Tel Aviv):
'Adding Many Radin Sequences At Once' (Set Theory)
- Heike Mildenberger (Bonn, Germany):
'Changing Cardinal Invariants' (Set Theory)
- David Miller (Warwick):
'Probabilistic Substitutivity at a Reduced Price'
(Philosophy)
- J.L. Montana (Universidad Publica de Navarra, Pamplona)
and L.M. Pardo (Universidad de Cantabria, Santander):
'A Note on the Foundations of Kolmogorov
Complexity over the Real Numbers'
(Theoretical Computer Science)
- Angelo Montanari, Adriano Peron, Alberto Policriti (Udine, Italy):
'Exploiting Systolic
and Rabin Tree Automata to Decide Time Granularity'
(Theoretical Computer Science)
- Sara Negri (University of Helsinki):
'Proof Theory of Intuitionistic Apartness and Order
Relations'
- Andre Nies (Chicago) and Andrea Sorbi (Sienna):
'Branching in the Enumeration Degrees of the \Sigma_2^0 Sets'
(Computability Theory)
- Karl-Heinz Niggl (Munich):
'The \mu-Measure as a Tool for Classifying
Computational Complexity' (Theoretical Computer
Science)
- Woosuk Park (Taejon, S. Korea):
'On the Logical Status of the Axiom of Infinity'
(Philosophy)
- Andreja Prijatelj (University of Ljubljana):
'Constructions of Free Algebras Corresponding to
Classical Linear Logic Fragments and their Cardinality'
(Model Theory)
- Vera Puninskaya (Moscow Institute-Internate):
'Vaught's Conjecture for Modules Over a Serial Ring'
(Model Theory)
- Reinert A. Rinvold (Hedmark College, Elverum, Norway):
'Categories of Sets with Structure' (Proof Theory)
- Eric Rosen (Aachen, Germany):
'On the First-Order Quantifier Prefix Hierarchy'
(Model Theory)
- Matthew Salts (Leeds):
'On Computably Enumerable Predecessors
for d.c.e. Degrees' (Computability Theory)
- Ralf Schindler (UC Berkeley):
'On patterns of cardinals with the tree property' (Set Theory)
- Rene Schipperus (Calgary):
'Countable Partition Ordinals' (Set Theory)
- Vladimir St. Soskov (Sofia University):
'A Characterization of the Next Admissible Set
via Enumerations' (Computability Theory)
- K. Tanaka and T. Yamazaki (Tohoku University, Japan):
'A Non-Standard Construction of Haar Measure
and WKL_0' (Proof Theory)
- Cedric Thienot (Paris):
'A Logic Without Modus Ponens' (Proof Theory)
- Sergei Tupailo (Stanford):
'Epsilon-Substitution Method for \Sigma_1^1-Axiom of Choice'
(Proof Theory)
- Wim Veldman (Catholic University, Nijmegen,
The Netherlands):
'An Intuitionistic Proof of Hindman's Theorem'
- Jan von Plato (University of Helsinki):
'Algebraic Semantics of Refutation for Intuitionistic
Logic'
- George Voutsadakis (Iowa State University):
'Algebraizing Institutions: An Approach to Categorical
Abstract Algebraic Logic'
- Geir Waagbo (Oslo):
'Effective Operations and Continuous Functionals of
Transfinite Type' (Computability Theory)
- Kevin Wald (University of Chicago):
'Two Results Concerning Exact Pairs'
(Computability Theory)
- Piotr Wojtylak (Katowice, Poland):
'Generalizing Theorems with Reflection Principle'
(Proof Theory)
- Alexander D. Yashin (Udmurt State University):
'A Modified Neighbourhood Semantics for Strong Future Tense Operator
in Intuitionistic Propositional Logic'
- Stuart Zoble (Berlin):
'A Lower Bound for the Consistency Strength
of a Chang Conjecture'
(Set Theory)
Papers accepted for presentation by title:
- S. Aliyari and M.M. Arslanov (Kazan State University):
'Weak Presentations of Partial Orderings'
(Computability Theory)
- Mohammad Ardeshir (Tehran, Iran):
'Robinson's Consistency Theorem in Basic Predicate Logic'
- Olga N. Bushmakina (Udmurt State University, Russia):
'Idea of Negative Ontology'
(Philosophy)
- Alexander Denisov (Yakutsk University, Russia):
'On Symbolism of Double Structural Diagrams'
(Computability Theory)
- Farzad Didehvar (IPM, Tehran, Iran):
'On the Information Content of Integers
with respect to a Given Acceptable Enumeration of r.e. Sets'
(Computability Theory)
- Jim Henle:
'Non-nonstandard Analysis: Real Infinitesimals'
- Shamil Ishmukhametov (Ulyanovsk University):
'On Enumerability of d.r.e Degrees in Lesser Ones'
(Computability Theory)
- Gunwon Lee (Seoul National University):
'On the Fallacy of Compositions' (Philosophy)
- Olivier Lessmann (Carnegie-Mellon):
'Abstract Decomposition and Applications'
(Model Theory)
- Paolo Mancosu (U.C. Berkeley):
'Explanatory Proofs: An Exposition and Criticism of the
Classical Theory'
(Philosophy and Psychology of Proof)
- Mojtaba Moniri (Tehran):
'Intuitionistic Open Induction, Ultimate Parity,
and Double Negation Shift'
- Cyrus F. Nourani (Project METAA1):
'Functorial Models, Admissible Sets and
Generic Rudimentary Fragments'
- D. E. Pal'chunov (Novosibirsk, Russia):
'Homogeneous Boolean Algebras with Distinguished Ideals'
- V. Rybakov (Krasnoyarsk):
'Quasi-characteristic Inference Rules for Modal Logic S4'
- Irina A. Semakina (Udmurt State University, Russia):
'Being of a Sense in a Point' (Philosophy)
- Dasharath Singh (Bombay):
'Some Reflections on Word Problem Using Multiset Theory'
- Hamid Vahid (Tehran):
'The a priori Status of Mathematical Knowledge'
(Philosophy)
- Dimeter Vakarelov (Sofia, Bulgaria):
'Proximity Modal Logic'
- Andres Villaveces (Jerusalem):
'Categoricity Spectrum for Abstract
Elementary Classes: Reducing the Set-Theoretical
Hypotheses' (Set Theory)
Up to:
Back to LC97 homepage: 
LC97 Web maintainer:
S. B. Cooper,
last changed 23 July 1997