The Kleene-Post and Post’s Theorem in the Calculus of Inductive Constructions

Keyphrases

• Calculus of Inductive Constructions 100%
• Kleene 100%
• Computability Theory 75%
• Oracle 50%
• Law of Excluded Middle 50%
• Synthetic Computability 50%
• Arithmetical Hierarchy 50%
• Models of Computation 25%
• Computability 25%
• Analytic Model 25%
• Consistency Proof 25%
• Turing Machine 25%
• Weaker Variants 25%
• Constructive Type Theory 25%
• Coq Proof Assistant 25%
• Reasons-first 25%
• Turing Degrees 25%
• Computable Function 25%
• Classical Logic 25%
• Halting Problem 25%
• Turing Reducibility 25%
• Turing Jump 25%
• Constructive Reverse Mathematics 25%
• Incomparable Degrees 25%

Mathematics

• Calculus 100%
• Computability Theory 75%
• Excluded Middle 50%
• Arithmetical Hierarchy 50%
• Formalization 25%
• Consistency Proof 25%
• Turing Machine 25%
• Model of Computation 25%
• Type Theory 25%
• Computable Function 25%
• Turing Degree 25%
• Classical Logic 25%
• Halting Problem 25%
• Reverse Mathematics 25%

Computer Science

• Computability 100%
• Arithmetical Hierarchy 33%
• Model of Computation 16%
• Formalization 16%
• Consistency Proof 16%
• Turing Machine 16%
• Constructive Type 16%
• Analytic Model 16%
• Halting Problem 16%
• Computable Function 16%