Authors
Erich Grädel, Phokion G Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Moshe Y Vardi, Yde Venema, Scott Weinstein
Publication date
2007/4/24
Publisher
Springer
Description
Finite model theory, as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our understanding of mathematical phenomena is enriched by elevating the languages we use to describe mathematical structures to objects of explicit study. If mathematics is the science of patterns, then the media through which we discern patterns, as well as the structures in which we discern them, command our attention. It isthis aspect oflogicwhichis mostprominentin model theory,“thebranchof mathematical logic which deals with the relation between a formal language and its interpretations”. No wonder, then, that mathematical logic, and? nite model theory in particular, should? nd manifold applications in computer science: from …
Total citations
20062007200820092010201120122013201420152016201720182019202020212022202320241101010171616151519192017201522191818
Scholar articles
E Grädel, PG Kolaitis, L Libkin, M Marx, J Spencer… - 2007
E Gradel, P Kolaitis, L Libkin, M Marx, M Vardi… - 2014