Recursion, induction and well-founded orders
No Thumbnail Available
Date
Advisors
Evaluators
Journal Title
Journal ISSN
Volume Title
Publisher
Universidad Industrial de Santander
Abstract
Description
Con base en la caracterización de los números naturales a partir de la propiedad de recursión (ver [2]), probamos en forma general que para un conjunto dado las propiedades de recursión, inducción y buena fundación son equivalentes entre sí. El resultado lo extendemos a clases y lo utilizamos para dar otra prueba de la caracterización del conjunto de los naturales mediante recursión.
Based on the characterization of the set of natural numbers by the recursion property, developed in [2], we prove in a general setting that the properties of recursion, induction and well-foundedness are equivalent for a given set. This result is extended to classes and is used to give another proof of the characterization of the set of natural numbers by recursion.
Based on the characterization of the set of natural numbers by the recursion property, developed in [2], we prove in a general setting that the properties of recursion, induction and well-foundedness are equivalent for a given set. This result is extended to classes and is used to give another proof of the characterization of the set of natural numbers by recursion.
Keywords
recursion, induction, well-founded order, recursión, inducción, orden bien fundado