Model Theory in Computer Science: My Own Recurrent Themes

DOI10.4230/LIPICS.CSL.2011.553zbMATH Open1247.03064OpenAlexW2240390774MaRDI QIDQ2915711

J. A. Makowsky

Publication date: 18 September 2012

Full work available at URL: http://drops.dagstuhl.de/opus/volltexte/2011/3256/pdf/43.pdf

zbMATH Keywords

model theorysurvey papergraph invariantsfinite model theorydatabases

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph polynomials (05C31) Database theory (68P15) Planar graphs; geometric and topological aspects of graph theory (05C10) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Decidability of theories and sets of sentences (03B25) Model theory of finite structures (03C13) Applications of model theory (03C98) Categoricity and completeness of theories (03C35)

Related Items (1)

Computational model theory: an overview

This page was built for publication: Model Theory in Computer Science: My Own Recurrent Themes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2915711)