Result: The complexity of inductive definability
Title:
The complexity of inductive definability
Authors:
Source:
New computational paradigms (Amsterdam, 8-12 June 2005)Lecture notes in computer science. :75-85
Publisher Information:
Berlin: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 6 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Algorithmique, Algorithmics, Algorítmica, Programmation logique, Logical programming, Programación lógica, Théorie preuve, Proof theory, Teoría demonstración, Théorie programmation, Programming theory, Théorie type, Type theory
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Mathematics, University of Florida, P.O. Box 118105, Gainesville, FL, 32611, United States
Department of Mathematics, University of California at San Diego, La Jolla, CA 92093, United States
Department of Mathematics, University of California at San Diego, La Jolla, CA 92093, United States
ISSN:
0302-9743
Rights:
Copyright 2005 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:
Computer science; theoretical automation; systems
Accession Number:
edscal.16895986
Database:
PASCAL Archive
Further Information
We study the complexity of computable and Σ01 inductive definitions of sets of natural numbers. For we example, we show how to assign natural indices to monotone Σ01-definitions and we use these to calculate the complexity of the set of all indices of monotone Σ01-definitions which are computable. We also examine the complexity of new type of inductive definition which we call weakly finitary monotone inductive definitions. Applications are given in proof theory and in logic programming.