WoLLIC'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)
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)
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)
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
11:20-11:55 The Universe of Approximations
by Marcelo Finger and Renata Wassermann (Departamento de Ciência da Computação, Instituto de Matemática e Estatística, Universidade de São Paulo, Brazil)
11:55-12:30 Expressibility of Higher Order Logics
by Lauri Hella (Department of Mathematics, Statistics and Philosophy, University of Tampere, Finland)
and
José Maria Turull Torres (Information Science Research Centre, Massey University, New Zealand)
12:30-14:00 Lunch break
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
16:05-16:40 Quantifier-free logic for multialgebraic theories
by Yngve Lamo (Faculty of Engineering, Bergen University College, Norway)
and
Michal Walicki
(Department of Informatics, University of Bergen, Norway)
16:40-17:15 A Programming Language for the Interval Geometric Machine
by Renata H. S. Reiser, Antônio Carlos da Rocha Costa and Graçaliz P. Dimuro (Escola de Informática, Universidade Católica de Pelotas, Brazil)
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
10:35-11:10 Gap Embedding for Well-Quasi-Orderings
by Nachum Dershowitz and Iddo Tzameret (School of Computer Science, Faculty of Exact Sciences, Tel Aviv University, Israel)
11:10-11:45 Statistics of implicational logic
by Marek Zaionc (Institute of Computer Science, Faculty of Mathematics and Physics, Jagiellonian University, Poland)
11:45-14:00 Lunch break
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
16:05-16:40 Some properties of intercategorial entailment
by Richard Zuber (CNRS and Université de Paris 7, France)
16:40-17:15 A Tableau Method for the Lambek Calculus based on a Matrix Characterization
by Leonardo B. Vana and Marcelo da S. Corrêa (Departamento de Análise, Universidade Federal Fluminense, Niterói, Brazil)
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
10:05-10:40 Cut Elimination in a Class of Sequent Calculi for Pure Type Systems
by Francisco Gutiérrez and Blas Ruiz (Departamento de Lenguajes y Ciencias de la Computación, Universidad de Málaga, Spain)
10:40-11:15 Reasoning About Functional Dependencies in an Abstract Data Model
by Sven Hartmann and Sebastian Link (Information Science Research Centre, Massey University, New Zealand)
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