Survey
* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download An Introduction to Lower Bounds on Formula
Document related concepts
Foundations of mathematics wikipedia , lookup
History of logic wikipedia , lookup
Quantum logic wikipedia , lookup
Interpretation (logic) wikipedia , lookup
Law of thought wikipedia , lookup
Propositional calculus wikipedia , lookup
Natural deduction wikipedia , lookup
Mathematical logic wikipedia , lookup
Laws of Form wikipedia , lookup
Intuitionistic logic wikipedia , lookup
Transcript
Second International Conference “Mathematics Days in Sofia” July 10–14, 2017, Sofia, Bulgaria An Introduction to Lower Bounds on Formula-size in Modal Logic Petar Iliev Institute de Recherche en Informatique de Toulouse, France [email protected] Keywords: Modal logic, lower bounds on formula-size, succinctness I am going to present a number of recent results and open questions related to the problem of proving lower bounds on the size of modal formulae defining properties of Kripke frames and models. To put things in perspective, I am going to start by giving an informal overview of some techniques used for proving lower bounds on the size of Boolean formulae and then I am going to show how to extend and apply them in the modal case where we have obtained a number of succinctness results for various modal logics. This is going to be an informal introduction to the area starting from first principles. Thus, the only real prerequisite for grasping the main ideas is familiarity with propositional truth-tables and Kripke models. Acknowledgements. The results presented in this talk have been obtained in collaboration with various people from the following list: Hans van Ditmarsch, Jie Fan, David Férnandez-Duque, Tim French, Wiebe van der Hoek, and Barteld Kooi.
