First order logic, fixed point logic and linear order

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1092, Issue , 1996, Pages 161-177

  Dawar, Anuj ^a   Lindell, Steven ^b   Weinstein, Scott ^c  

^a UNIVERSITY OF WALES   (United Kingdom)

^b HAVERFORD COLLEGE   (United States)

^c UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; RECONFIGURABLE HARDWARE; STRUCTURE (COMPOSITION);

BOUNDED VARIABLES; ELEMENT TYPE; FINITE STRUCTURES; FIRST ORDER LOGIC; FIXED-POINT LOGIC; ITS APPLICATIONS; MODEL-THEORETIC; ORDERED STRUCTURES;

COMPUTER CIRCUITS;

EID: 1642620563     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61377-3_37     Document Type: Conference Paper

References (19)

1. S. Abiteboul and V. Vianu. Datalog extensions for database queries and updates. Journal of Computer and System Sciences, 43:62-124, 1991.
2. S. Abiteboul and V. Vianu. Computing with first-order logic. Journal of Computer and System Sciences, 50(2):309-335, 1995.
3. D.M. Barrington, N. Immerman, and H. Straubing. On uniformity within NC1. Journal of Computer and System Sciences, 41:274-306, 1990.
4. A. Dawar. Feasible Computation through Model Theory. PhD thesis, University of Pennsylvania, 1993.
5. A. Dawar and L. Hells. The expressive power of finitely many generalized quantifiers. Information and Computation, 123(2):172-184, 1995.
6. A. Dawar, S. Lindell, and S. Weinstein. Infinitary logic and inductive definability over finite structures. Information and Computation, 119(2):160-175, 1995.
7. Y. Gurevich, N. Immerman, and S. Shelah. McColm's conjecture. In Proc. 9th IEEE Syrup. on Logic in Computer Science, 1994.
8. Y. Gurevich. Toward logic tailored for computationl complexity. In M. Richter et M., editors, Computation and Proof Theory, pages 175-216. Springer Lecture Notes in Mathematics, 1984.
9. N. Immerman & D. Kozen. Definability with bounded number of bound variables. Information and Computation, 83:121-139, 1989.
10. N. Immerman. Upper and lower bounds for first-order expressibility. Journal of Computer and System Sciences, 25:76-98, 1982.
11. N. Immerman. RelationaJ queries computable in polynomial time. Information and Control, 68:86-104, 1986.
12. Ph. G. Kolaitis and M. Y. Vardi. Fixpoint logic vs. infinitary logic in finitemodel theory. In Proc. 7th IEEE Syrup. on Logic in Computer Science, pages 46-57, 1992.
13. Ph. G. Kolaitis and M. Y. Vardi. Infinitary logics and 0-1 laws. Information and Computation, 98(2):258-294, 1992.
14. G. L. McColm. When is arithmetic possible? Annals of Pure and Applied Logic, 50:29-51, 1990.
15. Y. N. Moschovakis. Elementary Induction on Abstract Structures. North Holland, 1974.
16. B. Poizat. Deux ou trois ehoses que je sals de Ln. Journal of Symbolic Logic, 47(3):641-658, 1982.
17. A. Stolbouskin and M. Taitslin. Is first order contained in an initial segment of PTIME? In Computer Science Logic 94, volume 933 of LNCS. Springer- Verlag, 1995.
18. th ACM Symposium on the Theory of Computing, pages 137-146, 1982.
19. C. Wrathall. Rudimentary predicates and relative computation. SIAM Journal on Computing, 7(2):194-209, 1979.