Cargando…

Ordinal definability and recursion theory: the Cabal Seminar

Detalles Bibliográficos
Autores principales:	Kechris, Alexander S, Löwe, Benedikt, Steel, John R
Lenguaje:	eng
Publicado:	Cambridge University Press 2016
Materias:	Mathematical Physics and Mathematics
Acceso en línea:	http://cds.cern.ch/record/2634163

Ejemplares similares

Caltech-UCLA Cabal Logic Seminar 76–77
por: Kechris, Alexander, et al.
Publicado: (1978)

Caltech-UCLA Logic Seminar
por: Kechris, Alexander, et al.
Publicado: (1988)

Recursion theory: computational aspects of definability
por: Chong, Chi Tat, et al.
Publicado: (2015)

Recursion theory
por: Shoenfield, Joseph R
Publicado: (2017)

Higher recursion theory
por: Sacks, Gerald E
Publicado: (2017)

Recursive model theory
por: Chang, C C, et al.
Publicado: (1998)

Recursion Theory Week
por: Ambos-Spies, Klaus, et al.
Publicado: (1990)

Recursion Theory Week
por: Ebbinghaus, Heinz-Dieter, et al.
Publicado: (1985)

Bounded queries in recursion theory
por: Gasarch, William I, et al.
Publicado: (1999)

Recursion Theory and Computational Complexity
por: Lolli, G
Publicado: (2011)

Fundamentals of generalized recursion theory
por: Fitting, Melvin
Publicado: (1981)

Techniques of admissible recursion theory
por: Chong, Chi-Tat
Publicado: (1984)

Caltech-UCLA Logic Seminar
por: Kechris, Alexander, et al.
Publicado: (1981)

Caltech-UCLA Logic Seminar
por: Kechris, Alexander, et al.
Publicado: (1983)

Theory of recursive functions and effective computability
por: Rogers, Hartley
Publicado: (1967)

General recursion theory: an axiomatic approach
por: Fenstad, Jens E
Publicado: (2017)

Recursion theory: lecture notes in logic 1
por: Shoenfield, Joseph R
Publicado: (2018)

Recursive number theory: a development of recursive arithmetic in a logic-free equation calculus
por: Goodstein, Reuben Louis
Publicado: (1957)

Computability, enumerability, unsolvability: directions in recursion theory
por: Cooper, S Barry, et al.
Publicado: (1996)

Classical recursion theory: the theory of functions and sets of natural numbers
por: Odifreddi, Piergiorgio
Publicado: (1992)

Enumerability · decidability computability: an introduction to the theory of recursive functions
por: Hermes, Hans
Publicado: (1969)

Geometrical interpretation of the topological recursion, and integrable string theories
por: Eynard, Bertrand, et al.
Publicado: (2009)

Enumerability · decidability computability: an introduction to the theory of recursive functions
por: Hermes, Hans
Publicado: (1965)

Recursiveness
por: Eilenberg, Samuel, et al.
Publicado: (1970)

Algebraic computability and enumeration models: recursion theory and descriptive complexity
por: Nourani, Cyrus F
Publicado: (2016)

Thinking recursively
por: Roberts, Eric S
Publicado: (1986)

Recursive functionals
por: Sanchis, Luis E
Publicado: (1992)

Classical descriptive set theory
por: Kechris, Alexander S
Publicado: (1995)

Category Theory Seminar
por: Kelly, Gregory
Publicado: (1974)

Seminar on Approximation Theory
por: Saff, Edward
Publicado: (1987)

Recursive Partitioning and Applications
por: Zhang, Heping, et al.
Publicado: (2010)

Super-recursive algorithms
por: Burgin, Mark
Publicado: (2005)

Recursion on the countable functionals
por: Normann, Dag
Publicado: (1980)

Recursion-theoretic hierarchies
por: Hinman, Peter G
Publicado: (2017)

Stochastic approximation and recursive estimation
por: Nevelson, M B, et al.
Publicado: (1976)

The descriptive set theory of Polish group actions
por: Becker, Howard, et al.
Publicado: (1996)

Descriptive set theory and the structure of sets of uniqueness
por: Kechris, Alexander S, et al.
Publicado: (1987)

Seminar on Potential Theory II
por: Bauer, Heinz
Publicado: (1971)

Theory to Practice : Proceedings of a Seminar
por: Lambrecht, R, et al.
Publicado: (1983)

Ordinal invariants in topology
por: Kannan, V
Publicado: (1981)

Cannot write session to /tmp/vufind_sessions/sess_8g6iq6ppbm3p0mbuch0a7g7eg6