activity
19982021
most citedOn a total function which overtakes all total recursive functions

1 citations · 2 across the 6 of their papers we have counts for

collaborators

6 papers

math.GM2021

Axiomatic Theory of Distributions

Newton C. A. da Costa, J. A. Baêta Segundo

In this monograph, very simple axiomatic definitions to the L. Schwartz' concepts of distribution and derivative of a distribution are formulated. Beyond this, a kind of generaliza…

math.LO2001★ 1 cited

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…

math.LO2001

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…

math-ph2001

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…

math.LO2000★ 1 cited

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…

cmp-lg1998

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…