Logic, Language, Information, and Computation: 23rd International Workshop, WoLLIC 2016, Puebla, Mexico, August 16-19th, 2016. Proceedings

✍ Scribed by Jouko Väänänen, Åsa Hirvonen, Ruy de Queiroz (eds.)

• Publisher: Springer-Verlag Berlin Heidelberg
• Year: 2016
• Tongue: English
• Leaves: 468
• Series: Lecture Notes in Computer Science 9803
• Edition: 1
• Category: Library

✦ Synopsis

Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 23rd Workshop on Logic, Language, Information and Communication, WoLLIC 2016, held in Puebla, Mexico, in August 2016.The 23 contributed papers, presented together with 9 invited lectures and tutorials, were carefully reviewed and selected from 33 submissions. The focus of the workshop is to provide a forum on inter-disciplinary research involving formal logic, computing and programming theory, and natural language and reasoning.

✦ Table of Contents

Front Matter....Pages I-XXII
Compactness in Infinitary Gödel Logics....Pages 1-21
Cut Elimination for Gödel Logic with an Operator Adding a Constant....Pages 22-35
A Classical Propositional Logic for Reasoning About Reversible Logic Circuits....Pages 36-51
Foundations of Mathematics: Reliability and Clarity: The Explanatory Role of Mathematical Induction....Pages 52-67
Justified Belief and the Topology of Evidence....Pages 68-82
Semantic Acyclicity for Conjunctive Queries: Approximations and Constraints....Pages 83-103
Expressivity of Many-Valued Modal Logics, Coalgebraically....Pages 104-108
Second-Order False-Belief Tasks: Analysis and Formalization....Pages 109-124
Categories: How I Learned to Stop Worrying and Love Two Sorts....Pages 125-144
A Logical Approach to Context-Specific Independence....Pages 145-164
Descriptive Complexity of Graph Spectra....Pages 165-182
Causality in Bounded Petri Nets is MSO Definable....Pages 183-199
A Multi-type Calculus for Inquisitive Logic....Pages 200-214
A Model-Theoretic Characterization of Constant-Depth Arithmetic Circuits....Pages 215-233
True Concurrency of Deep Inference Proofs....Pages 234-248
On the Complexity of the Equational Theory of Residuated Boolean Algebras....Pages 249-264
Semantic Equivalence of Graph Polynomials Definable in Second Order Logic....Pages 265-278
Sheaves of Metric Structures....Pages 279-296
A Curry–Howard View of Basic Justification Logic....Pages 297-315
On the Formalization of Some Results of Context-Free Language Theory....Pages 316-337
The Semantics of Corrections....Pages 338-357
The Expressive Power of k-ary Exclusion Logic....Pages 358-374
Characterizing Relative Frame Definability in Team Semantics via the Universal Modality....Pages 375-391
Negation and Partial Axiomatizations of Dependence and Independence Logic Revisited....Pages 392-409
Anaphors and Quantifiers....Pages 410-431
Back Matter....Pages 432-445
....Pages 447-447

✦ Subjects

Mathematical Logic and Formal Languages;Artificial Intelligence (incl. Robotics);Symbolic and Algebraic Manipulation;Logics and Meanings of Programs;Algorithm Analysis and Problem Complexity