Logic, Language, Information, and Computation

Name: Logic, Language, Information, and Computation | 18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

18th International Workshop, WoLLIC 2011, Philadelphia, PA, USA, May 18-20, Proceedings

Lev D. Beklemishev Ruy de Queiroz(Herausgeber*in)

Springer (Verlag)

1. Auflage

Erschienen am 28. April 2011

X, 311 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-20920-8 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Zur neuen Auflage

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Title
Preface
Organization
Table of Contents
Section 1: Invited Talks
Streaming String Transducers
Unification in Logic
A Symbolic Logic with Exact Bounds for Cryptographic Protocols
Univalent Foundations of Mathematics
Relational Concepts and the Logic of Reciprocity
Logic in the Time of WWW: An OWL View
Section 2: Contributed Papers
A Complexity Question in Justification Logic
Introduction
The Logic JD4
*-Calculus and Minimal Evidence Functions
A Class of Models
The Algorithm and Its Analysis
References
Basic Model Theory for Memory Logics
Introduction
Bisimulations and Saturated Models
Characterization and Definability
Interpolation
Conclusions and Further Work
References
Partial Realization in Dynamic Justification Logic
Introduction
Justification Logic
Semantics
Modal Public Announcement Logic
Soundness and Completeness for OPAL
Forgetful Projection and Realization
Conclusion
References
Hoare Logic for Higher Order Store Using Simple Semantics
Introduction
Programs, Assertions and Specifications
Expressions, Programs and Assertions
Contexts and Specifications
Proof Rules
Soundness of the Logic
Nondeterministic Programs
Modular Proofs
Related Work, Future Work and Conclusions
References
Nominal Lawvere Theories
Introduction
Nominal Sets and FM-Sets
Nominal Equational Logic
Nominal Lawvere Theories
Algebra in FM-Categories
Category-Theory Correspondence
Related and Further Work
References
Turing Machines on Cayley Graphs
Introduction
General Tape Geometries
Turing Machines on Cayley Graphs
A Well-Ordering in Trees
Tree of Super-Reduced Words
Power of Turing Machines on Cayley Graphs
Proof of Theorem 2
An Alternative Characterization of the r.e. Turing Degrees
Further Remarks
References
Information Flow on Directed Acyclic Graphs
Introduction
Protocol: A Formal Definition
Semantics
Graph Notation
Formal System: Axioms and Rules
Soundness
Completeness
Parity Protocol
Recursive Construction
Protocol Composition
Conclusion
References
The Boyce-Codd-Heath Normal Form for SQL
Introduction
Related Work
SQL Table Definitions
Axiomatic and Algorithmic Characterization
Equivalence to Goal and Definite Clauses in S-3 Logics
The Boyce-Codd-Heath Normal Form for SQL
Semantic Justification
Conclusion
References
Hybrid Logics and NP Graph Properties
Introduction
Hybrid Logic
Properties of Graphs in HL
Translation
Connected Frames with Loops
References
On the Expressive Power of IF-Logic with Classical Negation
Introduction
Syntax and Semantics of SL("3223379 )
Normal Forms for SL("3223379 )
Skolem Forms, Dependencies and 21-Expressivity
Skolem Form of SL("3223379 ) Sentences
First-Order Dependencies and the 12-Class
Conclusions
References
Concurrent Logic Games on Partial Orders
Introduction
The Concurrent Game Model
Closure Properties
Metatheorems for Systems and Property Verification
Algorithmic Applications and Further Work
References
Dynamic Epistemic Algebra with Post-conditions to Reason about Robot Navigation
Introduction
Robot Navigation with Topological Maps
Dynamic Epistemic Algebra with Post-conditions
Robot Movements as Post-conditions
Disbelief
Conclusions
Further Research
References
Untestable Properties in the Kahr-Moore-Wang Class
Introduction
Related Work
Preliminaries
An Untestable Property
Conclusion
References
Characterizing Definability of Second-Order Generalized Quantifiers
Introduction
Preliminaries
Generalized Quantifiers
Definability
Characterizing Definability
Conclusion
References
Countable Version of Omega-Rule
Introduction
Proof Search Tree for Arithmetic
System BI1c
Cut-Elimination Operations for BI1c
Embedding Finite Derivations into BIc1
References
Decomposing the Lattice of Meaningless Sets in the Infinitary Lambda Calculus
Introduction
Infinitary Lambda Calculus
The Elementary Key Intervals of Finite Cardinality
The Indecomposable Key Interval [R, SAS I L]
The Elementary Key Intervals of Infinite Cardinality
The Interval [R, SA]
The Interval [R, RS I L]
The Interval [SA, SAS I L]
The Intervals [H A, H AI L] and [H AO, H AI LO]
Non-modularity and Non-distributivity
Conclusions
References
Strong Normalization and Confluence for Reflexive Combinatory Logic
Introduction
Reflexive Combinatory Logic
The Language of RCL : Types and Typed Terms
Derivability Relation
Contractions
Strong Normalization and Confluence
Modal Combinatory Logic
Adequate Expressions and Reductions
Final Considerations
References
On Polymorphic Types of Untyped Terms
Introduction
Untyped Terms
Types
Typing Untyped Terms
References
Querying the Fragments of English
Introduction
The Fragments of English and Semantic Complexity
Querying the Fragments of English
Resolution Saturations and Data Complexity
Tractable Fragments
Intractable Fragments
An Undecidable Fragment
Conclusions and Related Work
References
Strong Paraconsistency by Separating Composition and Decomposition in Classical Logic
Introduction
Language and Proof Theory
Examples
Semantics
Soundness, Completeness and Other Important Properties
A Strong Paraconsistent Version of CL
A Relevant Logic Interpretation for the Lines of C-Proofs
Procedures for Proof Generation
References
How Much Expressive Power Is Needed for Natural Language Temporal Indexicality?
The Propositional Case: No Additional Expressive Power
The Predicate Case: More Expressive Power Is Needed
Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken