Programme
The times
mentioned below are all in Indian Standard Time (IST).
IST = GMT + 5 hours 30 minutes (e.g., 1400 IST = 0830 GMT).
March 4, 2021 (Thursday) 

14:00  15:00 
Invited talk: Agata Ciabattoni
(Bio)
Agata Ciabattoni is Full Professor at the Faculty of Informatics of the Vienna University of Technology.
In 2011 she has been awarded a START prize, the highest Austrian award for early career researchers,
for her project None classical proofs: Theory, Applications and Tools.
Normative reasoning
in Mīmāṃsā: A deontic logic approach
Normative statements, which involve concepts such as obligation and prohibition, are
enormously important in a variety of fields—from law and ethics to artificial intelligence.
Reasoning with and about them requires deontic logic, which is a quite recent area of
research. By contrast, for more than two millennia, one of the most important systems of
Indian philosophy focused on analyzing normative statements. Mīmāṃsā, as it is called,
looks at these statements found in the Vedas, the sacred texts of Hinduism, and interprets
them by explaining precisely what course of action they require. In my talk I will discuss
connections and synergies between Mīmāṃsā and deontic logic. The results I am going to
present arise from a collaboration between logicians, sanskritists and computer scientists.
(Slides)
Chair: S P Suresh

15:00  15:30 
BREAK and Meet on Gather

15:30  17:00 
Panel on logic education
Moderator:
Serafina Lapenta
(Bio)
Serafina Lapenta obtained her PhD in mathematical logic in 2015 under the supervision
of Antonio Di Nola. Her research activity mainly focuses on manyvalued logic, working on
Łukasiewicz logic from the different points of view given by functional analysis, polyhedral geometry,
decision theory and general algebra. She is currently a researcher at University of Salerno,
working on the project "A logical approach to probability". She has also been involved in outreaching
activities, aimed at general public and high school students, focusing on the logical aspects of
teaching mathematics.
Other Panelists:
 Viviane DurandGuerrier
(Bio):
Viviane DurandGuerrier is an Emeritus Professor at the University of Montpellier (France).
She is a member of the IMAG (Institut Montpelliérain Alexander Grothendieck). Her main research interest
is the study of the relationships between logic, language, argumentation, proof and mathematics teaching
and learning from primary school to university. She is the coordinator of the INDRUM network (International
Network for Didactic Research in University Mathematics).
The place of logic in school curricula and advocacy for logic at school
A common view is that the learning of mathematics at school is sufficient
to develop the logical skills required by advanced mathematics studies.
However there is research basedevidence that it is not the case. On
another side, several authors acknowledge that teaching logic in separate
module does not necessarily improve students’ mathematical reasoning. This
lead to introduce elements of logic inside the mathematics curriculum and
to propose activities aiming to make students experience the intertwining
between mathematics contents and logical skills. I will provide some
examples of such activities, for class and for teacher training.
(Slides)
 François Schwarzentruber
(Bio):
TBA
Use of tools in teaching logic
Logic is the root of computer science and has many direct applications: database, program design and
verification, architecture, constraint solving, theorem proving, machine learning, etc. In this talk,
we will make a tour on existing tools that shows the applicability of logics, and thus could motivate
students to study logic. We then show how tools can be used for students to grasp theoretical foundations
of logic. We will then discuss some guidelines for the future of tools for teaching logic.
(Slides)
 John Slaney
(Bio):
TBA
Introductory logic: opportunity and challenge
This is a talk from my personal perspective, drawing on the experience of teaching elementary logic to university students.
One of the main pedagogic difficulties we face is the diversity of backgrounds of our students: it is hard to pitch
the course simultaneously to philosophy, mathematics and computing majors, and with the increasing popularity of logic
this diversity of backgrounds is also increasing. The online tool 'Logic for Fun’ is
intended to appeal to students across the range of disciplinary backgrounds, introducing them to the art of using the
resources of first order logic to express and solve problems. I describe the tool and report briefly on the experience
of using it over ten years of introductory logic courses.

17:00  17:30 
BREAK and Meet on Gather

17:30  18:30 
Invited talk: Thomas Schwentick
(Bio)
Thomas Schwentick works in several areas where Mathematical Logic
meets Computer Science, particularly in Database Theory.
He often studies questions that concern the expressiveness of logical
languages together with the computational complexity of related
algorithmic problems.
He has been a professor for Theoretical Computer Science at TU Dortmund
University (Germany) since 2005. He graduated in Mathematics at the
Johannes Gutenberg University in Mainz (Germany), where he also finished his PhD and his
habilitation. Before he moved to his current position, he had
professor positions in Jena and Marburg. He currently serves as
president of the European Association for Computer Science Logic.
Dynamic Complexity: Basics and recent directions
In most reallife databases data changes frequently and thus makes efficient query
answering challenging. Auxiliary data might help
to avoid computing query answers from scratch all the time. One way to
study this incremental maintenance scenario is from the perspective of
dynamic algorithms with the goal to reduce (re) computation time.
Another option is to investigate it from the perspective of logic.
Since firstorder logic corresponds to the core of the standard
database query language SQL,
one naturally arrives at the question which queries can be
answered/maintained dynamically
with firstorder predicate logic (DynFO) [1,2]. This approach has
been termed "dynamic complexity" in the literature [1].
The talk gives an introduction into dynamic complexity and presents
and discusses old and recent methods and results [3,4,5,6,7,8].
[1] Sushant Patnaik and Neil Immerman. DynFO: A parallel, dynamic
complexity class. J. Comput. Syst. Sci., 55(2):199209, 1997.
[2] Guozhu Dong and Jianwen Su. Incremental and decremental
evaluation of transitive closure by firstorder queries. Inf.
Comput., 120(1):101106, 1995.
[3] Samir Datta, Raghav Kulkarni, Anish Mukherjee, Thomas
Schwentick, Thomas Zeume:
Reachability Is in DynFO. J. ACM 65(5): 33:133:24 (2018)
[4] Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Dynamic Complexity under Definable Changes. ACM Trans. Database
Syst. 43(3): 12:112:38 (2018)
[5] Samir Datta, Anish Mukherjee, Thomas Schwentick, Nils Vortmeier,
Thomas Zeume:
A Strategy for Dynamic Programs: Start over and Muddle through. ICALP
2017.
[6] Samir Datta, Anish Mukherjee, Nils Vortmeier, Thomas Zeume:
Reachability and Distances under Multiple Changes. ICALP 2018: 120:1120:14
[7] Thomas Schwentick, Nils Vortmeier, Thomas Zeume:
Sketches of Dynamic Complexity. SIGMOD Rec. 49(2): 1829 (2020)
[8] Jonas Schmidt, Thomas Schwentick, Till Tantau, Nils Vortmeier,
Thomas Zeume: Worksensitive Dynamic Complexity of Formal Languages. CoRR
abs/2101.08735 (2021), to appear in FoSSaCS 2021
(Slides)
Chair: Anuj Dawar

18:30  20:30 
BREAK and Meet on Gather

20:30  21:30 
Invited talk: Adnan Darwiche
(Bio)
Adnan Darwiche is a professor and former chairman of the computer science department at UCLA. He directs the
Automated Reasoning Group, which focuses on symbolic and probabilistic reasoning and their applications to machine
learning. Professor Darwiche is Fellow of AAAI and ACM. He is a former editorinchief of the Journal of Artificial
Intelligence Research (JAIR) and author of "Modeling and Reasoning with Bayesian Networks," by Cambridge University
Press. His group’s YouTube Channel can be found here.
Reasoning about what was learned
The traditional role of logic in AI has been to represent and reason with categorical
knowledge about the world, putting it in competition with other formalisms such as
probabilistic reasoning that deals with uncertainty and machine learning that relies on
learning from data instead of explicit knowledge. The landscape has been changing recently
with logic playing a broader role that complements these formalisms. For example, logic and
symbolic manipulations have been providing a computational foundation for probabilistic
reasoning and new approaches have been emerging for learning from a combination of
categorical knowledge and data. In this talk, I will briefly review these additional roles and
then focus on the use of logic for meta reasoning about what was learned. This role of logic
has been facilitated by new advances that compile the inputoutput behavior of some
machine learning systems into logical representations, allowing one to explain the decisions
made by these systems, reason about their robustness and validate some of their properties
(e.g., whether they are biased or monotonic).
(Slides)
Chair: Wiebe van der Hoek

March 5, 2021 (Friday) 

14:00  15:00 
Invited talk: Marta Kwiatkowska
(Bio)
Marta Kwiatkowska is Professor of Computing Systems and Fellow of Trinity College, University of Oxford. She is known
for fundamental contributions to the theory and practice of model checking for probabilistic systems, focusing on
automated techniques for verification and synthesis from quantitative specifications. She led the development
of the PRISM model checker, the leading software tool in the area and winner of the HVC
Award 2016. Probabilistic model checking has been adopted in diverse fields, including distributed computing, wireless
networks, security, robotics, healthcare, systems biology, DNA computing and nanotechnology, with genuine flaws found and
corrected in realworld protocols. Kwiatkowska is the first female winner of the Royal Society Milner Award, winner of
the BCS Lovelace Medal and was awarded an honorary doctorate from KTH Royal Institute of Technology in Stockholm.
She won two ERC Advanced Grants, VERIWARE and FUN2MODEL, and is a coinvestigator of the EPSRC
Programme Grant on Mobile Autonomy. Kwiatkowska is a Fellow of the Royal Society, Fellow of ACM, EATCS and BCS, and
Member of Academia Europea.
Probabilistic model checking for strategic equilibriabased decision making
Software faults have plagued computing systems since the early days,
leading to the development of methods based on mathematical logic, such
as proof assistants or model checking, to ensure their correctness. The
rise of AI calls for automated decision making that incorporates
strategic reasoning and coordination of behaviour of multiple autonomous
agents acting concurrently and in presence of uncertainty. Traditionally, gametheoretic
solutions such as Nash equilibria are employed to analyse strategic interactions between
multiple independent entities, but model checking tools for scenarios exhibiting concurrency,
stochasticity and equilibria have been lacking.
This lecture will focus on a recent extension of probabilistic model checker
PRISMgames, which supports quantitative reasoning and strategy
synthesis for concurrent multiplayer stochastic games against temporal logic that can express
coalitional, zerosum and equilibriabased properties. Gametheoretic models arise naturally
in the context of autonomous computing infrastructure, including usercentric networks,
robotics and security. Using illustrative examples, this lecture will give an overview of recent
progress in probabilistic model checking for stochastic games and highlight challenges and
opportunities for the future.
(Slides)
Chair: Prakash Saivasan

15:00  15:30 
BREAK and Meet on Gather

15:30  17:00 
Contributed talks
 Isabella McAllister and Patrick Girard. AGM Belief Revision About Logic
(Slides)
 Abhisekh Sankaran. FefermanVaught decomposition for prefix classes of first order logic
(Slides)
 Sayantan Roy. On the Characterizations of Tarskitype and Lindenbaumtype Logical Structures
(Slides)
 Antonio Di Nola, Serafina Lapenta and Giacomo Lenzi. Dualities and logical aspects of Baire functions
(Slides)
 Nikolay Bazhenov. On computabilitytheoretic properties of Heyting algebras
(Slides)
 Sreehari K and Kamal Lodaya. Plenitude
(Slides)
Chair: Sourav Chakraborty

17:00  17:30 
BREAK and Meet on Gather

17:30  18:30 
Contributed talks
 Jie Fan, Davide Grossi, Barteld Kooi, Xingchi Su and Rineke Verbrugge. Commonly Knowing Whether
(Slides)
 Hans van Ditmarsch, Didier Galmiche and Marta Gawek. An Epistemic Separation Logic with
