# Search results

• ...[[Universal function|Universal function]]. All possible forms of multiple recursion can be reduced to the following normal form: It is more common to speak of simultaneous recursion, rather than multiple recursion; cf., e.g., [[#References|[a1]]].
3 KB (389 words) - 17:14, 7 February 2011
• ...the basis of which lies a certain synthesis of ideas in the theory of sets and algorithms (see [[#References|[2]]]). ...TD valign="top">[2]</TD> <TD valign="top"> J. Barwise, "Admissible sets and structures" , Springer (1975)</TD></TR></table>
1 KB (150 words) - 17:27, 7 February 2011
• ...ained by primitive recursion from an $n$-place function $g(x_1,\dots,x_n)$ and an $(n+2)$-place function $h(x_1,\dots,x_n,y,z)$ if for all natural number and
2 KB (371 words) - 21:13, 2 November 2014
• ...ly enumerable. Many sets playing an important role in recursive set theory and its applications are productive (e.g. the set of all Gödel numbers of gene ...lign="top"> H. Rogers jr., "Theory of recursive functions and effective computability" , McGraw-Hill (1967) pp. 164–165</TD></TR></table>
2 KB (288 words) - 17:33, 15 November 2014
• ...re of interest from the point of the view of the recursive analogue of the theory of [[cardinal number]]s. In [[recursive set theory]] and its applications one also uses certain special subclasses of the class of i
1 KB (194 words) - 11:14, 3 September 2017
• <TR><TD valign="top">[2]</TD> <TD valign="top"> A.I. Mal'tsev, "Algorithms and recursive functions" , Wolters-Noordhoff (1970) (Translated from Russian)
2 KB (253 words) - 12:32, 17 January 2016
• ...umber of the operations of composition and [[Primitive recursion|primitive recursion]]. ...utable and the operators of superposition and primitive recursion preserve computability, the set of all primitive recursive functions is a subclass of the class of
10 KB (1,339 words) - 16:56, 7 February 2011
• ...t]]; in other words, a set $A$ is creative if it is recursively enumerable and if there exists a [[partial recursive function]] $\phi(x)$ such that, for a ...numerable sets. The concept of creativity generalizes to sequences of sets and other objects.
2 KB (295 words) - 06:52, 28 September 2016
• ...://www.encyclopediaofmath.org/legacyimages/r/r080/r080260/r0802608.png" /> and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/l ...th.org/legacyimages/r/r080/r080260/r08026019.png" /> by means of primitive recursion if for any values of <img align="absmiddle" border="0" src="https://www.enc
9 KB (1,216 words) - 17:03, 7 February 2011
• ...in such a way that each mark can change position only finitely many times, and in its final position the mark must necessarily be the mark of an element t ...times allowed that the marks change position an infinite number of times), and therefore it is often better to speak of priority methods.
3 KB (523 words) - 17:16, 7 February 2011
• ...rsive methods). Finally, in set theory [[Transfinite recursion|transfinite recursion]] is often used. ...rable from a more accurate description of the concept of recursion itself, and for this it is essential to establish which type of formal expressions can
23 KB (3,188 words) - 16:56, 7 February 2011
• ...lign="top"> H. Rogers jr., "Theory of recursive functions and effective computability" , McGraw-Hill (1967) pp. 164–165</TD></TR> ...tin, "Bounded Queries in Recursion Theory", Progress in Computer Science and Applied Logic '''16'''. Springer (1999) ISBN 0817639667</TD></TR>
2 KB (297 words) - 22:37, 10 January 2016
• ...duction (see below). It subsumes addition, multiplication, exponentiation, and all higher-order analogues of these operations. Because of this it grows to ...ermitted in primitive recursion fail to capture completely the notion of "computability" (cf. also [[Computable function|Computable function]]); one needs to perm
10 KB (1,437 words) - 17:27, 7 February 2011
• .../www.encyclopediaofmath.org/legacyimages/h/h047/h047210/h04721034.png" />, and their complements (the <img align="absmiddle" border="0" src="https://www.e In mathematical logic, hierarchies of sets and relations given by the formulas of logical languages are considered (see [[
16 KB (2,267 words) - 17:09, 7 February 2011
• ..., by its table; the number of arguments of the function may depend on $a$) and numbers $b_1,\ldots,b_n$ such that $a\in A$ is equivalent to the truth of $...quivalence relation$\equiv_{tt}$, namely$A\equiv_{tt}B$if$A\leq_{tt}B$and$B\leq_{tt}A. The equivalence classes for this relation are called truth-t 3 KB (414 words) - 21:57, 16 January 2016 • ...ed his machines (cf. [[Turing machine]]) and showed that Turing computable and lambda definable are equivalent notions. These are arguments for the Church ...th.org/legacyimages/l/l057/l057000/l05700038.png" /> occurs free and bound and <img align="absmiddle" border="0" src="https://www.encyclopediaofmath.org/l 33 KB (4,575 words) - 18:23, 19 December 2014 • ...lassifies subsets of natural numbers from the point of view of algorithms, and also studies the structures arising as a result of such a classification. F .../www.encyclopediaofmath.org/legacyimages/r/r080/r080340/r08034018.png" />, and the ordinary recursive sets are "recursive" relative to any set. In its w 29 KB (4,021 words) - 05:55, 9 November 2018 • where theR_i$and$R$are atomic formulas (and$R$could also be$x_p = x_q$or$\texttt{false}$. (Strict) propositional H ...exttt{false}$. In the strict case $q = \texttt{false}$ is excluded. A Horn theory is a set of Horn clauses.
7 KB (1,111 words) - 06:59, 21 October 2016
• Please remove this comment and the {{TEX|auto}} line below, ...m for the solution of a given infinite series of problems of a given type, and of finding such an algorithm if it exists.
21 KB (3,278 words) - 16:10, 1 April 2020
• and by Springer after that. The encyclopaedia goes back to the Soviet The installed software and extensions for this project can be seen here:
229 KB (35,368 words) - 14:24, 27 May 2020