Logic and Its Applications 8th Indian Conference, ICLA 2019, Delhi, India, March 1-5, 2019, Proceedings

• Main Authors: Khan, Aquil, Manuel, Amaldev
• Format: eBook
• Language: English
• Published: Netherlands Springer Nature 2019; Springer Berlin / Heidelberg; Springer
• Edition: 1
• Series: LNCS sublibrary. SL 1, Theoretical computer science and general issues
• Subjects: Logic, Symbolic and mathematical-Congresses; Mathematics. General principles
• ISBN: 3662587718; 9783662587713; 366258770X; 9783662587706

This book collects the refereed proceedings of the 8th Indian Conference on Logic and Its Applications, ICLA 2019, held in Delhi, India, in March 2019. The volume contains 13 full revised papers along with 6 invited talks presented at the conference.  The aim of this conference series is to bring to...

Table of Contents:

• Intro -- Preface -- Organization -- Short Papers -- On the Average Complexity of SAT -- What Did Tarski Have in Mind with Elementary Geometry and Its Decidability?Ž -- Contents -- Unification in Modal Logic -- References -- Propositional Modal Logic with Implicit Modal Quantification -- 1 Introduction -- 2 Implicitly Quantified Modal Logic (IQML) -- 3 IQML Bisimulation and Elementary Equivalence -- 4 Bisimulation Games and Invariance Theorem -- 5 Satisfiability Problem -- 6 Discussion -- References -- Infinite Liar in a (Modal) Finitistic Setting -- 1 Introduction -- 2 Arithmetization of Yablo Sentences -- 3 Potentially Infinite Domains and sl-Semantics -- 4 Modal Finitistic Semantics -- 5 Yablo Sequences and Modal Interpretation of Quantifiers -- References -- The Finite Embeddability Property for Topological Quasi-Boolean Algebra 5 -- 1 Introduction -- 2 Some Basic Definitions -- 3 Sequent Calculus of tqBa5 -- 4 FEP for tqBa5 -- 5 Concluding Remarks -- References -- Specifying Program Properties Using Modal Fixpoint Logics: A Survey of Results -- 1 The Modal -Calculus -- 2 Higher-Order Fixpoint Logic -- 2.1 Results on HFL -- References -- A Modal Aleatoric Calculus for Probabilistic Reasoning -- 1 Introduction -- 2 Related Work -- 3 Syntax and Semantics -- 3.1 Syntax -- 3.2 Semantics -- 3.3 Example -- 4 Axioms for the Modal Aleatoric Calculus -- 4.1 The Aleatoric Calculus -- 4.2 The Modal Aleatoric Calculus -- 5 Expressivity -- 6 Case Study -- 7 Conclusion -- References -- Public Announcements for Epistemic Models and Hypertheories -- 1 Introduction -- 2 Epistemic Models and Hypertheories -- 3 Public Announcements -- 4 The Case of Knowledge Change in Epistemic Models -- 5 Conclusion -- References -- Revisiting the Generalized Łoś-Tarski Theorem -- 1 Introduction -- 2 Preliminaries and Background -- 2.1 The Generalized Łoś-Tarski Theorem
• 2 Terminology -- 3 Congruences of Terms -- 4 Transfer Functions -- 5 Indefinite Assignment -- 6 Data Flow Analysis Frameworks -- 7 Herbrand Equivalence -- 8 MOP Characterization -- 9 Conclusion -- References -- Logic Without Language -- 1 Davidson on Animals -- 2 But Is Davidson Correct? -- 3 Introduction -- 4 Agent? Or Machine? -- 5 Two Computer Scientists Respond -- 6 And a Psychologist Offers His View -- 7 Umwelts -- 8 A Little Bit of Mathematics -- 9 Uninformed Agent -- 10 Better Informed Agent -- 11 Learning More -- 12 Symbiosis -- 13 Animal Logic -- 14 A General Framework: Theories Enter -- 15 The Usefulness of a Theory -- 16 Can Logic Exist Without Language? -- 17 Conclusion -- References -- Towards a Constructive Formalization of Perfect Graph Theorems -- 1 Introduction -- 2 Overview of Lovász Replication Lemma -- 3 Modeling Finite Simple Graphs -- 3.1 Vertices as Constructive Sets -- 3.2 Decidable Edge Relation -- 3.3 Graph Isomorphism -- 3.4 Graph Constructions -- 4 Constructive Proof of Lovász Replication Lemma -- 5 Conclusions and Future Work -- References -- Author Index
• 3 A New Proof of GLT(k) -- 4 A Stronger Failure of Łoś-Tarski Theorem in the Finite -- 5 Conclusion and Future Directions -- References -- Model Theory for Sheaves of Modules -- 1 Introduction -- 2 Model Theory for Modules -- 3 Presheaves and Sheaves of Modules -- 4 Model Theory for Presheaves of Modules -- 5 Model Theory for Sheaves of Modules -- References -- Transitivity and Equivalence in Decidable Fragments of First-Order Logic: A Survey -- 1 Introduction -- 2 The Two-Variable Fragment and its Relatives -- 3 Transitivity and Equivalence -- References -- The Undecidability of FO3 and the Calculus of Relations with Just One Binary Relation -- 1 Introduction -- 2 FO3 and the Calculus of Relations -- 2.1 Elimination of Relational Converse (Using the Identity Relation) -- 2.2 Elimination of the Identity Relation -- 3 Reductions to the One Binary Relation Case -- 3.1 A Conservative Reduction Using Identity -- 3.2 A Conservative Reduction Not Using Identity -- 4 Conclusion -- References -- Satisfaction Classes via Cut Elimination -- 1 Introduction -- 2 Preliminaries -- 3 From Consistent M-Logic to a Truth Class -- 4 Consistency of M-Logic -- References -- Sequent Calculi for Normal Update Logics -- 1 Introduction -- 2 Preliminaries -- 3 Sequent Calculi for Normal Update Logics -- 4 Subformula Property and Decidability -- References -- Logics for Rough Concept Analysis -- 1 Introduction -- 2 Preliminaries -- 3 Motivation: Kent's Rough Concept Analysis -- 4 Kent Algebras -- 5 Multi-type Presentation of Kent Algebras -- 6 Multi-type Calculi for the Logics of Kent Algebras -- A Properties -- A.1 Soundness for Perfect HK Algebras -- A.2 Completeness -- A.3 Conservativity -- A.4 Cut Elimination and Subformula Property -- References -- A Fix-Point Characterization of Herbrand Equivalence of Expressions in Data Flow Frameworks -- 1 Introduction