scientific article; zbMATH DE number 3320380

zbMath0202.01202MaRDI QIDQ5600870

Charles Parsons

Publication date: 1970

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Related Items (35)

Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction ⋮ Totality in applicative theories ⋮ Induction rules, reflection principles, and provably recursive functions ⋮ On the Computational Content of Termination Proofs ⋮ Bounded finite set theory ⋮ Intrinsic theories and computational complexity ⋮ Weak and strong versions of effective transfinite recursion ⋮ AXIOMATIZATIONS OF PEANO ARITHMETIC: A TRUTH-THEORETIC VIEW ⋮ What can be done with PRA? ⋮ On nested simple recursion ⋮ Primitive recursion and the chain antichain principle ⋮ Unprovability of theorems of complexity theory in weak number theories ⋮ The finitary content of sunny nonexpansive retractions ⋮ Parameter free induction and provably total computable functions ⋮ Theories with self-application and computational complexity. ⋮ \(\Delta_{2}\) degrees without \(\Sigma_{1}\) induction ⋮ Things that can and things that cannot be done in PRA ⋮ Proof Theoretic Analysis by Iterated Reflection ⋮ On Relating Theories: Proof-Theoretical Reduction ⋮ Term rewriting theory for the primitive recursive functions ⋮ Harrington's conservation theorem redone ⋮ On end extensions of models of subsystems of Peano arithmetic ⋮ A simple proof of Parsons' theorem ⋮ Uniform Heyting arithmetic ⋮ Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA ⋮ On uniform weak König's lemma ⋮ Finite investigations of transfinite derivations ⋮ Fragments of arithmetic ⋮ Not all Kripke models of \(\mathsf{HA}\) are locally \(\mathsf{PA}\) ⋮ The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) ⋮ On the arithmetical content of restricted forms of comprehension, choice and general uniform boundedness ⋮ Systems of explicit mathematics with non-constructive \(\mu\)-operator. I ⋮ Generalizing classical and effective model theory in theories of operations and classes ⋮ Neo-Logicism and Its Logic ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC

This page was built for publication: