메뉴 건너뛰기




Volumn 160, Issue 1-2, 1996, Pages 305-320

First-order spectra with one binary predicate

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL LINGUISTICS; MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY; THEOREM PROVING;

EID: 0030169924     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(95)00112-3     Document Type: Article
Times cited : (9)

References (17)
  • 1
    • 0002970176 scopus 로고
    • 1-formula on finite structures
    • 1-formula on finite structures, Ann. Pure Appl. Logic 24 (1983) 1-48.
    • (1983) Ann. Pure Appl. Logic , vol.24 , pp. 1-48
    • Ajtai, M.1
  • 2
    • 0015816246 scopus 로고
    • A hierarchy for nondeterministic time complexity
    • S.A. Cook, A hierarchy for nondeterministic time complexity, J. Comput. System Sci. (1973) 343-353.
    • (1973) J. Comput. System Sci. , pp. 343-353
    • Cook, S.A.1
  • 3
    • 84985321946 scopus 로고
    • Second-order and inductive definability on finite structures
    • M. De Rougemont, Second-order and inductive definability on finite structures, Z. Math. Logik Grundlag. Math. 33 (1987) 47-63.
    • (1987) Z. Math. Logik Grundlag. Math. , vol.33 , pp. 47-63
    • De Rougemont, M.1
  • 6
    • 0027906178 scopus 로고
    • Finite-model theory - A personal perspective
    • R. Fagin, Finite-model theory - a personal perspective, Theoret. Comput. Sci. 116 (1993) 3-31.
    • (1993) Theoret. Comput. Sci. , vol.116 , pp. 3-31
    • Fagin, R.1
  • 8
    • 0021420807 scopus 로고
    • The spectra of first-order sentences and computational complexity
    • E. Grandjean, The spectra of first-order sentences and computational complexity, SIAM J. Comput. 13 (1984) 356-373.
    • (1984) SIAM J. Comput. , vol.13 , pp. 356-373
    • Grandjean, E.1
  • 9
    • 0039818178 scopus 로고
    • Universal quantifiers and time complexity of random access machine
    • E. Grandjean, Universal quantifiers and time complexity of random access machine, Math. Systems Theory 18 (1985) 171-187.
    • (1985) Math. Systems Theory , vol.18 , pp. 171-187
    • Grandjean, E.1
  • 10
    • 0025414854 scopus 로고
    • First-order spectra with one variable
    • E. Grandjean, First-order spectra with one variable, J. Comput. System Sci. 40 (1990) 136-153.
    • (1990) J. Comput. System Sci. , vol.40 , pp. 136-153
    • Grandjean, E.1
  • 11
    • 0043001242 scopus 로고
    • Turing machines and the spectra of first-order formulas with equality
    • N.D. Jones and A.L. Selman, Turing machines and the spectra of first-order formulas with equality, J. Symbolic Logic 39 (1974) 139-150.
    • (1974) J. Symbolic Logic , vol.39 , pp. 139-150
    • Jones, N.D.1    Selman, A.L.2
  • 12
    • 0000832468 scopus 로고
    • Complexity classes and theories of finite models
    • J.F. Lynch, Complexity classes and theories of finite models, Math. Systems Theory 15 (1982) 127-144.
    • (1982) Math. Systems Theory , vol.15 , pp. 127-144
    • Lynch, J.F.1
  • 14
    • 0028375535 scopus 로고
    • Investigation of binary spectra by explicit polynomial transformations of graphs
    • M. More, Investigation of binary spectra by explicit polynomial transformations of graphs, Theoret. Comput. Sci. 124 (1994) 221-272.
    • (1994) Theoret. Comput. Sci. , vol.124 , pp. 221-272
    • More, M.1
  • 15
    • 0347006719 scopus 로고    scopus 로고
    • Personal communication
    • F. Olive, Personal communication.
    • Olive, F.1
  • 16
    • 0011965764 scopus 로고
    • The observational predicate calculus and complexity of computations
    • P. Pudlak, The observational predicate calculus and complexity of computations, Comm. Math. Univ. Carolin. 16 (1975).
    • (1975) Comm. Math. Univ. Carolin. , vol.16
    • Pudlak, P.1


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