Action Models
(Slides)
 Masanobu Toyooka and Katsuhiko Sano. Analytic MultiSuccedent Sequent Calculus for
Combining Intuitionistic and Classical Propositional Logic
(Slides)
 Santiago Jockwich Martinez, Sourav Tarafder and Giorgio Venturi. Quotient models for a class of nonclassical set theories
(Slides)
Chair: Md. Aquil Khan

18:30  20:30 
BREAK and Meet on Gather

20:30  21:30 
Invited talk: Julia Knight
(Bio)
Julia Knight grew up in Logan, Utah. When she was in her first year of high school, in 1957, Russia gave to the scientific
community in the U.S. a huge gift — Sputnik. Suddenly, funding increased, and everyone with interest and ability in
science and mathematics was encouraged to study these things. She majored in mathematics at Utah State. For
graduate school, she went to Berkeley, a tremendously exciting place for mathematics, and for the social atmosphere. Her
advisor was Robert Vaught. Julia Robinson was also a mentor. She started off in model theory. As a model theorist,
Julia Knight especially liked problems that involved constructing models. Later, she switched to computability theory. She
still likes problems that involve constructing models. She has been on the faculty at Notre Dame since 1977. She has
been an advisor to 18 students who have completed the PhD, with one more likely to finish next year. During the past 20
years, she has been involved in a series of NSF grants aimed at fostering collaboration among researchers in computability
from the U.S., Russia, Kazakhstan, and, more recently, Bulgaria. The joint work that has resulted from these grants, and
the friendships that she now has with international collaborators, mean a great deal to her. She is the current president of
Association for Symbolic Logic.
Describing structures and classes of structures
The talk will provide an overview of notions and results related to the following:
 describing a specific countable structure, up to isomorphism,
 describing a class of countable structures, closed under isomorphism,
 classifying the members of a given class, giving invariants that distinguish the members
from each other, up to isomorphism.
The notions and results will all be illustrated with examples involving familiar kinds of
mathematical structures  groups, fields, graphs.
(Slides)
Chair: Amit Kuber

March 6, 2021 (Saturday) 

14:00  15:00 
Invited talk: Hans van Ditmarsch
(Bio)
Hans van Ditmarsch is a senior researcher at CNRS (the French National Research Organization), and based at LORIA in
Nancy, where he is heading the research team CELLO (Computational Epistemic Logic in LOrraine). He has for a long time
been affiliated to IMSc (Institute for Mathematical Sciences), in Chennai. His research is on the dynamics of knowledge
and belief, informationbased security protocols, modal logics, and combinatorics. He has been the recipient of an ERC
(European Research Council) starting grant Epistemic Protocol Synthesis, and he has been an editor of the Journal of
Philosophical Logic. He is an author of 'Dynamic Epistemic Logic', an editor of the 'Handbook of Epistemic Logic', and an
author of the puzzle book 'One Hundred Prisoners and a Light Bulb'.
Dynamic epistemic logic for distributed computing  asynchrony and concurrency
We will present some recent work on asynchrony and concurrency in dynamic epistemic
logics (DEL), building on foundations in distributed computing and combining threads in
dynamic logics and temporal epistemic logics. One way to model asynchrony in DEL is to
reasoning over histories of actions of different length. Within DEL there has been work on
asynchronous protocolgenerated forests along different depths of trees (older work by
Witzel and others, recent work by Pinchinat and others), and hovering in between DEL and
PDL there is more recent work applied to gossip protocols by Apt and others, and vD and
others. An entirely different emerging thread involving histories of different length is within
combinatorial topology, namely DELmotivated modellings of algorithms in distributed
computing such as the immediate snapshot algorithm, by Rajsbaum and others. A different
kind of DEL asynchrony involves separating in the logical language the sending and
receiving of messages, such as announcements. We present recent proposals by Knight and
others, and Balbiani and others. Topics of interest there are axiomatization, reduction
(elimination of dynamic modalities) and complexity, and also generalizations to
communications between intersecting subgroups of agents building on older work involving
Mukund, and Ramanujam. A modelling solution wherein knowing a proposition is
identified with acknowledging receipt can be demonstrated by, what else, the Muddy
Children problem. Finally, the Muddy Children problem also perfectly illustrates issues with
concurrency in DEL: the action of n muddy children not stepping forward because none of
them know whether they are muddy, is always modelled as the public announcement of a
conjunction with n conjuncts. Should this not be a concurrent action with n components?
(Slides)
Chair: Helle Hvid Hansen

15:00  15:30 
BREAK and Meet on Gather

15:30  17:00 
Panel on logic and experimental studies:
A new paradigm or contradiction in terms?
Moderator:
Torben Braüner
(Bio)
Torben Braüner is professor (mso) in Computer Science at Roskilde University, Denmark.
He received the Danish higher doctorate dr.scient. 2009. PhD in Computer Science 1996 from University of Aarhus.
His main research interest is logic and the application of logic in computing as well as philosophy and psychology.
He is particularly interested in nonclassical logics (mainly modal and hybrid logics). He has received grants from the Danish Natural
Science Research Council and the Velux Foundation.
(Slides)
Other Panelists:
 Nina Gierasimczuk
(Bio):
Nina Gierasimczuk, Ph.D., is an Associate Professor in Logic at the Department of
Applied Mathematics and Computer Science (Technical University of Denmark) and a
Visiting Fellow at the Institute for Logic, Language and Computation (University of
Amsterdam). Her main research interests lie in the logical aspects of learning in
both single and multiagent context, and involve learning theory, modal logic, and
computability theory. Her current projects focus on symbolic learning in artificial intelligence
in the context of action models, belief revision, multiagent systems, and social networks.
She is also interested in the coordination mechanisms involved in natural language evolution
and in the role of logic and logical modelling in cognitive science. For more information see her
website: http:/ninagierasimczuk.com/
Approximate number sense and semantic universals: an experimental simulation
study
Languages vary in their systems of categories but the variation is constrained by several
welldefined properties called universals. Explanations thereof have been sought in universal
constraints of human cognition, communication, complexity, and pragmatics. In this walk we
examine whether the perceptual constraints of approximate number sense (ANS) contribute to the
development of two universals in the semantic domain of quantities: monotonicity and convexity.
Using a stateoftheart multiagent languagecoordination model, with the perceptual layer of
agents substituted by the ANS, we evolve communicatively usable quantity terminologies. We compare
the degrees of convexity and monotonicity of languages evolving with and without ANS. The results
suggest that ANS supports the development of monotonicity and, to a lesser extent, convexity. This
is a joint work with Dariusz Kalociński, Franciszek Rakowski and Jakub Uszyński. It was generously
supported by N.G.’s National Science Centre Poland grant no. 2015/19/B/HS1/03292.
(Slides)
 Paula Quinon
(Bio):
Paula Quinon is an assistant professor at the Department of Administration and Social Sciences
of the Warsaw University of Technology, affiliated with the Chair of Philosophy and Ethics in
Business and with International Center for Formal Ontology Paula Quinon's expertise includes
philosophy of mathematics, philosophy of language, epistemology, logic, and cognitive
science; she also holds a Master of Fine Arts degree.
Her research is in the philosophy of mathematics, in particular she studies the concept
of natural number and other arithmetic concepts such as "arithmetic function", "recursive
function", "computation", "computability", "encoding", "equality", "identity", and "infinity".
For example, according to computational structuralism, to formulation of which Paula Quinon
contributed significantly in her PhD, Tennenbaum’s theorem suggests that the concept of natural
number and the concept of computation are strongly and inextricably intertwined.
The core cognition paradigm and foundations of logic, arithmetic, and computation
Spelke in “Core knowledge” (2000) put forward the idea that complex cognitive skills and concepts
can be based on a set of “building block” systems (called also “core knowledge” or “core cognition”
systems) that emerge early in human ontogeny, play an important role in phylogeny of concepts, and
are detected in nonhuman animals. Humans combine representations from these systems and build new
complex concepts. I call the “core cognition paradigm” a framework that commits to the view that the
conceptual content of a concept is scaffolded on core cognition.
The concept of natural number has been studied extensively within this paradigm and it has been
established that the ability to subitize up to four elements, the ability to approximate quantities
without counting, and the counting routine, play important roles in the formation and acquisition of
the concept of natural number. A similar endeavor is currently being undertaken with respect to
logically complex representations (such as logical connectives, logical rules, or quantifiers) and
to computational representations (such as computable functions).
Regardless of which building blocks will be disclosed as playing a role in the formation of
mature complex representations, both in logic and in computation, it will be interesting to
answer the question of whether the core cognition paradigm can in any way help in understanding
the nuances of formal concepts.
 Niels Taatgen
