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

DOI10.1007/BF02011876zbMath0406.03070MaRDI QIDQ4192056

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

InductionConsistencyTuring MachinesPrimitive Recursive ArithmeticFormal SystemCuteliminationInfinitary SystemLogical Complexity

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
• Functionals defined by transfinite recursion
• Flow diagrams, turing machines and languages with only two formation rules
• A survey of proof theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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