A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Logical Definability of Counting Functions
1996
Journal of computer and system sciences (Print)
The relationship between counting functions and logical expressibility is explored. The most well studied class of counting functions is *P, which consists of the functions counting the accepting computation paths of a nondeterministic polynomial-time Turing machine. For a logic L, *L is the class of functions on finite structures counting the tuples (T , cÄ ) satisfying a given formula (T , cÄ ) in L. Saluja, Subrahmanyam, and Thakur showed that on classes of ordered structures *FO=*P (where
doi:10.1006/jcss.1996.0069
fatcat:fksc6h5r2jdg5nohcko3pxeawq