Art
J-GLOBAL ID：200902090984287853
Reference number：91A0430984
Sufficient-completeness, ground-reducibility and their complexity.
十分な完全性,基底還元可能性とその複雑度
-
Publisher site
Copy service
{{ this.onShowCLink("http://jdream3.com/copy/?sid=JGLOBAL&noSystem=1&documentNoArray=91A0430984©=1") }}
-
Access JDreamⅢ for advanced search and analysis.
{{ this.onShowJLink("http://jdream3.com/lp/jglobal/index.html?docNo=91A0430984&from=J-GLOBAL&jstjournalNo=E0786A") }}
Author (4)：
,
,
,
Material：
Volume：
28
Issue：
4
Page：
311-350
Publication year：
Apr. 1991
JST Material Number：
E0786A
ISSN：
0001-5903
CODEN：
AINFA2
Document type：
Article
Article type：
原著論文
Country of issue：
Germany, Federal Republic of (DEU)
Language：
ENGLISH (EN)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
,...
Semi thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
JST classification (1)：
JST classification
Category name(code) classified by JST.
Theory of computation
Terms in the title (4)：
Terms in the title
Keywords automatically extracted from the title.
,
,
,
Return to Previous Page
