메뉴 건너뛰기




Volumn 66, Issue 2, 2001, Pages 685-702

Two variable first-order logic over ordered domains

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0035534330     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2695037     Document Type: Article
Times cited : (93)

References (11)
  • 3
    • 0031491942 scopus 로고    scopus 로고
    • On the complexity of the decision problem for two-variable first-order logic
    • E. GRÄDEL, P. KOLAITIS, , and M. VARDI, On the complexity of the decision problem for two-variable first-order logic, The Bulletin of Symbolic Logic, vol. 3 (1997), pp. 53-69.
    • (1997) The Bulletin of Symbolic Logic , vol.3 , pp. 53-69
    • Grädel, E.1    Kolaitis, P.2    Vardi, M.3
  • 5
    • 0040714484 scopus 로고    scopus 로고
    • Undecidability results on two-variable logics
    • E. GRÄDEL, M. OTTO, and E. ROSEN, Undecidability results on two-variable logics, Archive of Mathematical Logic, vol. 38 (1999), pp. 313-354, A preliminary version appeared in Proceedings of 14th Symposium on Theoretical Aspects of Computer Science 1997, LNCS, vol. 1200, Springer 1997, pp. 249-260.
    • (1999) Archive of Mathematical Logic , vol.38 , pp. 313-354
    • Grädel, E.1    Otto, M.2    Rosen, E.3
  • 6
    • 0007994266 scopus 로고    scopus 로고
    • LNCS, Springer
    • E. GRÄDEL, M. OTTO, and E. ROSEN, Undecidability results on two-variable logics, Archive of Mathematical Logic, vol. 38 (1999), pp. 313-354, A preliminary version appeared in Proceedings of 14th Symposium on Theoretical Aspects of Computer Science 1997, LNCS, vol. 1200, Springer 1997, pp. 249-260.
    • (1997) Proceedings of 14th Symposium on Theoretical Aspects of Computer Science 1997 , vol.1200 , pp. 249-260
  • 7
    • 0007375698 scopus 로고
    • Remarks on Berger's paper on the domino problem
    • Y. GUREVICH and I. KORYAKOV, Remarks on Berger's paper on the domino problem, Siberian Mathematical Journal, vol. 13 (1972), pp. 319-321.
    • (1972) Siberian Mathematical Journal , vol.13 , pp. 319-321
    • Gurevich, Y.1    Koryakov, I.2
  • 11
    • 0001652558 scopus 로고    scopus 로고
    • Why is modal logic so robustly decidable?
    • DIMACS Series in Discrete Mathematics and Theoretical Computer Science, no. 31. American Mathematical Society
    • M. VARDI, Why is modal logic so robustly decidable?, Descriptive complexity and finite models (Princeton, NJ, 1996), DIMACS Series in Discrete Mathematics and Theoretical Computer Science, no. 31. American Mathematical Society, 1997, pp. 149-184.
    • (1997) Descriptive Complexity and Finite Models (Princeton, NJ, 1996) , pp. 149-184
    • Vardi, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.