Undecidability vs transfinite induction for the consistency of hyperarithmetical sets

DOI10.1007/BF02318023zbMath0494.03038MaRDI QIDQ3956932

Giovanni Pani, Salvatore Caporaso

Publication date: 1982

Published in: Archiv für mathematische Logik und Grundlagenforschung (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/137988

zbMATH Keywords

semiformal system for description of hyperarithmetic computability

Mathematics Subject Classification ID

Second- and higher-order arithmetic and fragments (03F35) Hierarchies of computability and definability (03D55)

Related Items (1)

A predicative and decidable characterization of the polynomial classes of languages

Cites Work

• Consistency proof without transfinite induction for a formal system for turing machines
• Unnamed Item
• Unnamed Item

This page was built for publication: Undecidability vs transfinite induction for the consistency of hyperarithmetical sets