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

DOI10.1007/BF02011876zbMATH Open0406.03070MaRDI QIDQ4192056FDOQ4192056

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

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A survey of proof theory
• Title not available (Why is that?)
• Flow diagrams, turing machines and languages with only two formation rules
• Functionals defined by transfinite recursion
• Beweistheoretische Erfassung der unendlichen Induktion in der Zahlentheorie
• Title not available (Why is that?)
• Title not available (Why is that?)

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)