4 citations · 6 across the 6 of their papers we have counts for
7 papers
A positive solution to Hilbert's 10th problem
Michael Pfender
Polynome codes and code evaluation; arithmetical theory frames; -recursive race for decision; decision correctness; decision termination; correct termination in theory …
On Hilbert's Tenth Problem
Michael Pfender
Using an iterated Horner schema for evaluation of diophantine polynomials, we define a partial -recursive "decision" algorithm decis as a "race" for a first nullstelle versus a…
Consistency Decision
Michael Pfender
The consistency formula for set theory can be stated in terms of the free-variables theory of primitive recursive maps. Free-variable p. r. predicates are decidable by set theory,…
Arithmetical Foundations - Recursion. Evaluation. Consistency
Michael Pfender
Primitive recursion, mu-recursion, universal object and universe theories, complexity controlled iteration, code evaluation, soundness, decidability, Gödel incompleteness theorems,…
RCF4: Inconsistent Quantification
Michael Pfender
We exhibit canonical middle-inverse Choice maps within categorical (Free-Variable) Theory of Primitive Recursion as well as in Theory of partial PR maps over the Theory of Primitiv…
RCF3: Map-Code Interpretation via Closure
Michael Pfender
For a (minimal) Arithmetical theory with higher Order Objects, i.e. a (minimal) Cartesian closed arithmetical theory -- coming as such with the corresponding closed evaluation -- w…