메뉴 건너뛰기




Volumn 174, Issue 1-2, 1997, Pages 97-121

On winning strategies in Ehrenfeucht-Fraïssé games

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; FORMAL LOGIC; GRAPH THEORY; SET THEORY;

EID: 0031095445     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00015-1     Document Type: Article
Times cited : (24)

References (22)
  • 1
    • 0001416287 scopus 로고
    • Reachability is harder for directed than for undirected finite graphs
    • M. Ajtai and R. Fagin, Reachability is harder for directed than for undirected finite graphs, J. Symbolic Logic 55 (1990) 113-150.
    • (1990) J. Symbolic Logic , vol.55 , pp. 113-150
    • Ajtai, M.1    Fagin, R.2
  • 4
    • 0020166926 scopus 로고
    • Structure and complexity of relational queries
    • A. Chandra and D. Harel, Structure and complexity of relational queries, J. Comput. System Sci. 25 (1982) 99-128.
    • (1982) J. Comput. System Sci. , vol.25 , pp. 99-128
    • Chandra, A.1    Harel, D.2
  • 7
    • 0000918436 scopus 로고
    • An application of games to the completeness problem for formalized theories
    • A. Ehrenfeucht, An application of games to the completeness problem for formalized theories, Fund. Math. 49 (1961) 129-141.
    • (1961) Fund. Math. , vol.49 , pp. 129-141
    • Ehrenfeucht, A.1
  • 9
    • 0002188798 scopus 로고
    • Generalized first-order spectra and polynomial-time recognizable sets
    • R.M. Karp, ed.
    • R. Fagin, Generalized first-order spectra and polynomial-time recognizable sets, in: R.M. Karp, ed. Complexity of Computation, SIAM AMS Proc. Vol. 7 (1974) 43-73.
    • (1974) Complexity of Computation, SIAM AMS Proc. , vol.7 , pp. 43-73
    • Fagin, R.1
  • 11
    • 0020781665 scopus 로고
    • Degrees of acyclicity for hypergraphs and relational detabase schemes
    • R. Fagin, Degrees of acyclicity for hypergraphs and relational detabase schemes, J. ACM 30 (1983) 514-550.
    • (1983) J. ACM , vol.30 , pp. 514-550
    • Fagin, R.1
  • 13
    • 0002850509 scopus 로고
    • Sur quelques classifications des systèmes de relations
    • R. Fraïssé, Sur quelques classifications des systèmes de relations, Publ. Sci. Univ. Alger. Sér. A 1 (1954) 35-182.
    • (1954) Publ. Sci. Univ. Alger. Sér. A , vol.1 , pp. 35-182
    • Fraïssé, R.1
  • 14
    • 77956947365 scopus 로고
    • On local and nonlocal properties
    • J. Sterm, ed., North Holland, Amstendam
    • H. Gaifman, On local and nonlocal properties, in: J. Sterm, ed., Logic Colloquium'81 (North Holland, Amstendam, 1982) 105-135.
    • (1982) Logic Colloquium'81 , pp. 105-135
    • Gaifman, H.1
  • 16
    • 0002650529 scopus 로고
    • Model-theoretic methods in the study of elementary logic
    • J. Addison, L. Henkin and A. Tarski, eds., North Holland, Amstendan
    • W. Hanf, Model-theoretic methods in the study of elementary logic, in: J. Addison, L. Henkin and A. Tarski, eds., The Theory of Models (North Holland, Amstendan, 1965) 132-145.
    • (1965) The Theory of Models , pp. 132-145
    • Hanf, W.1
  • 17
    • 0022500426 scopus 로고
    • Relational queries computable in polynomial time
    • N. Immerman, Relational queries computable in polynomial time, Inform. and Control 68 (1986) 86-104.
    • (1986) Inform. and Control , vol.68 , pp. 86-104
    • Immerman, N.1
  • 18
    • 0001991238 scopus 로고
    • Descriptive and computational complexity
    • J. Hartmanis, ed., American Mathematical Society, Providence, RI
    • N. Immerman, Descriptive and computational complexity, in: J. Hartmanis, ed., Computational Complexity Theory, Proc. Symp. Applied Math., Vol 38 (American Mathematical Society, Providence, RI 1989) 75-91.
    • (1989) Computational Complexity Theory, Proc. Symp. Applied Math. , vol.38 , pp. 75-91
    • Immerman, N.1
  • 21
    • 0011401101 scopus 로고
    • On the definability of properties of finite graphs
    • G. Turań, On the definability of properties of finite graphs, Discrete Math. 49 (1984) 291-302.
    • (1984) Discrete Math. , vol.49 , pp. 291-302
    • Turań, G.1


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