Webinars
25 October 2021, 7:00 pm IST, Prof. Shashi Mohan Srivastava, Indian Association for the Cultivation of Science (IACS), Kolkata, India.
Title: Overview of Forcing (Talk 1)
Video is available here
1 November 2021, 7:00 pm IST, Prof. Shashi Mohan Srivastava, Indian Association for the Cultivation of Science (IACS), Kolkata, India.
Title: Overview of Forcing (Talk 2)
Young Researcher's Talk
For this semester we are beginning with a short series by young researchers in logic and related areas. We sincerely hope that more young researchers will show their interests to present their work on this platform and the experts in this field will provide encouragement and their valuable suggestions to them.
Talk 1
20 August 2021, 7:00pm IST, Mr. Anand Tadipatri, IISER Pune, India
Title: A glimpse into Type Theory
Abstract: Type Theory, a system that first arose in attempts to avoid paradoxes of naive Set Theory, is an alternative foundation of mathematics. The subject has been developed and refined over the years, and some versions of Type Theory have been found to be highly suitable for building proof-checkers.
In this talk, I will give a brief overview of the Calculus of Inductive Constructions, the type-theoretic framework underlying the proof assistant LEAN. I intend to focus on the several ways in which Type Theory is distinct from Set Theory, such as in the ability to encode proofs and logical operators within the system, and demonstrate some of these aspects using the LEAN theorem prover.
Talk 2
27 August 2021, 7:00pm IST, Mr. Ramit Das, IMSc. Chennai, India
Title: A logical description of strategizing in social network games
Abstract: In social network games, players are connected by a social network graph, and payoffs for players are determined by choices of players in their neighbourhood. We consider improvement dynamics of such games. We propose a modal logic for reasoning about strategies in these games. Within the logic, notions like Nash equilibrium and (weak) finite improvement property are easily defined. We show that the logic is decidable and that the valid formulas admit a complete axiomatization.
Talk 3
17 September 2021, 7:00pm IST, Mr. Sayantan Roy, IIIT-Delhi, India
Title: Lindenbaum-type Logical Structures: Introduction and Characterization
Abstract: In this talk, I will describe some classes of logical structures from the universal logic standpoint, viz., those of the previously known Tarski-type, and the new Lindenbaum-type logical structures defined. The characterization theorems for these logical structures have been proved as well. The following natural questions have been dealt with next. Is every Tarski-type logical structure also of Lindenbaum-type and/or vice-versa? Finally, we study the logical structures that are both of Tarski- and Lindenbaum-type, or of TL-type and end with a characterization and a representation theorem for these.
Talk 4
24 September 2021, 6:30pm IST, Mr. Arko Ghosh, University of Warsaw, Poland
Title: Computation with infinite sets
Abstract: In this talk I will discuss an approach to extend classical models of computation to work on infinite structures which are finite upto certain symmetries. I will define what these structures are, and then discuss why computations with them is an interesting topic. It will be an introductory talk. I will explain a few definitions, give some examples, and mention some results without going deep into their proofs.
Talk 5
1 October 2021, 7:00pm IST, Mr. Shreyas Gupta, IISc Bengaluru, India
Title: Modal logics of structural changes in graphs: A bisimulation study
Abstract: We discuss modal operators of link deletion and point deletion on graphs. After giving a brief overview of existing results, we focus on the corresponding notions of bisimulation. We provide characterizations of the bisimulations in terms of model checking in the respective logics. We then move on to the algorithmic study of the same.
Talk 6
(TBA) Mr. Arunavo Ganguly