Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=4044438

On the maximality of some pairs of p-t degrees

Author
XIZHONG ZHENG
Nanjing univ., dep. mathematics, Nanjing 210008, China
Source

Notre Dame journal of formal logic. 1993, Vol 34, Num 1, pp 29-35 ; ref : 7 ref

CODEN
NDJFAM
ISSN
0029-4527
Scientific domain
Mathematics
Publisher
University of Notre Dame Press, Notre Dame, IN
Publication country
United States
Document type
Article
Language
English
Keyword (fr)
Machine Turing Réductibilité Temps polynomial Degré récursivement énumérable
Keyword (en)
Turing machine Reducibility Polynomial time Recursively enumerable degree
Keyword (es)
Máquina Turing Reductibilidad Tiempo polinomial
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02A Mathematical logic, foundations, set theory / 001A02A01 Logic and foundations / 001A02A01D Recursion theory

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
4044438

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Searching the Web