Logic, Language, Information, and Computation 22nd International Workshop, WoLLIC 2015, Bloomington, IN, USA, July 20-23, 2015, Proceedings
Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 22nd Workshop on Logic, Language, Information and Computation, WoLLIC 2015, held in the campus of Indiana University, Bloomington, IN, USA in July 2015.The 14...
Saved in:
Main Authors | , , , , |
---|---|
Format | eBook Book |
Language | English |
Published |
Berlin, Heidelberg
Springer Nature
2015
Springer Springer Berlin / Heidelberg |
Edition | 1 |
Series | LNCS sublibrary. SL 1, Theoretical computer science and general issues |
Subjects | |
Online Access | Get full text |
ISBN | 3662477092 9783662477090 9783662477083 3662477084 |
Cover
Table of Contents:
- Intro -- Preface -- Organization -- Invited Papers -- Modeling Language Design for Complex Systems Simulation -- Formalization of Mathematics for Fun and Profit -- From Residuated Lattices via GBI-Algebras to BAOs -- Towards a Nominal Chomsky Hierarchy -- Multi-linear Algebraic Semantics for Natural Language -- Categories of Games -- Learning in the Limit, General Topology, and Modal Logic -- Contents -- The Word Problem for Finitely Presented Quandles is Undecidable -- 1 Introduction -- 2 The Theory of Quandles -- 2.1 The Inner Automorphism Group of a Quandle -- 2.2 The Group Quandle -- 3 The Quandle QG -- 3.1 Representing G in Inn(QG) -- 4 The Embedding -- 4.1 The Group Gx -- 4.2 The Free Product G*"426830A x"526930B -- 4.3 The Word Problem for Quandles -- 5 Racks -- 6 Conclusion and Future Work -- A Identities -- A.1 Idempotence -- A.2 Right Distributivity -- B RQ Is the Same Algebra as Q -- References -- Intuitionistic Ancestral Logic as a Dependently Typed Abstract Programming Language -- 1 Introduction -- 2 The System iFOL -- 3 The System iAL -- 3.1 The Transitive Closure Operator -- 3.2 Realizability Semantics for iAL -- 3.3 Proof System for iAL over Domain D -- 3.4 Soundness for iAL -- 3.5 Reasoning About Programs in iAL -- 4 Further Research -- References -- On Topologically Relevant Fragments of the Logic of Linear Flows of Time -- 1 Introduction -- 2 Linear Flows of Time -- 3 Topological Modal Logic -- 4 Topologies Arising from Combined Tense Modalities -- 5 Supplementary Issues -- 6 Conclusions -- References -- An Equation-Based Classical Logic -- 1 Introduction -- 2 Algebraic Preliminaries -- 3 The Logic -- 3.1 Deductive System -- 3.2 Soundness and Completeness -- 4 Decidability -- 5 Conclusion and Future Work -- 6 Appendix -- References -- Cyclic Multiplicative Proof Nets of Linear Logic with an Application to Language Parsing
- 1 Introduction -- 1.1 Cyclic MLL -- 2 Proof Structures -- 2.1 Correctness of Proof Structures -- 2.2 Cut Reduction -- 2.3 Sequentialization -- 3 Embedding Lambek Calculus into CyMLL PNs -- 4 Parsing via Lambek CyMLL PNs -- 5 Conclusions and Further Works -- A Technical Appendices -- A.1 Proof of Theorem 1: Stability of PNs under Cut Reduction -- A.2 Proof of Lemma 1: Splitting -- A.3 Proof of Lemma 2: Cyclic Order Conclusions of a PN -- A.4 Proof of Theorem 5: Sequentialization of Lambek CyMLL PNs -- References -- A Dichotomy Result for Ramsey Quantifiers -- 1 Motivations -- 2 Preliminaries -- 2.1 Generalized Quantifiers -- 2.2 Computational Complexity -- 3 Ramsey Quantifiers -- 3.1 Ramsey Theory and Quantifiers -- 3.2 Basic Proportional Ramsey Quantifiers -- 3.3 Tractable Ramsey Quantifiers -- 3.4 Intermediate Ramsey Quantifiers -- 3.5 Intractable Ramsey Quantifiers -- 4 Conclusions and Outlook -- References -- Parametric Polymorphism --- Universally -- 1 Introduction -- 2 Reynolds' Parametrically Polymorphic Functions -- 3 Fibrational Tools -- 4 Parametrically Polymorphic Functions, Axiomatically -- 5 Conclusion -- References -- On the Weak Index Problem for Game Automata -- 1 Introduction -- 2 Preliminaries -- 3 Computing the Weak Index -- 4 On the Correctness of the Algorithm -- 5 Conclusions -- A Upper Bounds -- B Lower Bounds -- References -- Proof-Theoretic Aspects of the Lambek-Grishin Calculus -- 1 Introduction -- 2 Lambek-Grishin Calculus -- 3 Classical Non-associative Lambek Calculus -- 4 Translation of LG into CNL -- 5 Multimodal Classical Non-Assiociative Lambek Calculus -- 6 Translation of LG into 2-CNL -- 7 Grishin Interactions -- 8 A Sequent Calculus for LG -- 9 Conclusion -- A Proof of Proposition1 -- B Proof of Proposition2 -- References -- Syllogistic Logic with ``Most'' -- 1 Introduction -- 2 Syntax and Semantics -- 3 Proof System
- 4 Completeness -- 4.1 The Proof When Is All A*are B*. -- 4.2 The Proof When Is MostA*areB* -- 4.3 Starting the Proof When Is SomeA*areB* -- 4.4 A Lemma on Falling Sums -- 4.5 Notation for Sets in Our Model Construction -- 4.6 The Model and the Verification -- 5 No Finite Axiomatization -- 6 Conclusion and Future Work -- References -- Characterizing Frame Definability in Team Semantics via the Universal Modality -- 1 Introduction -- 2 Modal Logic with Universal Modality -- 3 Modal Frame Definability -- 4 Goldblatt--Thomason -style Theorem for -- 5 Frame Definability in Logics with Team Semantics -- 5.1 Syntax and Semantics -- 5.2 Frame Definability in Team Semantics -- 6 Conclusion -- A Modal Logic with Universal Modality -- B Goldblatt-Thomason Theorem -- C Modal Logics with Team Semantics -- References -- An Epistemic Separation Logic -- 1 Introduction -- 2 An Epistemic Separation Logic -- 3 Modelling with Epistemic Separation Logic -- 4 A Tableaux Calculus for Epistemic Separation Logic -- 5 Conclusion -- References -- Equational Properties of Stratified Least Fixed Points (Extended Abstract) -- 1 Introduction -- 2 Categories of Stratified Complete Lattices -- 3 Stratified Least Fixed Points -- 4 The Cartesian Fixed Point Identities -- 5 Appendix -- References -- The p-adic Integers as Final Coalgebra -- 1 Introduction -- 2 The Final Fp-coalgebra -- 3 The Addition and the Multiplication in p -- 3.1 The Addition in p -- 3.2 The Multiplication in p -- References -- Author Index