5 papers
On a total function which overtakes all total recursive functions
N. C. A. da Costa, F. A. Doria
This paper discusses a function that is frequently presented as a simile or look-alike of the so-called ``counterexample function to P=NP,'' that is, the function that collects all…
A lemma on a total function defined over the Baker-Gill-Solovay set of polynomial Turing machines
N. C. A. da Costa, F. A. Doria
If we establish that the counterexample function for P=NP, if total, overtakes all total recursive functions when extended over all Turing machines, then what happens to the same c…
Time is dispensable in thermodynamics
Newton C. A. da Costa, Adonai S. Sant'Anna
We use Padoa's principle of independence of primitive symbols in axiomatic systems in order to show that time is dispensable in continuum thermodynamics, according to the axiomatic…
On the consistency of with fragments of ZFC whose own consistency strength can be measured by an ordinal assignment
N. C. A. da Costa, F. A. Doria
We formulate the hypothesis in the case of the satisfiability problem as a sentence, out of which we can construct a partial recursive function so that…
On the existence of certain total recursive functions in nontrivial axiom systems, I
N. C. A. da Costa, F. A. Doria
We investigate the existence of a class of ZFC-provably total recursive unary functions, given certain constraints, and apply some of those results to show that, for -sound se…