Programme (in PDF)

Tuesday, July 19th, 2005 (Tutorial Day)## Tutorials:

08:15-10:15(with a 10min break) (Chair:Grigori Mints)

Curry-Howard correspondence in classical set theory

byJean-Louis Krivine(Equipe Preuves, Programmes et Systèmes, Université Paris 7, France)

10:15-10:30Coffee/tea break

10:30-12:30(with a 10min break) (Chair:Joel Spencer)

How to analyze expressiveness of logics over finite models

byLeonid Libkin(Department of Computer Science, University of Toronto, Canada)

12:30-14:00Lunch break

14:00-16:00(with a 10min break) (Chair:Jean-Louis Krivine)

A simple substitution method for ID1

byGrigori Mints(Depts of Philosophy, Mathematics and Computer Science, Stanford University, USA)

Wednesday, July 20th, 2005## Morning:

Logic, Randomness, and Model Theory

08:30-10:30(Tutorial) (with a 10-min break) (Chair:Leonid Libkin)

The Strange Logic of Random Graphs

byJoel Spencer(Courant Institute, New York Univ, USA)

10:30-10:50Coffee/tea break

10:50-12:50(Tutorial) (with a 10min break) (Chair:Melvin Fitting)

Infinitesimals in Model Theory

byThomas Scanlon(Mathematics Department, University of California at Berkeley, USA)

12:50-14:30Lunch break## Afternoon:

Proof Theory

14:30-15:45(Invited talk) (Chair:Jean-Louis Krivine)

Intuitionistic Frege Systems are Polynomially Equivalent

byGrigori Mints(Depts of Philosophy, Mathematics and Computer Science, Stanford University, USA)

15:45-16:00Coffee/tea break

16:00-17:102 contributed papers (35 min each) (Chair:Guilherme Bittencourt)

16:00-16:35Natural Deduction for Full S5 Modal Logic with Weak Normalization

by Ana Teresa Martins and Lília Ramalho Martins

16:35-17:10System BV is NP-complete

by Ozan Kahramanogullari

17:10-17:25Coffee/tea break

17:25-18:352 contributed papers (35 min each) (Chair:Marcelo Finger)

17:25-18:00Analytical Tableaux for da Costa's Paraconsistent Logics Cn

by Itala Maria Loffredo D'Ottaviano and Milton Augustinis de Castro

18:00-18:35Tableau Systems for Some Paraconsistent Modal Logics

by Casey McGinnis

20:00Welcome Cocktail

Thursday, July 21st 2005## Morning:

Logic and Knowledge Representation

08:30-10:30(Tutorial) (with a 10-min break) (Chair:Thomas Scanlon)

Logics with Explicit Evidence

byMelvin Fitting(Dept of Maths and Computer Science, Lehman College, City Univ of New York, USA)

10:00-10:15Coffee/tea break

10:15-11:252 contributed papers (35min each) (Chair:Itala Maria Loffredo D'Ottaviano)

10:15-10:50Approximations of Modal Logics

by Marcelo Finger and Guilherme Rabello

10:50-11:25Propositional Logic as a Propositional Fuzzy Logic

by Benjamín René Callejas Bedregal and Anderson Paiva Cruz

11:25-13:30Lunch break## Afternoon:

Logic, Finite Models and Descriptive Complexity

13:30-14:45(Invited talk) (Chair:Leonid Libkin)

The Complexity of Random Ordered Structures

byJoel Spencer(Courant Institute, New York Univ, USA) (joint work with Katherine St. John)

14:45-15:00Coffee/tea break

15:00-16:453 contributed papers (35min each) (Chair:Ana Teresa Martins)

15:00-15:35Choiceless Polynomial Time, Counting and the Cai-Furer-Immerman Graphs

by Anuj Dawar, David Richerby and Benjamin Rossman

15:35-16:10Probabilistic verification and approximation

by Richard Lassaigne and Sylvain Peyronnet

16:10-16:45An Equivalence between Dependencies in Nested Databases and a Fragment of Propositional Logic

by Sven Hartmann and Sebastian Link

16:45-17:00Coffee/tea break

17:00-18:15(Invited talk) (Chair:Joel Spencer)

Locality of queries and transformations

byLeonid Libkin(Department of Computer Science, University of Toronto, Canada)

20:00Conference Dinner at ?

Friday, July 22nd 2005## Morning:

Logic and Computation

09:00-10:15(Invited talk) (Chair:Grigori Mints)

A program for the axiom of dependent choice

byJean-Louis Krivine(Equipe Preuves, Programmes et Systèmes, Université Paris 7, France)

10:15-10:30Coffee/tea break

10:30-11:402 contributed papers (30 min each) (Chair:Ruy de Queiroz)

10:30-11:05Development Separation in Lambda-Calculus

by Hongwei Xi

11:05-11:40Lowness properties and approximations of the jump

by Santiago Figueira, André Nies and Frank Stephan

11:40-13:30Lunch break## Afternoon:

Logic, Model Theory and Definability

13:30-14:45(Invited talk) (Chair:Thomas Scanlon)

A Quantified Logic of Evidence

byMelvin Fitting(Dept of Maths and Computer Science, Lehman College, City Univ of New York, USA)

14:45-15:00Coffee/tea break

15:00-16:15(Invited talk) (Chair:Melvin Fitting)

Groups in Nonstandard Complex Manifolds

byThomas Scanlon(Mathematics Department, University of California at Berkeley, USA)

16:30CLOSING

*Last modified: July 12, 2005, 11:39:20 GMT-0300.*