Effective Mathematics of the Uncountable
- ISBN-10
- 1107521181
- ISBN-13
- 9781107521186
- Series
- Effective Mathematics of the Uncountable
- Category
- Computable functions
- Pages
- 197
- Language
- English
- Published
- 2013
- Authors
- Russell Miller, Noam Greenberg, Denis Roman Hirschfeldt
Description
Classical computable model theory is most naturally concerned with countable domains. There are, however, several methods - some old, some new - that have extended its basic concepts to uncountable structures. Unlike in the classical case, however, no single dominant approach has emerged, and different methods reveal different aspects of the computable content of uncountable mathematics. This book contains introductions to eight major approaches to computable uncountable mathematics: descriptive set theory; infinite time Turing machines; Blum-Shub-Smale computability; Sigma-definability; computability theory on admissible ordinals; E-recursion theory; local computability; and uncountable reverse mathematics. This book provides an authoritative and multifaceted introduction to this exciting new area of research that is still in its early stages. It is ideal as both an introductory text for graduate and advanced undergraduate students, and a source of interesting new approaches for researchers in computability theory and related areas.--
Get the book
Other editions
Similar books
-
Effective Mathematics of the Uncountable
By Russell Miller, Noam Greenberg, Joel David HamkinsComputable model theory is also related to reverse mathematics, the project of classifying theorems of mathematics ... There is no canonical generalization of this sort, and so the kind of effective theory of uncountable mathematics one ...
-
Slicing the Truth: On the Computable and Reverse Mathematics of Combinatorial Principles
By Denis R HirschfeldtLogic Colloquium 2006, Lect. Notes Log. 32, Assoc. Symbol. Logic, Chicago, IL, 2009, 135–183. H. M. Friedman and J. L. Hirst, Weak comparability of well orderings and reverse mathematics, Ann. Pure Appl. Logic 47 (1990) 11–29.
-
Ordinal Computability: An Introduction to Infinitary Machines
By Merlin CarlHandbook of Mathematical Logic, Stud. Logic Found. Math., vol.90, North-Holland, Amsterdam, pp.321–344 (1977). R. Shore. Reverse mathematics, countable and uncountable. ... In: Effective Mathematics of the Uncountable, vol.41. Assoc.
-
Computable Structure Theory: Within the Arithmetic
By Antonio Montalbán[Sla98] Theodore A. Slaman, Relative to any nonrecursive set, Proceedings of the American Mathematical Society, vol. ... [Stu] , Effective model theory: approach via -definability, Effective Mathematics of the Uncountable (Noam ...
-
Pursuit of the Universal: 12th Conference on Computability in Europe, CiE 2016, Paris, France, June 27 - July 1, 2016,...
By Arnold Beckmann, Laurent Bienvenu, Nataša JonoskaMath. Log. Q., Preprint (to appear). arXiv: 1110.2430 Hirschfeldt, D., Jockusch, C.: On notions of computability ... Birkhäuser, Boston (2002) [Sh] Shore, R.A., Mathematics, R., Countable, U.: Effective mathematics of the uncountable.
-
Induction, Bounding, Weak Combinatorial Principles, and the Homogeneous Model Theorem
By Karen Lange, Denis R. Hirschfeldt, Richard A. Shore... Fabrizio Colombo, Irene Sabadini, Daniele C. Struppa, and Jeff Tollaksen, The Mathematics of Superoscillations, 2017 C. L. Fefferman, J. P. Lee-Thorp, and M. I. Weinstein, Topologically Protected States in One-Dimensional Systems, ...
-
Computability and Complexity: Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday
By Noam Greenberg, Alexander Melnikov, Adam DaySoc. 368, 1321– 1359 (2016) Downey, R.: On presentations of algebraic structures. In: Sorbi, A. (ed.) Complexity, Logic, and Recursion Theory, pp. 157–205. Dekker, New York (1997) Downey, R.G.: Computability theory and linear orderings.
-
The Nature of Computation: Logic, Algorithms, Applications: 9th Conference on Computability in Europe, CiE 2013, Milan, Italy, July 1-5, 2013,...
By Benedikt Lowe, Vasco Brattka, Paola BonizzoniWe believe that Theorem [4] ought to be a corollary to a more general result connecting effectiveness properties of the 6 back-and-forth ... To appear in the ASL Lecture Notes in Logic volume Effective Mathematics of the Uncountable ...
-
Turing's Legacy: Developments from Turing's Ideas in Logic
By Rod DowneyGoncharov [122] and Manasse [230] gave examples of intrinsically c.e. relations on computable structures, which are not relatively intrinsically c.e. This result was lifted to higher levels in the hyperarithmetic hierarchy by Goncharov, ...
-
Unconventional Computation: 8th International Conference, UC 2009, Ponta Delgada, Portugal, September 7-11, 2009, Proceedings
By Grzegorz Rozenberg, Nachum Dershowitz, Christian S. CaludeSince these structures are a routine part of the practice of pure and applied mathematics, a growing body of literature has addressed effective mathematics on uncountable structures (see, for instance [1,7,8,9,12,15,17,18]).