DagRep.12.1.101.pdf
- Filesize: 4.22 MB
- 18 pages
Document
Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 12, Issue 1
Volume: Dagstuhl Reports, Volume 12
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2022-08-23
Cite AsGet BibTex
Albert Atserias, Christoph Berkholz, Kousha Etessami, and Joanna Ochremiak. Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051). In Dagstuhl Reports, Volume 12, Issue 1, pp. 101-118, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2022)
https://doi.org/10.4230/DagRep.12.1.101
https://doi.org/10.4230/DagRep.12.1.101
Abstract
Finite and algorithmic model theory (FAMT) studies the expressive power of logical languages on finite structures or, more generally, structures that can be finitely presented. These are the structures that serve as input to computation, and for this reason the study of FAMT is intimately connected with computer science. Over the last four decades, the subject has developed through a close interaction between theoretical computer science and related areas of mathematics, including logic and combinatorics. This report documents the program and the outcomes of Dagstuhl Seminar 22051 "Finite and Algorithmic Model Theory".
Subject Classification
ACM Subject Classification
- Theory of computation → Finite Model Theory
Keywords
- automata and game theory
- database theory
- descriptive complexity
- finite model theory
- homomorphism counts
- Query enumeration
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads