Logic for INTeraction

Main Page

Project Outline

People

Documents

Events

Mailing List *

Links

News:

2-3 April 2011: Oxford LINT Workshop, Oxford, UK

8-12 August 2011: Workshop on Logical Constants at ESSLLI 2011, Ljbuljana, Slovenia

Summary | Timetable
Talk (Väänänen) | Talk (Kontinen)
Talk (Hella) | Talk (Kuusisto, Virtema) | Talk (Bonnay) | Talk (Galliani)
Talk (Westerståhl) | Comments (Bonnay) | Concluding Discussion (Bonnay)

Summary

The first workshop in the LogCon group of LINT will take place in Tampere, Finland, from February 19 (noon) to February 21 (noon).

The workshop is intended as a start-up for work related to logical constants in LINT. The general format will be to have 4 half day sessions, each consisting of one or two talks with lots of time for discussion afterwards. The talks can be about finished work, or work in progress, or even just ideas for work; the aim is to get research collaborations going.

The workshop organizers are Lauri Hella and Dag Westerståhl. Lauri is also responsible for the local arrangements. If you intend to come to the workshop, please send him a message, preferably no later than January 31.

Indicate for which nights you need accommodation, and if you would like to present something at the workshop.

Welcome!

Timetable

Adding Truth Predicates to Logics (Denis Bonnay)

Comments on Dag's Talk, and a Similar Attempt by Carnap (Denis Bonnay)

Uniform Definability of Connectives in Dependence Logic (Pietro Galliani)

We answer negatively a question posed by (Juha) Kontinen and Väänänen in their 2007 paper On Definability in Dependence Logic: the "Forall-one" quantifier is not uniformly definable in Dependence Logic, that is, it is not equivalent to any polynomial in the term algebra of DL.

This despite the fact that, as Kontinen and Väänäanen observed, this quantifier does not increase the expressive power of Dependence Logic.

Further, we show how this quantifier can be decomposed into an universal quantifier and a "public announcement" operator, and how this result can be used to define a translation between Dependence Logic augmented with this new quantifier and Dependence Logic proper.

This translation is not compositional in the sense of (Peters and Westerståhl, 2008); however, it is an easy consequence of the non uniform definability of "forall-one" that no such compositional translation may exist.

Modalisation of k-Variable Logic (Lauri Hella)

Dependence Logic and Computational Complexity (Jarmo Kontinen)

Similarity Relations and Modalisation (Anti Kuusisto and Jonni Virtema)

Scott-Montague Semantics is closely related to a rather universal approach to logic. We begin with a detailed discussion of this perspective. We then move on to studying finite Scott-Montague models/frames. We suggest a way of simulating the action of an arbitrary Scott-Montague operator on a finite Scott-Montague structure with the action of a collection of polyadic modalities on a related Kripke structure. We call these Kripke structures "modalisations". We show that any two points of a finite Scott-Montague model satisfy exactly the same formulae of the related propositional language iff the two points are bisimilar in the modalisation of the Scott-Montague model. We discuss how our observations could be used in order to study the action of Scott-Montague operators in the finite.

Observations on Dependence Logic (Jouko Väänänen)

The abstract can be downloaded here.

Constants Extracted from Consequence Relations (Dag Westerståhl)

Problems and open LogCon questions: concluding discussion, with introduction by Denis Bonnay

Baroque music concert (Telemann, Händel, Bach, Vivaldi) by the Tampere Filharmonia in Tampere Talo

Tickets are 21 euro/person (For those who want)

|

maintained by: Pietro Galliani ()