WoLLIC'2003
10th Workshop on Logic, Language, Information and Computation

July 29 to August 1, 2003

Ouro Preto, Minas Gerais, Brazil

Scientific Sponsorship
Interest Group in Pure and Applied Logics (IGPL)
European Association for Logic, Language and Information (FoLLI)
Association for Symbolic Logic (ASL)
European Association for Theoretical Computer Science (EATCS)
Sociedade Brasileira de Computação (SBC)
Sociedade Brasileira de Lógica (SBL)

Funding (expected)
CAPES, CNPq

Organisation
Centro de Informática, Universidade Federal de Pernambuco (CIn-UFPE
Departamento de Matemática, Universidade Federal de Minas Gerais (DMAT/UFMG)
Departamento de Computação, Universidade Federal de Ouro Preto (DECOM/UFOP)


Programme


Tuesday, July 29th, 2003 (Tutorial Day)

Tutorials:

08:15-10:15 (with a 10min break) Chair: Hans Rott
  Algorithmic Randomness and Derandomization
  by Eric Allender (Department of Computer Science, Rutgers, the State University of NJ, USA)

10:15-10:30 Coffee/tea break

10:30-12:30 (with a 10min break) Chair: Dale Miller
  Generalized Quantifiers
  by Lauri Hella (Department of Mathematics, Statistics and Philosophy, University of Tampere, Finland)

12:30-14:00 Lunch break

14:00-16:00 (with a 10min break) Chair: Eric Allender
  Implicit computational complexity
  by Jean-Baptiste Joinet (Preuves-Programmes-Systèmes, Université Paris 7, France)

16:00-16:15 Coffee/tea break

16:15-18:15 (with a 10min break) Chair: Lauri Hella
  Proof search foundations for logic programming
   by Dale Miller (INRIA/Futurs/Saclay, and Laboratoire d'Informatique, École Polytechnique, France)

Wednesday, July 30th, 2003

Morning: Logic and Knowledge Representation

08:00-08:30 OPENING

08:30-10:30 (with a 10min break) (Tutorial) Chair: Jean-Baptiste Joinet

  Iterated theory change
  by Hans Rott (Institut für Philosophie, Universität Regensburg, Germany)

10:30-10:45 Coffee/tea break

10:45-12:30 3 contributed papers (35min each) Chair: tba

12:30-14:00 Lunch break

Afternoon: Logic and Programming Languages

14:00-15:15 (Invited talk) Chair: Jean-Baptiste Joinet

  Encryption as an abstract datatype
  by Dale Miller (INRIA/Futurs/Saclay, and Laboratoire d'Informatique, École Polytechnique, France)

15:15-15:30 Coffee/tea break

15:30-17:15 3 contributed papers (35min each) Chair: Nachum Dershowitz

Thursday, July 31st, 2003

Morning: Logic and Theoretical Computer Science

08:30-09:45 (Invited talk) Chair: Lauri Hella

  NL-printable sets and Nondeterministic Kolmogorov Complexity
  by Eric Allender (Department of Computer Science, Rutgers, the State University of NJ, USA)

09:45-10:00 Coffee/tea break

10:00-11:10 3 contributed papers (35min each) Chair: Renata Wassermann

11:45-14:00 Lunch break

Afternoon: Logic and Language

14:00-15:15 (Invited talk) Chair: Dale Miller

  Economy and economics in the logic of theory change
  by Hans Rott (Institut für Philosophie, Universität Regensburg, Germany)

15:15-15:30 Coffee/tea break

15:30-17:15 3 contributed papers (35min each) Chair: Marek Zaionc

Friday, August 1st, 2003

Morning: Proof Theory, Model Theory and Definability

08:00-09:15 (Invited talk) Chair: Hans Rott

  Calculus of structures and proof-nets
  by Jean-Baptiste Joinet (Preuves-Programmes-Systèmes, Université Paris 7, France)

09:15-09:30 Coffee/tea break

09:30-11:15 3 contributed papers (35min each) Chair: Luiz Carlos Pereira

11:15-11:30 Coffee/tea break

11:30-12:45 (Invited talk) Chair: Eric Allender

  Quantifying over Quantifiers
  by Lauri Hella (Department of Mathematics, Statistics and Philosophy, University of Tampere, Finland)

13:00 CLOSING



Last modified: July 7, 2003, 14:57:08 GMT-0300.
wollic_at_cin.ufpe.br