DagSemProc.07441.2.pdf
- Filesize: 47 kB
- 2 pages
Document
07441 Summary – Algorithmic-Logical Theory of Infinite Structures
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 7441
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2008-04-09
Cite AsGet BibTex
Rod Downey, Bakhadyr Khoussainov, Dietrich Kuske, Markus Lohrey, and Moshe Y. Vardi. 07441 Summary – Algorithmic-Logical Theory of Infinite Structures. In Algorithmic-Logical Theory of Infinite Structures. Dagstuhl Seminar Proceedings, Volume 7441, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.07441.2
https://doi.org/10.4230/DagSemProc.07441.2
Abstract
One of the important research fields of theoretical and applied
computer science and mathematics is the study of algorithmic, logical
and model theoretic properties of structures and their
interactions. By a structure we mean typical objects that arise in
computer science and mathematics such as data structures, programs,
transition systems, graphs, large databases, XML documents, algebraic
systems including groups, integers, fields, Boolean algebras and so
on.
Keywords
- Theories of infinite structures
- computable model theory and automatic structures
- model checking infinite systems
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads