JLLIC Special Issue on Guarded Logics and Decidable Fragments

Call for Papers

It has been almost ten years since Andreka, van Benthem and Nemeti proved the decidability of the guarded fragment of first order logic. Given how expressive guarded quantification is, this result gave logicians a powerful tool for proving the decidability of many formalisms arising in computer science applications, and has generated extensive research into guarded quantification in logics other than first order and into various generalisations of guarded quantification. A wealth of new proof techniques has been developed as a result of this research. This special issue, based on a workshop on guarded fragments held at ESSLLI 2004 in Nancy, aims to reflect new developments in the search for decidable fragments and their applications.

Topics of interest for contributions to the journal issue include, but are not limited to: generalisations of guarded quantification; new decidable fragments; complexity of guarded logics; applications of guarded logics.

Submissions

Submissions must be original work, which have not been previously published in a full form and is not being under review for publication elsewhere. Please send .ps or .pdf submissions in Kluwer journal style (available at http://www.wkap.nl/authors/jrnlstylefiles/) to nza at cs.nott.ac.uk.

Important Dates

Submission : December 1, 2004
Notification : January 31, 2005
Final version : March 15, 2005

Guest Editor

Natasha Alechina (University of Nottingham, UK), nza at cs.nott.ac.uk