- About
-
The Global ETD Search service is a free service for researchers
to find electronic theses and dissertations. This service is
provided by the
Networked Digital Library of Theses and Dissertations.
Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
Search results
Showing 1 to 10 of 19 (0.057 seconds)Spelling suggestions: "subject:"recursive theory"" "subject:"recursively theory""
| 1 |
Contributions to [alpha]- and [beta]-recursion theoryMaass, Wolfgang, January 1978 (has links)
Habilitationsschrift--München, 1977. / Bibliography: p. 105-107.
|
| 2 |
Concerning d-recursively enumerable sets and s-reducibility of #SIGMA#2̲ setsWatson, P. R. January 1988 (has links)
No description available.
|
| 3 |
Constructing higher-order de Bruijn graphs /Hunt, D'Hania J. January 2002 (has links) (PDF)
Thesis (M.S. in Applied Mathematics)--Naval Postgraduate School, June 2002. / Thesis advisor(s): Harold Fredricksen, Craig W. Rasmussen. Includes bibliographical references (p. 45-46). Also available online.
|
| 4 |
E-recursively enumerable degreesGriffor, Edward R. January 1980 (has links)
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1980. / Vita. / Bibliography: leaves 161-163. / by Edward R. Griffor. / Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1980.
|
| 5 |
Recursion on setsHoole, M. R. R. January 1982 (has links)
No description available.
|
| 6 |
Applications of computability theory to prime models and differential geometry /Csima, Barbara F. January 2003 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Mathematics, June 2003. / Includes bibliographical references. Also available on the Internet.
|
| 7 |
Algebraische und kombinatorische Aspekte der Harder-Narasimhan-Rekursion und ihrer UmkehrungMersmann, Gerd. January 1999 (has links)
Thesis (doctoral)--Bonn, 1998. / Includes bibliographical references (p. [273]-[274]).
|
| 8 |
Computability, definability, categoricity, and automorphisms /Miller, Russell Geddes. January 2000 (has links)
Thesis (Ph. D.)--University of Chicago, Dept. of Mathematics, June 2000. / Includes bibliographical references. Also available on the Internet.
|
| 9 |
Aspects of Recursion Theory in Arithmetical Theories and CategoriesSteimle, Yan 25 November 2019 (has links)
Traditional recursion theory is the study of computable functions on the natural numbers. This thesis considers recursion theory in first-order arithmetical theories and categories, thus expanding the work of Ritchie and Young, Lambek, Scott, and Hofstra.
We give a complete characterisation of the representability of computable functions in arithmetical theories, paying attention to the differences between intuitionistic and classical theories and between theories with and without induction. When considering recursion theory from a category-theoretic perspective, we examine syntactic categories of arithmetical theories. In this setting, we construct a strong parameterised natural numbers object and give necessary and sufficient conditions to construct a Turing category associated to an intuitionistic arithmetical theory with induction.
|
| 10 |
Estimating correlations between certain operation finishing times to approximate the transient performance of stochastic assembly systems /Saboo, Surendra January 1986 (has links)
No description available.
|
Page generated in 0.0613 seconds