Hostname: page-component-78c5997874-8bhkd Total loading time: 0 Render date: 2024-11-16T01:20:09.455Z Has data issue: false hasContentIssue false
  • English
  • Français

The critical number of a variable in a function

Published online by Cambridge University Press:  12 March 2014

Gaisi Takeuti
Gaisi Takeuti*
Affiliation:
Department of Mathematics, University of Illinois, Urbana, Illinois 61801, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Extract

Let L0 be a language on ℕ consisting of 0, 1, +, ∸, ·, ⌊½a⌋, ∣a∣, #, ∧(a,b), ∨(a,b), ¬(a), ≤ (a,b), and μx ≤ ∣s∣t(x). Here μx ≤ ∣s∣t(x) is the smallest number x ≤ ∣s∣ satisfying t(x) > 0 and 0 if there exist no such x and we stipulate that if s and t(a) are terms in Lo, then μx ≤ ∣s∣t(x) is also a term in Lo. The defining axioms of functions ∧(a,b), ∨(a,b), ¬(a), ≤ (a,b) are as follows:

Let L a language on ℕ with only predicate constant = and L0 ⊆ L. Let f (b, a1,…,am) be a function for ℕm+1 into ℕ. We say “f is weakly expressed by terms t1(b, a1,…, am),…, tr(b, a1,…, am) in L” if for every b, a1,…, am ∈ ℕ, f (b, a1,…,am) is equal to one of ti(b, a1, …, am). The critical number of b in f with respect to L is the minimum number n such that whenever f(b, a1,…, an) is weakly expressed by terms t1(b, a1, …, an),…, the number of occurrences of b in some ti(b, a1,…, an) is at least n.

As is defined in [1], a function f is defined by a limited iteration from g and h with respect to L iff the following holds: Let τ be defined as

with the condition ; and is defined by

where and are terms in L. We say “f is defined by a short limited iteration from g and h” if is defined by

where τ, s, t are the same as above satisfying the condition .

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 59 , Issue 4 , December 1994 , pp. 1228 - 1244
Copyright
Copyright © Association for Symbolic Logic 1994

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1]Buss, S., Bounded arithmetic, Bibliopolis, Napoli, 1986.Google Scholar
[2]Clote, P., Sequential, machine-independent characterizations of the parallel complexity classes ALOGTIME, ACk, NCk and NC, Feasible mathematics (Buss, S. R. and Scott, P., editors), Birkhäuser, Basel, 1990, pp. 49–69.CrossRefGoogle Scholar
[3]Clote, P. and Takeuti, G., Bounded arithmetic for NC, Alogtime, L and NL, Annals of Pure and Applied Logic, vol. 34 (1992), pp. 73–117.CrossRefGoogle Scholar
[4]Mantzivis, S.-G., Circuits in bounded arithmetic. Part I, Annals of Mathematics and Artificial Intelligence, vol. 6 (1991), pp. 127–156.CrossRefGoogle Scholar
[5]Takeuti, G., RSUV isomorphisms, Arithmetic, proof theory and computational complexity (Clote, P. and Krajíček, J., editors), Oxford University Press, London, 1993, pp. 364–386.CrossRefGoogle Scholar