"Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions"

entries per page

Filter:

Showing 1 to 20 of 100 entries

Book	Author(s)	Year	Publisher
Enumerability · Decidability Computability: An Introduction to the Theory of Recursive Functions	Hans Hermes	2nd ed. 1969	Springer Berlin Heidelberg
Enumerability, decidability, computability. : An introduction to the theory of recursive functions.	Hans Hermes	1969	Springer
Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions	Hans Hermes	1965	Springer Berlin Heidelberg
Enumerability,decidability,computability: an introduction to the theory of recursive functions	Hans Hermes	1965	Springer-Verlag
Computability: An Introduction to Recursive Function Theory	Nigel Cutland	1980	Cambridge University Press
Theory of Recursive Functions and Effective Computability	Hartley Rogers	1987	The MIT Press
Theory of recursive functions and effective computability	Hartley Rogers	1967	McGraw-Hill
Theory of recursive functions and effective computability.	H. Rogers	1967	McGraw-Hill
Computability, Enumerability, Unsolvability: Directions in Recursion Theory	S. B. Cooper; T. A. Slaman; S. S. Wainer	1996-01	Cambridge University Press
Computability and Decidability: An Introduction for Students of Computer Science	J. Loeckx	1972	Springer Berlin Heidelberg
Computability and decidability: an introduction for students of computer science	Jacques Loeckx	1972	Springer
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel’s Theorems	Roman Murawski	1999	Springer Netherlands
Reflexive Structures: An Introduction to Computability Theory	Luis E. Sanchis	1988	Springer New York
Models of Computation: An Introduction to Computability Theory	Maribel Fernandez	2009	Springer London
A Recursive Introduction to the Theory of Computation	Carl Smith	1994	Springer New York
An Introduction to the Theory of Real Functions	Stanislaw Lojasiewicz	1988	John Wiley & Sons
An introduction to the theory of automorphic functions.	Ford, Lester R.	1915	G. Bell
An introduction to the theory of automorphic functions.	Ford, Lester R.	1915	G. Bell
Real variables: an introduction to the theory of functions	John M. H. Olmsted, John M. H. Olmsted	1959	Appleton-Century-Crofts, Inc.
An introduction to the theory of multiply periodic functions	Henry Frederick Baker	2010	Nabu Press
Boook	Author(s)	Year	Publisher

Showing 1 to 20 of 100 entries

entries per page

Filter:

Showing 1 to 20 of 100 entries

Chapter	Author(s)	Book	Book Authors	Year	Publisher
Decidability and recursive enumerability for fuzzy subsets	Loredana Biacino; Giangiacomo Gerla	Uncertainty and Intelligent Systems: 2nd International Conference on Information Processing and Management of Uncertainty in Knowledge Based Systems IPMU ' 88. Urbino, Italy, July 4-7, 1988. Proceedings	B. Bouchon; L. Saitta; R. R. Yager	1988	Springer Berlin Heidelberg
Recursive Enumerability	Herbert B. Enderton	Computability Theory	Herbert B. Enderton	2011	Academic Press
Recursive enumerability		Degrees of unsolvability	Joseph R. Shoenfield	1972	North-Holland Pub. Co.; American Elsevier
Recursive enumerability		A Tour Through Mathematical Logic	Robert S. Wolf	2005	The Mathematical Association of America
Decidability versus enumerability		Lectures on the Philosophy of Mathematics	Joel David Hamkins	2021	The MIT Press
Computability and Enumerability	Robert I. Soare	Logic and Scientific Methods: Volume One of the Tenth International Congress of Logic, Methodology and Philosophy of Science, Florence, August 1995	Maria Luisa Chiara; Kees Doets; Daniele Mundici; Johan Benthem	1997	Springer Netherlands
Enumerability and Computability	S. Barry Cooper; S. Barry Cooper	Computability Theory	S. Barry Cooper; S. Barry Cooper	2004	Routledge
Computability — Decidability	Maurice Gross; André Lentin	Introduction to Formal Grammars	Maurice Gross; Andre Lentin	1970	Springer Berlin Heidelberg
Recursive Functions; Turing Computability	J. Donald Monk	Mathematical Logic	J. Donald Monk	1976	Springer New York
Recursive Functions and Computability		The Philosophy of Mathematics (Readings in Philosophy)	Jaakko Hintikka (editor)	1969	Oxford University Press
An Introduction to Computability Theory	Jerome Malitz	Introduction to Mathematical Logic: Set Theory Computable Functions Model Theory	Jerome Malitz	1979	Springer New York
2 - Decidability and enumerability		An Introduction to Godel's Theorems	Peter Smith	2007-07	Cambridge University Press
Computable decidability versus enumerability		Lectures on the Philosophy of Mathematics	Joel David Hamkins	2021	The MIT Press
45 Enumerability and Decidability		Introduction to Metalogic: With an Appendix on Type-Theoretical Extensional and Intensional Logic	Imre Ruzsa	1997	Áron Publishers, Hungary
33 Enumerability and decidability		The theory of computer science: A programming approach	J. M Brady	1977	Wiley : distributed in the U.S.A. by Halsted Press
5. Recursive Enumerability		Degrees of Unsolvability	Joseph R. Shoenfield	1971	North-Holland
#B Recursive Enumerability		Theory of Formal Systems. (AM-47), Volume 47 (Annals of Mathematics Studies (47))	Raymond M. Smullyan	1961	Princeton University Press
#B Recursive Enumerability		Theory of Formal Systems	Raymond M. Smullyan	1961	Princeton University Press
Relative Recursive Enumerability		Logic Colloquium 1981: Herbrand Symposium Proceedings	J. Stern	1982	Elsevier Science Ltd
6 Recursive enumerability		Handbook of Mathematical Logic	Barwise J. (ed.)	1977	Elsevier Science
Chapter	Author(s)	Book	Book Authors	Year	Publisher

Showing 1 to 20 of 100 entries

"Enumerability, Decidability, Computability: An Introduction to the Theory of Recursive Functions" - similar Books and Chapters