Logic, Language, Information and Computation: 19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3-6, 2012. Proceedings

✍ Scribed by Andrea Asperti, Wilmer Ricciotti (auth.), Luke Ong, Ruy de Queiroz (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2012
• Tongue: English
• Leaves: 346
• Series: Lecture Notes in Computer Science 7456 Theoretical Computer Science and General Issues
• Edition: 2
• Category: Library

✦ Synopsis

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.

✦ Table of Contents

Front Matter....Pages -
Formalizing Turing Machines....Pages 1-25
Equivalence Relations That Are $\Sigma^0_3$ Complete for Computable Reducibility....Pages 26-33
An Analysis of Directed Motion Expressions with Lexicalized Tree Adjoining Grammars and Frame Semantics....Pages 34-55
Admissible Rules: From Characterizations to Applications....Pages 56-69
On Distributed Monitoring of Asynchronous Systems....Pages 70-84
On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates....Pages 85-87
Logical Methods in Quantum Information Theory....Pages 88-88
Quantifying Notes....Pages 89-109
Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders....Pages 110-126
Initiality for Typed Syntax and Semantics....Pages 127-141
Moving Arrows and Four Model Checking Results....Pages 142-153
Standard Completeness for Extensions of MTL: An Automated Approach....Pages 154-167
The Logic of Justified Belief Change, Soft Evidence and Defeasible Knowledge....Pages 168-190
Minimization via Duality....Pages 191-205
On Some Subclasses of the Fodor-Roubens Fuzzy Bi-implication....Pages 206-215
Linearity in the Non-deterministic Call-by-Value Setting....Pages 216-231
Polynomial-Time Solution of Initial Value Problems Using Polynomial Enclosures....Pages 232-245
Algorithmic Randomness and Ramsey Properties of Countable Homogeneous Structures....Pages 246-256
Propositional Reasoning about Saturated Conditional Probabilistic Independence....Pages 257-267
Contracting Logics....Pages 268-281
A Tight Upper Bound on the Number of Variables for Average-Case k -Clique on Ordered Graphs....Pages 282-290
Preservation under Substructures modulo Bounded Cores....Pages 291-305
A Logic of Plausible Justifications....Pages 306-320
Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics....Pages 321-335
Back Matter....Pages -

✦ Subjects

Algorithm Analysis and Problem Complexity; Mathematical Logic and Formal Languages; Discrete Mathematics in Computer Science; Logics and Meanings of Programs; Computation by Abstract Devices; Symbolic and Algebraic Manipulation