Generalized recursion theory II. Proceedings of the 1977 Oslo Symposium
alpha-recursionbeta recursioncontinuous functionalsextendability of ZF modelsKM theory of classesOsloProceedingsRecursion theorySymposiumvon Neumann hierarchy
Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) Set-theoretic model theory (03C55) Recursive functions and relations, subrecursive hierarchies (03D20) Recursively (computably) enumerable sets and degrees (03D25) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Higher-type and set recursion theory (03D65) Inductive definability (03D70) Abstract and axiomatic computability and recursion theory (03D75) Descriptive set theory (03E15) Set theory (03E99)
- Theories with self-application and computational complexity.
- Understanding uniformity in Feferman's explicit mathematics
- Systems of explicit mathematics with non-constructive -operator and join
- A feasible theory of truth over combinatory algebra
- Locally hyperarithmetical induction
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories
- The provably terminating operations of the subsystem PETJ of explicit mathematics
- Generalizing classical and effective model theory in theories of operations and classes
This page was built for publication: Generalized recursion theory II. Proceedings of the 1977 Oslo Symposium
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1148899)