License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagRep.12.1.101
URN: urn:nbn:de:0030-drops-169232
URL: https://drops.dagstuhl.de/opus/volltexte/2022/16923/
Go back to Dagstuhl Reports


Atserias, Albert ; Berkholz, Christoph ; Etessami, Kousha ; Ochremiak, Joanna
Weitere Beteiligte (Hrsg. etc.): Albert Atserias and Christoph Berkholz and Kousha Etessami and Joanna Ochremiak

Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051)

pdf-format:
dagrep_v012_i001_p101_22051.pdf (4 MB)


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".

BibTeX - Entry

@Article{atserias_et_al:DagRep.12.1.101,
  author =	{Atserias, Albert and Berkholz, Christoph and Etessami, Kousha and Ochremiak, Joanna},
  title =	{{Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051)}},
  pages =	{101--118},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2022},
  volume =	{12},
  number =	{1},
  editor =	{Atserias, Albert and Berkholz, Christoph and Etessami, Kousha and Ochremiak, Joanna},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2022/16923},
  URN =		{urn:nbn:de:0030-drops-169232},
  doi =		{10.4230/DagRep.12.1.101},
  annote =	{Keywords: automata and game theory, database theory, descriptive complexity, finite model theory, homomorphism counts, Query enumeration}
}

Keywords: automata and game theory, database theory, descriptive complexity, finite model theory, homomorphism counts, Query enumeration
Collection: DagRep, Volume 12, Issue 1
Issue Date: 2022
Date of publication: 23.08.2022


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI