Logic, Language, Information, and Computation (2^nd Ed., 2nd ed. 2012) 19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3-6, 2012, Proceedings Theoretical Computer Science and General Issues Series

Formalizing Turing Machines.- Equivalence Relations That Are Σ0 3 Complete for Computable Reducibility.-An Analysis of Directed Motion Expressions with Lexicalized Tree Adjoining Grammars and Frame Semantics.-Admissible Rules: From Characterizations to Applications.-On Distributed Monitoring of Asynchronous Systems.-On the Expressive Power of Logics with Invariant Uses of Arithmetic Predicates.-Logical Methods in Quantum Information Theory.-Quantifying Notes.-Linearizing Bad Sequences: Upper Bounds for the Product and Majoring Well Quasi-orders.-Initiality for Typed Syntax and Semantics.-Moving Arrows and Four Model Checking Results.-Standard Completeness for Extensions of MTL: An Automated Approach.-The Logic of Justified Belief Change, Soft Evidence and Defeasible Knowledge.-Minimization via Duality.-On Some Subclasses of the Fodor-Roubens Fuzzy Bi-implication.-Linearity in the Non-deterministic Call-by-Value Setting.-Polynomial-Time Solution of Initial Value Problems Using Polynomial Enclosures.-Algorithmic Randomness and Ramsey Properties of Countable Homogeneous Structures.-Propositional Reasoning about Saturated Conditional Probabilistic Independence.-Contracting Logics.-A Tight Upper Bound on the Number of Variables for Average-Case k-Clique on Ordered Graphs.-Preservation under Substructures modulo Bounded Cores.-A Logic of Plausible Justifications.-Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics.-

Fast-track conference proceedings

State-of-the-art research

Up-to-date results