SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Mathematical Logic Quarterly

Volumn 43, Issue 3, 1997, Pages 419-426

Rudimentary languages and second-order logic

(2) More, Malika a Olive, Frédéric a

a UNIVERSITÉ DE CAEN (France)

Author keywords

Linear hierarchy; Monadic second order logic; Rudimentary sets; Spectra

Indexed keywords

EID: 0031535493 PISSN: 09425616 EISSN: None Source Type: Journal
DOI: 10.1002/malq.19970430315 Document Type: Article

Times cited : (10)

References (15)

1
- 0003717941
- Doctoral Dissertation, Princeton University, Princeton, N. J.
- BENNETT, J. H., On Spectra. Doctoral Dissertation, Princeton University, Princeton, N. J., 1962.
- (1962) On Spectra
- Bennett, J.H.¹

2
- 70350098746
- Weak second order arithmetic and finite automata
- BÜCHI J. R., Weak second order arithmetic and finite automata. Zeitschrift Math. Logik Grundlagen Math. 6 (1960), 66-92.
- (1960) Zeitschrift Math. Logik Grundlagen Math. , vol.6 , pp. 66-92
- Büchi, J.R.¹

3
- 0002188798
- Generalized first-order spectra and polynomial-time recognizable sets
- FAGIN, R., Generalized first-order spectra and polynomial-time recognizable sets. SIAM-Proceedings 7 (1974), 43-72.
- (1974) SIAM-Proceedings , vol.7 , pp. 43-72
- Fagin, R.¹

4
- 84982578766
- A spectrum hierarchy
- FAGIN, R., A spectrum hierarchy. Zeitschrift Math. Logik Grundlagen Math. 21 (1975), 123-134.
- (1975) Zeitschrift Math. Logik Grundlagen Math. , vol.21 , pp. 123-134
- Fagin, R.¹

5
- 21844493498
- Monadic logical definability of NP-complete problems
- GRANDJEAN, E., and F. OLIVE, Monadic logical definability of NP-complete problems. In: CSL'94 Proceedings, Lecture Notes in Computer Science 933 (1995), pp. 190-204.
- (1995) CSL'94 Proceedings, Lecture Notes in Computer Science , vol.933 , pp. 190-204
- Grandjean, E.¹ Olive, F.²

6
- 0012623445
- Doctoral Dissertation, New-York University, Department of Mathematics
- HARROW, K., Sub-elementary classes of functions and relations. Doctoral Dissertation, New-York University, Department of Mathematics, 1973.
- (1973) Sub-elementary Classes of Functions and Relations
- Harrow, K.¹

7
- 0023400985
- Languages that capture complexity classes
- IMMERMAN, N., Languages that capture complexity classes. SIAM J. Computing 16, (1987), 760-777.
- (1987) SIAM J. Computing , vol.16 , pp. 760-777
- Immerman, N.¹

8
- 0003037529
- Reducibility among combinatorial problems
- Complexity of Computers Computations, Plenum Press, New York
- KARP, R. M., Reducibility among combinatorial problems. In: IBM Symposium 1972, Complexity of Computers Computations, Plenum Press, New York, 1972, pp. 85-103.
- (1972) IBM Symposium 1972 , pp. 85-103
- Karp, R.M.¹

9
- 0000832468
- Complexity classes and theories of finite models
- LYNCH, J. F., 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.¹

10
- 0038971847
- Prépublication du LLAIC1, Numéro 40
- MORE, M., Rudimentary representations of spectra. Prépublication du LLAIC1, Numéro 40, 1994.
- (1994) Rudimentary Representations of Spectra
- More, M.¹

11
- 0001291845
- Concatenation as a basis for arithmetic from a logical point of view
- QUINE, W., Concatenation as a basis for arithmetic from a logical point of view. J. Symbolic Logic 11 (1946), 105-114.
- (1946) J. Symbolic Logic , vol.11 , pp. 105-114
- Quine, W.¹

12
- 0003295187
- Theory of formal systems
- Princeton University Press, Princeton, N. J.
- SMULLYAN, R., Theory of Formal Systems. Annals of Math. Studies 47, Princeton University Press, Princeton, N. J., 1961.
- (1961) Annals of Math. Studies , vol.47
- Smullyan, R.¹

13
- 44649167785
- The polynomial time hierarchy
- STOCKMEYER, L. J., The polynomial time hierarchy. Theoret. Comput. Sci. 3 (1976), 1-22.
- (1976) Theoret. Comput. Sci. , vol.3 , pp. 1-22
- Stockmeyer, L.J.¹

14
- 0003594365
- Doctoral Dissertation, University of Manchester
- WOOD, A., Some Problems in Logic and Number Theory, and their Connections. Doctoral Dissertation, University of Manchester, 1981.
- (1981) Some Problems in Logic and Number Theory, and Their Connections
- Wood, A.¹

15
- 0003108623
- Rudimentary predicates and relative computation
- WRATHALL, C., Rudimentary predicates and relative computation. SIAM J. Computing 7 (1978), 194-209.
- (1978) SIAM J. Computing , vol.7 , pp. 194-209
- Wrathall, C.¹

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