Document Open Access Logo

Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051)

Authors Albert Atserias, Christoph Berkholz, Kousha Etessami, Joanna Ochremiak and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.12.1.101.pdf
  • Filesize: 4.22 MB
  • 18 pages

Document Identifiers

Author Details

Albert Atserias
  • UPC Barcelona Tech, ES
Christoph Berkholz
  • HU Berlin, DE
Kousha Etessami
  • University of Edinburgh, GB
Joanna Ochremiak
  • University of Bordeaux, FR
and all authors of the abstracts in this report

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

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)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail