Logic and Its Applications

10th Indian Conference, ICLA 2023, Indore, India, March 3¿5, 2023, Proceedings
Herausgegeben:Banerjee, Mohua; Sreejith, A. V.

• Broschiertes Buch

Produktbeschreibung

Edited in collaboration with FoLLI, this book constitutes the refereed proceedings of the 10th Indian Conference on Logic and Its Applications, ICLA 2023, which was held in Indore, India, in March 2023.

Besides 6 invited papers presented in this volume, there are 9 contributed full papers which were carefully reviewed and selected from 18 submissions. The volume covers a wide range of topics. These topics are related to modal and temporal logics, intuitionistic connexive and imperative logics, systems for reasoning with vagueness and rough concepts, topological quasi-Boolean logic and quasi-Boolean based rough set models, and first-order definability of path functions of graphs.

Produktdetails

• Lecture Notes in Computer Science 13963
• Verlag: Springer / Springer Nature Switzerland / Springer, Berlin
• Artikelnr. des Verlages: 978-3-031-26688-1
• 1st ed. 2023
• Seitenzahl: 236
• Erscheinungstermin: 15. Februar 2023
• Englisch
• Abmessung: 235mm x 155mm x 13mm
• Gewicht: 365g
• ISBN-13: 9783031266881
• ISBN-10: 3031266889
• Artikelnr.: 67271523

Inhaltsangabe

A Note on the Ontology of Mathematics.- Boolean Functional Synthesis: From Under the Hood of Solvers.- Labelled Calculi for Lattice-based Modal Logics.- Two Ways to Scare a Gruffalo.- Determinacy Axioms and Large Cardinals.- Big ideas from logic for mathematics and computing education.- Modal Logic of Generalized Separated Topological Spaces.- Multiple-valued Semantics for Metric Temporal Logic.- Segment transit function of the induced path function of graphs and its first-order definability.- Fuzzy Free Logic with Dual Domain Semantics.- A New Dimension of Imperative Logic. -Quasi-Boolean based models in Rough Set theory: A case of Covering.- Labelled calculi for the logics of rough concepts.- An Infinity of Intuitionistic Connexive Logics.- Relational Semantics for Normal Topological Quasi-Boolean Logic.