Search results

...ons'''. It is related to the [[fast-growing hierarchy]] and [[slow-growing hierarchy]]. ...matics |volume=35 |pages=87&ndash;94}}</ref> in which Hardy exhibits a set of reals with cardinality <math>\aleph_1</math>. ...

...08-1500814-9/S0002-9947-1908-1500814-9.pdf Continuous Increasing Functions of Finite and Transfinite Ordinals] (1908).</ref> ...://www.sciencedirect.com/science/article/pii/0012365X91903464 Fast growing functions and Ramsey theorems]" (1991), [[Discrete Mathematics (journal)|Discrete Mat ...

...of [[natural numbers]], {0, 1, ...}). It contrasts with the [[fast-growing hierarchy]]. ...so special about Kruskal's theorem and the ordinal Γ₀? A survey of some results in proof theory] (2012, p.63). Accessed 8 May 2023.</ref> ...

...rchy.svg|250px|thumb|right|Pictorial representation of the polynomial time hierarchy. The arrows denote inclusion.]] ...blems and algorithms. It involves the research of both internal structures of various complexity classes and the relations between different complexity c ...

{{Short description|Classes of partial recursive functions}} ...tain class, according to a fixed [[Gödel number]]ing of partial computable functions. ...

| conference = ACM Symposium on Theory of Computing | title = Classes of Computable Functions Defined by Bounds on Computation: Preliminary Report ...

{{Short description|Ordinal-indexed family of rapidly increasing functions: ℕ→ℕ}} ...ovide a natural way to classify [[computable function]]s according to rate-of-growth and [[Computational complexity theory|computational complexity]]. ...

...theories]] of [[classical logic|classical mathematics]] are also theorems of intuitionistic mathematics. It is named after its discoverer, [[Harvey Frie ...]] [[subformula]] ''C'' of ''A'' by {{nowrap|''C'' ∨ ''B''}}. For purposes of the translation, ⊥ is considered to be an atomic formula as well; hence it ...

...mental operations'''. Other authors sometimes use a slightly different set of about 8 to 10 operations, usually denoted ''G''₁, ''G''<sub>2</s {{harvtxt|Gödel|1940}} used the following eight operations as a set of Gödel operations (which he called fundamental operations): ...

...t functions''' or '''primitive recursive ordinal functions''' are analogs of [[primitive recursive function]]s, defined for [[Set (mathematics)|sets]] o ...m the following basic functions by repeatedly applying the following rules of substitution and recursion: ...

...hey are also used in the application of recursion theory to other branches of mathematics&nbsp;(Cenzer 1999, p.&nbsp;39). ...et 2^ω consists of all infinite sequences of 0s and 1s (that is, functions from {{nowrap|1=&omega; = {0, 1, 2, ...}}} to the set {{nowrap|1={0,1}}}). ...

...tial function such as <math>2^n</math> for a bounded number <math>k</math> of iterations, Thus, <math>\mathsf{ELEMENTARY}</math> is the union of the classes ...

...als with sum-of-squares constraints. For problems with sum-of-squares cost functions, see [[Least squares]].}} ...sum-of-squares optimization is also known as the '''Lasserre hierarchy''' of relaxations in [[semidefinite programming]]. ...

...(OT, <)}</math>.<ref name=":0" /> Lastly, it can be expressed as the limit of the sequence: <math>\varepsilon_0 = \psi_0(\Omega)</math>, <math>\mathsf{BH {{Main article|2 = Buchholz psi functions}} ...

...theories of bounded arithmetic as formal systems capturing various levels of feasible reasoning (see below). ...Arithmetic|journal=Bibliopolis, Naples, Italy, 1986.}}</ref> and a number of other logicians. ...

...itle=A new system of proof-theoretic ordinal functions|url=|journal=Annals of Pure and Applied Logic|language=en|volume=32|pages=195–207|doi=10.1016/0168 | title = Proof Theory of Impredicative Subsystems of Analysis ...

...can Mathematical Society]], xii+162 pp., 1996</ref> The algorithmic theory of Graver bases and its application to integer programming is described by [[S ...sp;''n'' integer matrix <math>A</math> is the finite set <math>G(A)</math> of minimal elements in the set ...

...ure about [[intersection number]]s of stable classes on the [[moduli space of curves]], introduced by [[Edward Witten]] in the paper {{harvs|txt|last=Wit ...intersection numbers should satisfy the differential equations of the KdV hierarchy. ...

...rt description|Set of all true first-order statements about the arithmetic of natural numbers}} ...dard model]] of the [[Peano axioms]] in the [[Signature (logic)|language]] of the first-order Peano axioms. ...

...tools and [[type systems|type theory]] that can control the resource usage of programs in a formally verifiable sense.<ref>{{Cite web |title=DICE 2014 – == Implicit Representations of polynomial time == ...