DocumentCode
2725974
Title
More about recursive structures: descriptive complexity and zero-one laws
Author
Hirst, Tima ; Harel, David
Author_Institution
Weizmann Inst. of Sci., Rehovot, Israel
fYear
1996
fDate
27-30 Jul 1996
Firstpage
334
Lastpage
347
Abstract
This paper continues our work on infinite, recursive structures. We investigate the descriptive complexity of several logics over recursive structures, including first-order, second-order, and fixpoint logic, exhibiting connections between expressibility of a property and its computational complexity. We then address 0-1 laws, proposing a version that applies to recursive structures and using it to prove several non-expressibility results
Keywords
computational complexity; formal logic; 0-1 laws; descriptive complexity; expressibility; first-order logic; fixpoint logic logic; recursive structures; second-order logic; zero-one laws; Arithmetic; Computational complexity; Computer science; Logic; Polynomials; TV;
fLanguage
English
Publisher
ieee
Conference_Titel
Logic in Computer Science, 1996. LICS '96. Proceedings., Eleventh Annual IEEE Symposium on
Conference_Location
New Brunswick, NJ
ISSN
1043-6871
Print_ISBN
0-8186-7463-6
Type
conf
DOI
10.1109/LICS.1996.561361
Filename
561361
Link To Document