A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Approximating the Expressive Power of Logics in Finite Models
[chapter]
2004
Lecture Notes in Computer Science
Aquesta és una còpia de la versió author's final draft d'un article publicat a la revista Lecture notes in computer science. La publicació final està disponible a Springer a través de http://dx.Abstract. We present a probability logic (essentially a first order language extended with quantifiers that count the fraction of elements in a model that satisfy a first order formula) which, on the one hand, captures uniform circuit classes such as AC 0 and TC 0 over arithmetic models, namely, finite
doi:10.1007/978-3-540-24698-5_57
fatcat:cpgtycksqzhutnyubrmc3gawly