Logic and Its Applications Front Cover

Logic and Its Applications

  • Length: 239 pages
  • Edition: 1st ed. 2017
  • Publisher:
  • Publication Date: 2016-12-06
  • ISBN-10: 3662540681
  • ISBN-13: 9783662540688
Description

Logic and Its Applications: 7th Indian Conference, ICLA 2017, Kanpur, India, January 5-7, 2017, Proceedings (Lecture Notes in Computer Science)
This book collects the refereed proceedings of the 7th Indian Conference on Logic and Its Applications, ICLA 2017, held in Mumbai, India, in January 2017. The volume contains 13 full revised papers along with 4 invited talks presented at the conference.

 The aim of this conference series is to bring together researchers from a wide variety of fields in which formal logic plays a significant role. Areas of interest include mathematical and philosophical logic, computer science logic, foundations and philosophy of mathematics and the sciences, use of formal logic in areas of theoretical computer science and artificial intelligence, logic and linguistics, and the relationship between logic and other branches of knowledge. Of special interest are studies in systems of logic in the Indian tradition, and historical research on logic.

Table of Contents

Chapter 1. Conversation and Games
Chapter 2. Ramsey Theory on Trees and Applications
Chapter 3. Automata, Logic and Games for the -Calculus
Chapter 4. Semantics and Proof Theory of the Epsilon Calculus
Chapter 5. Neighbourhood Contingency Bisimulation
Chapter 6. The Complexity of Finding Read-Once NAE-Resolution Refutations
Chapter 7. Knowing Values and Public Inspection
Chapter 8. Random Models for Evaluating Efficient Büchi Universality Checking
Chapter 9. A Substructural Epistemic Resource Logic
Chapter 10. Deriving Natural Deduction Rules from Truth Tables
Chapter 11. A Semantic Analysis of Stone and Dual Stone Negations with Regularity
Chapter 12. Achieving While Maintaining:
Chapter 13. Peirce’s Sequent Proofs of Distributivity
Chapter 14. On Semantic Gamification
Chapter 15. Ancient Indian Logic and Analogy
Chapter 16. Definability of Recursive Predicates in the Induced Subgraph Order
Chapter 17. Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic

To access the link, solve the captcha.