Logic, Language, Information, and Computation

Luke Ong, Ruy de Queiroz (Herausgeber)

Buch | Softcover

XII, 337 Seiten

2012 | 2nd ed. 2012
Springer Berlin (Verlag)
978-3-642-32620-2 (ISBN)

Infos

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.

Inhalt

Formalizing Turing Machines.- Equivalence Relations That Are Sigma0 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.-

Produkt-Details

• Erscheint lt. Verlag: 16.7.2012
• Reihe/Serie: Lecture Notes in Computer Science
• Reihe/Serie: Theoretical Computer Science and General Issues
• Zusatzinfo: XII, 337 p. 49 illus.
• Verlagsort: Berlin
• Sprache: englisch
• Maße: 155 x 235 mm
• Gewicht: 533 g
• Themenwelt: Informatik ► Theorie / Studium ► Algorithmen
• Themenwelt: Mathematik / Informatik ► Mathematik ► Wahrscheinlichkeit / Kombinatorik
• Schlagworte: Algorithm analysis and problem complexity • computability and randomness • computational proof theory • dynamic epistemic logic • Finite model theory • semantics of computation
• ISBN-10: 3-642-32620-X / 364232620X
• ISBN-13: 978-3-642-32620-2 / 9783642326202
• Zustand: Neuware