König's lemma, the ω-Rule and primitive recursive arithmetic

DOI10.1007/BF02007557zbMATH Open0594.03036OpenAlexW2082196855WikidataQ124808997 ScholiaQ124808997MaRDI QIDQ3724327FDOQ3724327

Authors:

Publication date: 1985

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

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

Recommendations

• Further applications of ultra-conservative ω-rules
• scientific article; zbMATH DE number 4099295
• On uniform weak König's lemma
• Recursive \(\omega\)-rule for proof systems
• Interpreting weak Kőnig's lemma in theories of nonstandard arithmetic

zbMATH Keywords

proof theoryinfinite derivationsinfinitary inference rulefinite derivations

Mathematics Subject Classification ID

Structure of proofs (03F07) Second- and higher-order arithmetic and fragments (03F35)

Cites Work

• Title not available (Why is that?)
• Ein System des Verknüpfenden Schliessens
• Functionals defined by transfinite recursion
• Further applications of ultra-conservative ω-rules

Cited In (7)

• Further applications of ultra-conservative ω-rules
• Finding paths through narrow and wide trees
• Title not available (Why is that?)
• Primitive recursion and the chain antichain principle
• Recursive \(\omega\)-rule for proof systems
• Title not available (Why is that?)
• Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule

This page was built for publication: König's lemma, the ω-Rule and primitive recursive arithmetic

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