Full and hat inductive definitions are equivalent in NBG


Autoria(s): Sato, Kentaro
Data(s)

2015

Resumo

A new research project has, quite recently, been launched to clarify how different, from systems in second order number theory extending ACA 0, those in second order set theory extending NBG (as well as those in n + 3-th order number theory extending the so-called Bernays−Gödel expansion of full n + 2-order number theory etc.) are. In this article, we establish the equivalence between Δ10\bf-LFP and Δ10\bf-FP, which assert the existence of a least and of a (not necessarily least) fixed point, respectively, for positive elementary operators (or between Δn+20\bf-LFP and Δn+20\bf-FP). Our proof also shows the equivalence between ID 1 and ^ID1, both of which are defined in the standard way but with the starting theory PA replaced by ZFC (or full n + 2-th order number theory with global well-ordering).

Formato

application/pdf

application/pdf

Identificador

http://boris.unibe.ch/61786/1/art%253A10.1007%252Fs00153-014-0403-x.pdf

http://boris.unibe.ch/61786/8/FPLFP.pdf

Sato, Kentaro (2015). Full and hat inductive definitions are equivalent in NBG. Archive for Mathematical Logic, 54(1-2), pp. 75-112. Springer 10.1007/s00153-014-0403-x <http://dx.doi.org/10.1007/s00153-014-0403-x>

doi:10.7892/boris.61786

info:doi:10.1007/s00153-014-0403-x

urn:issn:0933-5846

Idioma(s)

eng

Publicador

Springer

Relação

http://boris.unibe.ch/61786/

Direitos

info:eu-repo/semantics/restrictedAccess

info:eu-repo/semantics/openAccess

Fonte

Sato, Kentaro (2015). Full and hat inductive definitions are equivalent in NBG. Archive for Mathematical Logic, 54(1-2), pp. 75-112. Springer 10.1007/s00153-014-0403-x <http://dx.doi.org/10.1007/s00153-014-0403-x>

Palavras-Chave #000 Computer science, knowledge & systems #510 Mathematics
Tipo

info:eu-repo/semantics/article

info:eu-repo/semantics/publishedVersion

PeerReviewed