Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.

S. Caporaso; G. Pani

Archiv für mathematische Logik und Grundlagenforschung (1982)

  • Volume: 22, page 19-26
  • ISSN: 0003-9268

How to cite

top

Caporaso, S., and Pani, G.. "Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.." Archiv für mathematische Logik und Grundlagenforschung 22 (1982): 19-26. <http://eudml.org/doc/137988>.

@article{Caporaso1982,
author = {Caporaso, S., Pani, G.},
journal = {Archiv für mathematische Logik und Grundlagenforschung},
keywords = {semiformal system for description of hyperarithmetic computability},
pages = {19-26},
title = {Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.},
url = {http://eudml.org/doc/137988},
volume = {22},
year = {1982},
}

TY - JOUR
AU - Caporaso, S.
AU - Pani, G.
TI - Undecidability vs transfinite induction for the consistency of hyperarithmetical sets.
JO - Archiv für mathematische Logik und Grundlagenforschung
PY - 1982
VL - 22
SP - 19
EP - 26
KW - semiformal system for description of hyperarithmetic computability
UR - http://eudml.org/doc/137988
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.