General recursion theory: An axiomatic approach

Main
Mathematics
General recursion theory: An axiomatic...

General recursion theory: An axiomatic approach

J. E. Fenstad

0 / 0

Jak bardzo podobała Ci się ta książka?

Jaka jest jakość pobranego pliku?

Pobierz książkę, aby ocenić jej jakość

Jaka jest jakość pobranych plików?

Kategorie:

Rok:

1980

Wydanie:

1

Wydawnictwo:

Springer

Język:

english

Strony:

498

ISBN 10:

3540093494

ISBN 13:

9783540093497

Serie:

Perspectives in Mathematical Logic

Plik:

DJVU, 1.73 MB

IPFS:

,

english, 1980

Ściągnij (djvu, 1.73 MB)

Trwa konwersja do

Konwersja do nie powiodła się

Możesz być zainteresowany

John N. Crossley (ed.) — Sets, Models and Recursion Theory (Logic Colloquium'65)

Davis, Martin;Sigal, Ron;Weyuker, Elaine J — Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science

Samson Abramsky, Dov M Gabbay, Thomas S E Maibaum (eds.) — Handbook of Logic in Computer Science. Volume 5: Logic and Algebraic Methods

Yiannis N. Moschovakis (Eds.) — Elementary Induction on Abstract Structures

Fenstad J.E., Hinman P.G. (eds.) — Generalized Recursion Theory: Proceedings of the 1972 Oslo Symposium

Paris Logic Group — Logic Colloquium '85: Proceedings Orsay, 1985

Fenstad J.E., Gandy R.O., Sacks G.E. (eds.) — Generalized Recursion Theory II: Proceedings of the 1977 Oslo Symposium

Jon Barwise, H. Jerome Keisler, Kenneth Kunen — The Kleene Symposium: Proceedings Madison, 1978

Edward R. Griffor (ed.) — Handbook of Computability Theory

Yiannis N Moschovakis — Elementary induction on abstract structures

Martin Davis — Computability and Unsolvability

F. R. Drake, S. S. Wainer — Recursion Theory, its Generalisations and Applications

P. T. Johnstone — Notes on Logic and Set Theory

Gandy R.O., Yates C.M.E. (eds.) — Logic Colloquium '69: Proceedings Manchester, 1969

Wilfried Sieg (ed.) — Logic and Computation: Proceedings of a Workshop Held at Carnegie Mellon University, June 30-July 2, 1987

Jens E. Fenstad — General Recursion Theory: An Axiomatic Approach

George Tourlakis — Theory of Computation

Jon Barwise — Admissible Sets and Structures

Gerald E. Sacks — Higher Recursion Theory

Sieg, Wilfried; Sommer, Richard; Talcott, Carolyn L et al. (eds.) — Reflections on the foundations of mathematics: essays in Honor of Solomon Feferman: lecture notes in logic 15

Cori, Rene; Razborov, Alexander; Todorcevic, Stevo; Wood, Carol (eds.) — Logic colloquium 2000 (hardcover): lecture notes in logic, 19

Torkel Franzén — Inexhaustibility: A Non-Exhaustive Treatment

Rene Cori, Alexander Razborov, Stevo Todorcevic, Carol Wood (eds.) — Logic Colloquium 2000

Peter G. Hinman — Fundamentals of mathematical logic

S. Barry Cooper, Andrea Sorbi — Computability in Context: Computation and Logic in the Real World

Cooper S.B., Sorbi A. (eds.) — Computability in context. Computation and logic in the real world

George Tourlakis — Computability

Chi Tat Chong; Liang Yu — Recursion Theory: Computational Aspects of Definability

Ulrich Berger, Hannes Diener, Peter Schuster, Monika Seisenberger — Logic, Construction, Computation

Ulrich Berger (editor); Hannes Diener (editor); Peter Schuster (editor); Monika Seisenberger (editor) — Logic, Construction, Computation

Gerhard Jäger, Wilfried Sieg — Feferman on Foundations

J. Barwise — Admissible sets and structures: An approach to definability theory

Peter Hinman — Recursion-theoretic hierarchies

J. E. Fenstad — General Recursion Theory: An Axiomatic Approach

Gerald E. Sacks — Higher Recursion Theory

Najbardziej popularne frazy