The notion of recursiveness is treated in a model-theoretical way by using a particular instance of Kreisel's definition of 'invariant definability'. Naming the chosen notion 'finite describability', a number of basic definitions and properties are defined and proved. As one would expect, these properties coincide with the ones for recursion theory. The equivalences of finite describability and recursiveness bring model theory and recursion theory slightly together. / Science, Faculty of / Mathematics, Department of / Graduate
| Identifer | oai:union.ndltd.org:UBC/oai:circle.library.ubc.ca:2429/34303 |
| Date | January 1973 |
| Creators | Yeung, Stella Mei-Yee |
| Publisher | University of British Columbia |
| Source Sets | University of British Columbia |
| Language | English |
| Detected Language | English |
| Type | Text, Thesis/Dissertation |
| Rights | For non-commercial purposes only, such as research, private study and education. Additional conditions apply, see Terms of Use https://open.library.ubc.ca/terms_of_use. |
Page generated in 0.0018 seconds