Proof theory and Post-Turing analysis

DOI10.1007/3-540-45504-3_9MaRDI QIDQ4436031zbMATH OpenFDO

Authors L. N. Gordeev

Publication date 23 November 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2183/21830130.htm

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Complexity of computation (including implicit computational complexity) (03D15) Proof theory in general (including proof-theoretic semantics) (03F03)

Recommendations

• New Computational Paradigms
• scientific article; zbMATH DE number 1390023
• Proofs and computations
• From nonstandard analysis to various flavours of computability theory
• Computability and analysis, a historical approach

Cited in

(4)

• Proof theory and ordinal analysis
• scientific article; zbMATH DE number 3881851 (Why is no real title available?)
• Effectiveness and provability
• Techniques of computable set theory with applications to proof verification

This page was built for publication: Proof theory and Post-Turing analysis

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