Treffer: Complexity of logical theories involving coprimality
Title:
Complexity of logical theories involving coprimality
Authors:
Source:
Theoretical computer science. 106(2):221-241
Publisher Information:
Amsterdam: Elsevier, 1992.
Publication Year:
1992
Physical Description:
print, 27 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Logique mathématique, fondements, théorie des ensembles, Mathematical logic, foundations, set theory, Logique et fondements, Logic and foundations, Récursivité, Recursion theory, Complexité calcul, Computing complexity, Complejidad cálculo, Complétude, Completeness, Plenitud, Limite inférieure, Lower bound, Límite inferior, Limite supérieure, Upper bound, Límite superior, Théorie, Theory, Teoría, Nombre naturel, Natural number, Nombres relativement premiers
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. Paris 7, 75005 Paris, France
ISSN:
0304-3975
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
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
CC BY 4.0
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
Notes:
Mathematics
Accession Number:
edscal.4919781
Database:
PASCAL Archive
Weitere Informationen
Upper bounds on the computational complexity of some logical theories are proved. The theory Th(Pf(N,⊆), of finite subsets of N is proved to be in ∪c>0 ATIME-ALT(2cn, n). The same result isproved for the theories Th(N, ⊥), Th(N, ⊥, x) and Th(N, ⊥, x, 2x, x2, 2x), where ⊥ denotes coprimality of numbers. The theory Th(N, =, ⊥) is proved to be in ∪c>0 ATIME-ALT(2cn2, n).