WoLLIC'2006
13^th Workshop on Logic, Language, Information and Computation
July 18^th to 21^st, 2006

Center for the Study of Language and Information (CSLI), Stanford, California, USA

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
The Tinker Foundation
The Office of the Provost, Stanford University
CSLI, Stanford University
Department of Philosophy, Stanford University
Dept of Mathematics, Stanford University
Symbolic Systems Program, Stanford University

Organisation
Center for Latin American Studies, Stanford University
Department of Philosophy, Stanford University
CSLI, Stanford University

(Provisional) Programme

Tuesday, July 18th, 2006 (Tutorial Day)

Tutorials:

09:00-11:00 (with a 10min break) (Chair: tba)
New insights into Probabilistically Checkable Proofs (PCPs)
by Eli Ben-Sasson (Comput Sci Dept, Technion Inst of Technology, Israel)

11:00-11:15 Coffee/tea break

11:15-13:15 (with a 10min break) (Chair: tba)
Operational theories of sets
by Solomon Feferman (Depts of Mathematics and Philosophy, Stanford University, USA)

13:15-14:30 Lunch break

14:30-16:30 (with a 10min break) (Chair: tba)
Behavioral Computation Theory
by Yuri Gurevich (Microsoft Research, USA)

16:30-16:45 Coffee/tea break

16:45-18:45 (with a 10-min break) (Chair: tba)
Symbolic Analysis of Computer Network Security Protocols
by Andre Scedrov (Department of Mathematics, University of Pennsylvania, USA)

Wednesday, July 19th, 2006

Morning: Proof Theory

08:30-10:30 (Tutorial) (with a 10-min break) (Chair: tba)
Proof Mining: Applications of Proof Theory to Analysis
by Ulrich Kohlenbach (Department of Mathematics, Darmstadt University of Technology, Germany)

10:30-10:45 Coffee/tea break

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

10:45-11:20

The Axiom System I$Sigma_0$ Manages to Simultaneously Obey and Evade the Herbrandized Version of the Second Incompleteness Theorem

Dan Willard

11:20-11:55 Propositional games with explicit strategies
by Bryan Renne

11:55-12:30 Combinatorial Proofs and Garbage Collection
by Dominic Hughes

12:30-14:00 Lunch break

Afternoon: Formal Methods

14:00-15:15 (Invited talk) (Chair: tbc)
Symbolic Analysis of Computer Network Security Protocols
by Andre Scedrov (Department of Mathematics, University of Pennsylvania, USA)

15:15-15:30 Coffee/tea break

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

15:30-16:05

Reasoning with Graphs

Jorge Petrúcio Viana

Renata P. de Freitas

Sheila R. M. Veloso

16:05-16:40 Situations as strings
by Tim Fernando

16:40-17:15 Abstract Families of Abstract Categorial Languages
by Makoto Kanazawa

20:00 Welcome Cocktail

Thursday, July 20th 2006

Morning: Logic and Model Theory

09:00-11:00 (Tutorial) (with a 10-min break) (Chair: tba)
Infinitesimals in Model Theory
by Thomas Scanlon (Mathematics Department, University of California at Berkeley, USA)

11:00-11:15 Coffee/tea break

11:15-11:55 1 contributed paper (35min each) (Chair: tbc)

11:15-11:50

Monadic Second-Order Logic over Trees and Deterministic Transitive Closure Logics

Hans-Jörg Tiede

Stephan Kepser

11:55-14:00 Lunch break

Afternoon: Logic and Computation

14:00-15:15 (Invited talk) (Chair: tbc)
New insights into Probabilistically Checkable Proofs (PCPs)
by Eli Ben-Sasson (Comput Sci Dept, Technion Inst of Technology, Israel)

15:15-15:30 Coffee/tea break

15:30-16:05 1 contributed paper (35min each) (Chair: tbc)

15:30-16:05

Formalizing Type Operations Using the ``Image'' Type Constructor

Aleksey Nogin

Alexei Kopylov

16:05-16:20 Coffee/tea break

16:20-17:35 (Invited talk) (Chair: tba)
The expanding notion of algorithm
by Yuri Gurevich (Microsoft Research, USA)

20:00 Conference Dinner at ?

Friday, July 21st 2006

Morning: Logic and Foundations

09:00-10:15 (Invited talk) (Chair: tba)
A logical uniform boundedness principle for abstract metric and hyperbolic spaces
by Ulrich Kohlenbach (Department of Mathematics, Darmstadt University of Technology, Germany)

10:15-10:30 Coffee/tea break

10:30-11:45 (Invited talk) (Chair: tba)
Operational theories of sets
by Solomon Feferman (Depts of Mathematics and Philosophy, Stanford University, USA)

11:45-12:00 Coffee/tea break

12:00-13:10 2 contributed papers (35min each) (Chair: tbc)

12:00-12:35

Proof mining in R-trees and hyperbolic spaces

Laurentiu Leustean

12:35-13:10 On interpolation problem in paraconsistent extensions of minimal logic
by Larisa Maksimova

13:10-14:00 Lunch break

Afternoon: Logic, Model Theory and Definability

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

15:15-15:30 Coffee/tea break

15:30-16:40 2 contributed papers (35min each) (Chair: tbc)

15:30-16:05

Conditional Doxastic Models: a qualitative approach to dynamic belief revision

Alexandru Baltag

Sonja Smets

16:05-16:40 Additive Consolidation with Maximal Change
by Yoshitaka Suzuki

16:40 CLOSING

Last modified: June 15, 2006, 10:04am PDT.