2026-07-21T20:03:35Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:16923 2026-04-20T13:32:27Z ddc:004 open_access

Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051) Atserias, Albert Berkholz, Christoph Etessami, Kousha Ochremiak, Joanna automata and game theory database theory descriptive complexity finite model theory homomorphism counts Query enumeration 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". Schloss Dagstuhl – Leibniz-Zentrum für Informatik Albert Atserias and Christoph Berkholz and Kousha Etessami and Joanna Ochremiak 2022 Is Part Of Dagstuhl Reports, Volume 12, Issue 1 (2022) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.12.1.101 urn:nbn:de:0030-drops-169232 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.1.101 eng https://creativecommons.org/licenses/by/4.0/legalcode