Logic, Language, Information, and Computation

1. Front Matter

   PDF

2. Invited Papers and Abstracts of Invited Lectures

   1. Formalizing Turing Machines

      • Andrea Asperti, Wilmer Ricciotti

      Pages 1-25

   2. Equivalence Relations That Are \(\Sigma^0_3\) Complete for Computable Reducibility

      • Ekaterina Fokina, Sy Friedman, André Nies

      Pages 26-33

   3. An Analysis of Directed Motion Expressions with Lexicalized Tree Adjoining Grammars and Frame Semantics

      • Laura Kallmeyer, Rainer Osswald

      Pages 34-55

   4. Admissible Rules: From Characterizations to Applications

      • George Metcalfe

      Pages 56-69

   5. On Distributed Monitoring of Asynchronous Systems

      • Volker Diekert, Anca Muscholl

      Pages 70-84

   6. On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates

      • Nicole Schweikardt

      Pages 85-87

   7. Logical Methods in Quantum Information Theory

      • Peter Selinger

      Pages 88-88

   8. Quantifying Notes

      • Hans van Ditmarsch

      Pages 89-109

3. Contributed Papers

   1. Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders

      • Sergio Abriola, Santiago Figueira, Gabriel Senno

      Pages 110-126

   2. Initiality for Typed Syntax and Semantics

      • Benedikt Ahrens

      Pages 127-141

   3. Moving Arrows and Four Model Checking Results

      • Carlos Areces, Raul Fervari, Guillaume Hoffmann

      Pages 142-153

   4. Standard Completeness for Extensions of MTL: An Automated Approach

      • Paolo Baldi, Agata Ciabattoni, Lara Spendier

      Pages 154-167

   5. The Logic of Justified Belief Change, Soft Evidence and Defeasible Knowledge

      • Alexandru Baltag, Bryan Renne, Sonja Smets

      Pages 168-190

   6. Minimization via Duality

      • Nick Bezhanishvili, Clemens Kupke, Prakash Panangaden

      Pages 191-205

   7. On Some Subclasses of the Fodor-Roubens Fuzzy Bi-implication

      • Claudio Callejas, João Marcos, Benjamín René Callejas Bedregal

      Pages 206-215

   8. Linearity in the Non-deterministic Call-by-Value Setting

      • Alejandro Díaz-Caro, Barbara Petit

      Pages 216-231

   9. Polynomial-Time Solution of Initial Value Problems Using Polynomial Enclosures

      • Amin Farjudian

      Pages 232-245

   10. Algorithmic Randomness and Ramsey Properties of Countable Homogeneous Structures

       • Willem L. Fouché

       Pages 246-256

   11. Propositional Reasoning about Saturated Conditional Probabilistic Independence

       • Sebastian Link

       Pages 257-267

Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 19th Workshop on Logic, Language, Information and Communication, WoLLIC 2012, held in Buenos Aires, Argentina, in September 2012. The papers accompanying 8 invited lectures are presented together with 16 contributed papers; the latter were carefully reviewed and selected from 46 submissions. The papers report advances in inter-disciplinary research involving formal logic, theory of computation, foundations of mathematics, and computational linguistics.

• computability and randomness
• computational proof theory
• dynamic epistemic logic
• finite model theory
• semantics of computation
• algorithm analysis and problem complexity

• Department of Computer Science, University of Oxford, Oxford, UK

  Luke Ong

• Centro de Informática, Universidade Federal de Pernambuco, Recife, Brazil

  Ruy Queiroz

Policies and ethics