Logical definability of counting functions

DOI10.1006/jcss.1996.0069zbMath0859.68036OpenAlexW2144706656MaRDI QIDQ1816735

Kevin J. Compton, Erich Grädel

Publication date: 31 March 1997

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcss.1996.0069

zbMATH Keywords

computational complexitylogical languages

Mathematics Subject Classification ID

Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Unnamed Item ⋮ On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic

This page was built for publication: Logical definability of counting functions