Eine beweistheoretische Anwendung partieller stetiger Funktionale

DOI10.1007/BF02011868zbMath0401.03021OpenAlexW2075909613MaRDI QIDQ4184826

H. Vogel

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/137945

zbMATH Keywords

IntuitionismProof TheoryRecursion TheoryHeyting ArithmeticComplexity of Proofs(Partial) Continuous Functions of Finite TypePrimitive Recursive RelationsQuantitative Theory of AlgorithmsQuantitative Theory Of Algorithms

Mathematics Subject Classification ID

Functionals in proof theory (03F10) Computability and recursion theory (03D99) Intuitionistic mathematics (03F55) Complexity of proofs (03F20) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Maximal and everywhere-defined functionals
• Computable functionals of finite types
• Eine Variante zur Dialectica-Interpretation der Heyting-Arithmetik endlicher Typen
• Formal systems for some branches of intuitionistic analysis

This page was built for publication: Eine beweistheoretische Anwendung partieller stetiger Funktionale