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

메뉴 건너뛰기

Theoretical Computer Science

Volumn 3, Issue 2, 1976, Pages 173-181

Finiteness is mu-ineffable

(1) Park, David a

a UNIVERSITY OF WARWICK (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0347534589 PISSN: 03043975 EISSN: None Source Type: Journal
DOI: 10.1016/0304-3975(76)90022-0 Document Type: Article

Times cited : (68)

References (8)

1
- 0346376722
- A calculus for recursive program schemes
- M. Nivat, North-Holland, Amsterdam
- (1973) Automata, Languages and Programming , pp. 167-196
- de Bakker¹ de Roever²

2
- 0004417999
- IBM, Vienna, unpublished notes
- (1969) A theory of programs
- de Bakker¹ Scott²

3
- 0345745616
- Introduction rules and termination proofs
- M. Nivat, North-Holland, Amsterdam
- (1973) Automata, Languages and Programming , pp. 225-251
- Hitchcock¹ Park²

4
- 0003711519
- North-Holland, Amsterdam
- (1971) Model Theory for Infinitary Logic
- Keisler¹

5
- 84909484172
- Comparing algebraic structures up to algorithmic equivalence
- M. Nivat, North-Holland, Amsterdam
- (1973) Automata, Languages and Programming , pp. 253-263
- Kfoury¹

6
- 0014800787
- On formalized computer programs
- (1970) J. Comp. System Sci. , vol.4 , pp. 220-249
- Luckham¹ Park² Paterson³

7
- 0003088977
- Fixpoint induction and proofs of program properties
- D. Michie, B. Meltzer, Edinburgh Univ. Press, Edinburgh
- (1970) Machine Intelligence , vol.5
- Park¹

8
- 0004031733
- Addison-Wesley, Reading, Mass
- (1967) Mathematical Logic
- Shoenfield¹

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