(Bio):
Niels Taatgen is professor in Cognitive Modeling, and the director of the Bernoulli Institute for
Mathematics, Computer Science and Artificial Intelligence. His work focusses on building models of
human cognition in the areas of skill acquisition, time perception, multitasking and knowledge
transfer. He received and ERC startin grant on the topic of multitasking in 2012, and was elected
Teacher of the Year of the University of Groningen in 2015.
Cognitive architectures and predictive models
Cognitive architectures are formal systems that allow building simulations of human intelligent
behavior. They encompass constraints derived from human cognition, such as memory, attention and
decision making. Cognitive architectures are used to build cognitive models of particular
cognitive phenomena, either to explain existing empirical data, or to make predictions about
new data. I will illustrate this with an example in which we successfully predicted a bottleneck
in human multitasking.
(Slides)

17:00  17:30 
BREAK and Meet on Gather

17:30  18:30 
Contributed talks
 Harshit Bisht and Amit Kuber. Aggregating Relational Structures
(Slides)
 Patrick Blackburn, Torben Braüner and Julie Lundbak Kofod. A Note on Hybrid Modal Logic
with Propositional Quantifers
(Slides)
 Deepak D'Souza and Raveendra Holla. Equivalance of Pointwise and Continuous
Semantics of FO with Linear Constraints
(Slides)
 Deepak D'Souza and Raj Mohan Matteplackel. A ClockOptimal Hierarchical Monitoring
Automaton for MITL
(Slides)
Chair: Mohua Banerjee

18:30  20:30 
BREAK and Meet on Gather

20:30  21:30 
Music Session: Instrumental
 Hans van Ditmarsch on Cello
 François Schwartzentruber on Piano
 Sourav Tarafder on Ghatam
 Amit Kuber on Keyboard
Chair: Sujata Ghosh

March 7, 2021 (Sunday) 

14:00  15:00 
Invited talk: Maria Aloni
(Bio)
Maria Aloni is Associate Professor at the ILLC and Department of Philosophy of the University
of Amsterdam. Her primary research interests lie in the areas of formal semantics and pragmatics,
philosophical logic and philosophy of language. She was the PI of two Innovational Research
Incentives Scheme Projects (VENI and VIDI) funded by the Dutch Organization for Scientific
Research. Her VIDI project investigated indefinite forms crosslinguistically exploring the
hypothesis that their variety in meaning has emerged from historical processes of conventionalisation
of originally pragmatic inferences. She is associate editor of the Journal of Semantics, since 2009;
member of the editorial board of Semantics and Pragmatics, since 2007, and elected member of the
Academia Europaea in 2020. She also edited (with Paul Dekker) the Cambridge Handbook of Formal
Semantics, which appeared in 2016.
In 2001 her PhD thesis on quantification under conceptual covers won the E. W. Beth
Dissertation Prize awarded by the Association for Logic, Language and Information (FoLLI).
A logic for pragmatic intrusion
In a statebased modal logic, formulas are interpreted with respect to sets of possible
worlds rather than individual worlds. In my talk I will present a bilateral version of a
statebased modal logic motivated by linguistic phenomena at the semanticspragmatics interface,
including phenomena of free choice.
In free choice inferences conjunctive meanings are derived from disjunctive sentences contrary
to the prescriptions of classical logic:
You may eat pizza or pasta => You may eat pizza and you may eat pasta.
Free choice inferences present a challenge to the canonical divide between semantics and pragmatics.
They are not validities in classical modal logic and although they are derivable by conversational principles,
they lack other characteristic properties of canonical pragmatic inferences, they are often noncancellable,
they are sometimes embeddable and their processing time has been shown to equal that of literal interpretations.
In my bilateral statebased modal logic free choice and related inferences are derived by allowing pragmatic
principles intrude in the recursive process of meaning composition. Contrary to most existing accounts where
free choice inferences are viewed as special cases of quantity implicatures, the relevant pragmatic principle in our
logicbased approach will be a version of Grice's Maxim of Quality.
(Slides)
Chair: Fenrong Liu

