Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Logic, Language, Information, and Computation - 19th International Workshop, WoLLIC 2012, Buenos

Logic, Language, Information, and Computation

19th International Workshop, WoLLIC 2012, Buenos Aires, Argentina, September 3-6, 2012, Proceedings

Ong, Luke, de Queiroz, Ruy (Eds.)

2nd ed. 2012, XII, 337 p. 49 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$59.95

(net) price for USA

ISBN 978-3-642-32621-9

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$83.00

(net) price for USA

ISBN 978-3-642-32620-2

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

  • Fast-track conference proceedings
  • State-of-the-art research
  • Up-to-date results

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.

Content Level » Research

Keywords » computability and randomness - computational proof theory - dynamic epistemic logic - finite model theory - semantics of computation

Related subjects » Theoretical Computer Science

Table of contents 

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.-

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Algorithm Analysis and Problem Complexity.