Dependence and independence are common phenomena, wherever one looks: ecological systems, astronomy, human history, stock markets - but what is their role in logic and - turning the tables - what is the logic of these concepts?
The possibility of nesting quantifiers, thus expressing patterns of dependence and independence between variables, accounts for much of the expressive power of first order logic.
However, first order logic is not capable of expressing all such patterns, and as a consequence various generalizations - such as branching quantifiers, or the various variants of independence-friendly logic - have been introduced during the last fifty years.
Dependence logic is a recent formalism, which brings to the forefront the very concept of dependence, isolating it from the notion of quantifier and making it one of the primitive elements of the language. It can also be added to other logics, such as modal logic.
This has opened up an opportunity to develop logical tools for the study of complex forms of dependence, with applications to computer science, philosophy, linguistics, game theory and mathematics. Recently there has been an increasing interest in this topic, especially among young researchers.
The goal of this workshop is to provide an opportunity for researchers to further explore the very notions of dependence and independence and their role in formal logic, in particular with regard to logics of imperfect information.
The proceedings of the workshop can be downloaded here.
The workshop is part of ESSLLI and is open to all ESSLLI participants. It will consist of five 90-minute sessions held over five consecutive days in the second week of ESSLLI. There will be three invited talks of 60-minutes and nine 30-minute paper presentations.
A preliminary version of the schedule follows:
|Monday Aug 16||17:00 Jouko Väänänen, Workshop opening
17:00-18:00 Xavier Caicedo, "On imperfect information logic as [0,1]-valued logic"
|18:00-18:30 Pietro Galliani, "Epistemic Operators and Uniform Definability in Dependence Logic"|
|Tuesday Aug 17||17:00-18:00 Lauri Hella, "Contraint Satisfaction Problems, Partially Ordered Connectives and Dependence Logic"||18:00-18:30 Antti Kuusisto, "Logics of Imperfect Information without Identity"|
|Wednesday Aug 18||17:00-18:00 Samson Abramsky, "Relational Hidden Variables and Non-Locality"||18:00-18:30 TBA|
|Thursday Aug 19||17:00-17:30 Fan Yang, "Expressing Second-order Sentences in Intuitionistic Dependence Logic"||17:30-18:00 Jarmo Kontinen, "Coherence and Computational Complexity of Quantifier-Free Dependence Logic Formulas "||18:00-18:30 Allen Mann and Pietro Galliani, "Lottery Semantics"|
|17:00-17:30 Denis Paperno, "Quantifier Independence and Downward Monotonicity"||17:30-18:00 Theo M.V. Janssen, "A Comparison of Independence Friendly logic and Dependence logic"||Peter Lohmann and Heribert Vollmer, "Complexity Results for Modal Dependence Logic"|
Authors are invited to submit an extended abstract with a maximum length of 5 pages. The following formats are accepted: PDF and PS (Latex-generated papers are preferred.) Please send your submission electronically to both organizers by the deadline listed below. The submissions will be reviewed by the programme committee and additional reviewers. The accepted papers will appear in the workshop proceedings published by ESSLLI. The format for the final versions will be made available in due course.
Selected papers of the proceedings will be published in the Studia Logica special issue on Dependence and Independence in Logic.
- Samson Abramsky (Oxford University)
- Xavier Caicedo (Universidad de los Andes)
- Lauri Hella (University of Tampere)
- Submission deadline: 25 April 2010
- Notification: 15 May 2010
- Preliminary programme: 22 May 2010
- ESSLLI early registration: 1 June 2010
- Final papers for proceedings: 15 June 2010
- Final programme: 21 June 2010
- Workshop dates: 16-20 August 2010
This workshop is financially supported by the European Science Foundation EUROCORES LogICCC Programme and organized in cooperation with the LogICCC project LINT (Logic for interaction)."