Consistency proof without transfinite induction for a formal system for turing machines

DOI10.1007/BF02011876MaRDI QIDQ4192056zbMATH OpenFDO

Authors Salvatore Caporaso

Publication date 1978

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

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

zbMATH Keywords

ConsistencyTuring MachinesPrimitive Recursive ArithmeticFormal SystemInductionCuteliminationInfinitary SystemLogical Complexity

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20) First-order arithmetic and fragments (03F30) Turing machines and related notions (03D10)

Cites work

• scientific article; zbMATH DE number 3128445 (Why is no real title available?)
• scientific article; zbMATH DE number 3261581 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3304881 (Why is no real title available?)
• scientific article; zbMATH DE number 3193733 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• A survey of proof theory
• Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
• Flow diagrams, turing machines and languages with only two formation rules
• Functionals defined by transfinite recursion

Cited in

(2)

• Structured programs for Turing machines
• Undecidability vs transfinite induction for the consistency of hyperarithmetical sets

This page was built for publication: Consistency proof without transfinite induction for a formal system for turing machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4192056)