15:00  15:30 
BREAK and Meet on Gather

15:30  16:30 
Invited talk: Nick Bezhanishvili
(Bio)
Nick Bezhanishvili obtained his PhD in 2006 from the ILLC (Institute for Logic, Language and Computation),
University of Amsterdam, under the supervision of Professors Dick de Jongh and Yde Venema. He held postdoctoral
positions at the University of Leicester (20062008), Imperial College London (20082012), and Utrecht University (20122013).
Since 2014, Nick holds an Assistant Professorship at the ILLC. He is currently the president of the Dutch Association for
Logic and Philosophy of Sciences. Nick has more than 80 publications in the top journals, refereed conference proceedings,
and book chapters in his area of research, which is centered on applications of algebraic and topological methods in the study of
nonclassical logics (such as modal and intuitionistic logics). An important feature of this work is the theory of Stonelike dualities,
which gives rise to topological and geometric semantics for intuitionistic and modal logics.
Polyhedral modal logic
Spatial logic studies various spatial structures though the prism of logic. The celebrated McKinseyTarski
theorem states that if we interpret modal diamond as closure and hence modal box as interior, then S4 is the
modal logic of any denseinitself metric space. In particular, this implies that the modal logic of each
Euclidean space is S4. However, we can distinguish the logics of Euclidean spaces of different dimensions by
restricting the valuation to polyhedral subsets, resulting in polyhedral semantics of modal logic. In this talk
I will discuss this semantics in detail including some recent axiomatization and completeness results. I will also
review some applications of this approach.
(Slides)
Chair: Soma Dutta

16:30  17:00 
Contributed talks (Poster Session)
 Purbita Jana. LTopology via Generalised Geometric Logic
(Poster)
 Jieting Luo, Beishui Liao and JohnJules Meyer. Reasoning about the Robustness of Selforganizing
Multiagent Systems (WIP)
(Poster)
 Anantha Padmanabha. Relative Expressive Powers of First Order Modal Logic and Term Modal Logic
(Poster)
 Bama Srinivasan and Ranjani Parthasarathi. Multiple Task Specification inspired from Mīmāṃsā for
Reinforcement Learning Models (Work in Progress)
(Poster)

17:00  17:30 
BREAK and Meet on Gather

17:30  18:30 
ALI General Body Meeting
Chair: Sanjiva Prasad

18:30  19:15 
Contributed talks
 Prosenjit Howlader and Mohua Banerjee. Double Boolean Algebras with Operators
(Slides)
 Kaibo Xie and Jialiang Yan. A Logic for Instrumental Desire
(Slides)
 Rohit Parikh. Covid19 and Knowledge Based Computation
(Slides)
Chair: Kamal Lodaya

19:15  20:30 
BREAK and Meet on Gather

20:30  21:30 
Music Session: Vocal
 Soma Dutta
 Amit Kuber
 Mohua Banerjee
 Abhisekh Sankaran
Chair: R. Ramanujam


News and updates
