Logic and Its Applications: 7th Indian Conference, ICLA 2017, Kanpur, India, January 5-7, 2017, Proceedings

by Sujata Ghosh (Editor), Sanjiva Prasad (Editor)

Overview

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.

Product Details

ISBN-13:	9783662540695
Publisher:	Springer-Verlag New York, LLC
Publication date:	12/25/2016
Series:	Lecture Notes in Computer Science , #10119
Sold by:	Barnes & Noble
Format:	eBook
File size:	10 MB

Table of Contents

Conversation and Games.- Ramsey Theory on Trees and Applications.- Automata, Logic and Games for the Lambda Calculus.- Semantics and Proof Theory of the Epsilon Calculus.- Neighbourhood Contingency Bisimulation.- The Complexity of Finding Read-Once NAE-Resolution Refutations.- Knowing Values and Public Inspection.- Random Models for Evaluating Efficient Büchi Universality Checking.- A Substructural Epistemic Resource Logic.- Deriving Natural Deduction Rules from Truth Tables.- A Semantic Analysis of Stone and dual Stone Negations with Regularity.- Achieving while maintaining: A logic of knowing how with intermediate constraints.- Peirce’s Sequent Proofs of Distributivity.- On Semantic Gamification.- Ancient Indian Logic and Analogy.- Definability of Recursive Predicates in the Induced Subgraph Order.- Computational Complexity of a Hybridized Horn Fragment of Halpern-Shoham Logic.