WoLLIC'2005
12^th Workshop on Logic, Language, Information and Computation
July 19^th to 22^nd, 2005

Florianópolis, Santa Catarina, 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)
,

Organisation
Departamento de Automação e Sistemas, Universidade Federal de Santa Catarina (DAS/UFSC)
Centro de Informática, Universidade Federal de Pernambuco (CIn-UFPE)

Programme

Tuesday, July 19th, 2005 (Tutorial Day)

Tutorials:

10:15-10:30 Coffee/tea break

10:30-12:30 (with a 10min break) (Chair: Joel Spencer)
  How to analyze expressiveness of logics over finite models
  by Leonid Libkin (Department of Computer Science, University of Toronto, Canada)

12:30-14:00 Lunch break

14:00-16:00 (with a 10min break) (Chair: Jean-Louis Krivine)
  A simple substitution method for ID1
  by Grigori Mints (Depts of Philosophy, Mathematics and Computer Science, Stanford University, USA)

Wednesday, July 20th, 2005

Morning: Logic, Randomness, and Model Theory

10:30-10:50 Coffee/tea break

10:50-12:50 (Tutorial) (with a 10min break) (Chair: Melvin Fitting)
  Infinitesimals in Model Theory
  by Thomas Scanlon (Mathematics Department, University of California at Berkeley, USA)

12:50-14:30 Lunch break

Afternoon: Proof Theory

15:45-16:00 Coffee/tea break

16:00-17:10 2 contributed papers (35 min each) (Chair: tbc)

16:00-16:35 Natural Deduction for Full S5 Modal Logic with Weak Normalization
    by Ana Teresa Martins and Lília Ramalho Martins

16:35-17:10 System BV is NP-complete
    by Ozan Kahramanougullari

17:25-18:35 2 contributed papers (35 min each) (Chair: tbc)

17:25-18:00 Analytical Tableaux for da Costa's Paraconsistent Logics Cn
    by Itala Maria Loffredo D'Ottaviano and Milton Augustinis de Castro

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

Thursday, July 21st 2005

Morning: Logic and Knowledge Representation

10:00-10:15 Coffee/tea break

10:15-11:25 2 contributed papers (35min each) (Chair: tbc)

10:15-10:50 Approximations of Modal Logics
  by Marcelo Finger and Guilherme Rabello

10:50-11:25 Propositional Logic as a Propositional Fuzzy Logic
  by Benjamín René Callejas Bedregal and Anderson Paiva Cruz

Afternoon: Logic, Finite Models and Descriptive Complexity

14:45-15:00 Coffee/tea break

15:00-16:45 3 contributed papers (35min each) (Chair: tbc)

15:00-15:35 Choiceless Polynomial Time, Counting and the Cai-Furer-Immerman Graphs
    by Anuj Dawar, David Richerby and Benjamin Rossman

15:35-16:10 Probabilistic verification and approximation
    by Richard Lassaigne and Sylvain Peyronnet

16:10-16:45 An Equivalence between Dependencies in Nested Databases and a Fragment of Propositional Logic
    by Sven Hartmann and Sebastian Link

17:00-18:15 (Invited talk) (Chair: Joel Spencer)
  Locality of queries and transformations
  by Leonid Libkin (Department of Computer Science, University of Toronto, Canada)

20:00 Conference Dinner at ?

Friday, July 22nd 2005

Morning: Logic and Computation

10:15-10:30 Coffee/tea break

10:30-11:40 2 contributed papers (30 min each) (Chair: tbc)

10:30-11:05 Development Separation in Lambda-Calculus
    by Hongwei Xi

11:05-11:40 Lowness properties and approximations of the jump
    by Santiago Figueira, André Nies and Frank Stephan

Afternoon: Logic, Model Theory and Definability

14:45-15:00 Coffee/tea break

15:00-16:15 (Invited talk) (Chair: Melvin Fitting)
  Groups in Nonstandard Complex Manifolds
  by Thomas Scanlon (Mathematics Department, University of California at Berkeley, USA)

16:30 CLOSING

Last modified: May 13, 2005, 15:19:20 GMT-0300.