## Logic, Language, Information and Computation: 15th International Workshop, WoLLIC 2008 Edinburgh, UK, July 1-4, 2008, ProceedingsWilfrid Hodges, Ruy de Queiroz Edited in collaboration with FoLLI, the Association of Logic, Language and Information, this book constitutes the 4th volume of the FoLLI LNAI subline; containing the refereed proceedings of the 15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008, held in Edinburgh, UK, in July 2008. The 21 revised full papers presented together with the abstracts of 7 tutorials and invited lectures were carefully reviewed and selected from numerous submissions. The papers cover all pertinent subjects in computer science with particular interest in cross-disciplinary topics. Typical areas of interest are: foundations of computing and programming; novel computation models and paradigms; broad notions of proof and belief; formal methods in software and hardware development; logical approach to natural language and reasoning; logics of programs, actions and resources; foundational aspects of information organization, search, flow, sharing, and protection. |

### What people are saying - Write a review

### Contents

Interderiving Semantic Artifacts for ObjectOriented Programming Extended Abstract | 1 |

On the Descriptive Complexity of Linear Algebra | 17 |

Talks on Quantum Computing | 26 |

On Game Semantics of the Affine and Intuitionistic Logics Extended Abstract | 28 |

The Grammar of Scope | 43 |

Conjunctive Grammars and Alternating Pushdown Automata Extended Abstract | 44 |

Expressive Power and Decidability for Memory Logics | 56 |

Reasoning with Uncertainty by NmatrixMetric Semantics | 69 |

On the Formal Semantics of IFLike Logics | 164 |

CurryHoward and Incomplete Derivations | 179 |

Labelled Calculi for euroukasiewicz Logics | 194 |

An InfinitelyOften OneWay Function Based on an AverageCase Assumption | 208 |

On Characteristic Constants of Theories Defined by Kolmogorov Complexity | 218 |

Adversary Lower Bounds for Nonadaptive Quantum Algorithms | 226 |

On SecondOrder Monadic Groupoidal Quantifiers | 238 |

Inference Processes for Quantified Predicate Knowledge | 249 |

A Propositional Dynamic Logic for CCS Programs | 83 |

Towards Ontology Evolution in Physics | 98 |

Nominal Matching and AlphaEquivalence | 111 |

Interval Additive Generators of Interval TNorms | 123 |

Propositional Dynamic Logic as a Logic of Belief Revision | 136 |

Time Complexity and Convergence Analysis of Domain Theoretic Picard Method | 149 |

Using alphaCTL to Specify Complex Planning Goals | 260 |

Hyperintensional Questions | 272 |

Skolem Theory and Generalized Quantifiers | 286 |

On a Graph Calculus for Algebras of Relations | 298 |

313 | |