Listing 1 - 10 of 10 |
Sort by
|
Choose an application
Descriptive set theory --- Théorie descriptive des ensembles --- 510.22 --- #WWIS:ALTO --- Set theory --- Set theory. Set theoretic approach. Theory of order types, of ordinal and cardinal numbers --- Descriptive set theory. --- 510.22 Set theory. Set theoretic approach. Theory of order types, of ordinal and cardinal numbers --- Théorie descriptive des ensembles --- Ensembles, Théorie descriptive des
Choose an application
Now available in paperback, this monograph is a self-contained exposition of the main results and methods of descriptive set theory. It develops all the necessary background material from logic and recursion theory, and treats both classical descriptive set theory and the effective theory developed by logicians.
Descriptive set theory. --- Logic, Symbolic and mathematical. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism
Choose an application
Set theory --- #KVIV:BB --- #KOPO:Prof. R. Holvoet --- Aggregates --- Classes (Mathematics) --- Ensembles (Mathematics) --- Mathematical sets --- Sets (Mathematics) --- Theory of sets --- Logic, Symbolic and mathematical --- Mathematics
Choose an application
Choose an application
Provability, Computability and Reflection.
Choose an application
Now available in paperback, this monograph is a self-contained exposition of the main results and methods of descriptive set theory. It develops all the necessary background material from logic and recursion theory, and treats both classical descriptive set theory and the effective theory developed by logicians.
Choose an application
Choose an application
This book presents and applies a framework for studying the complexity of algorithms. It is aimed at logicians, computer scientists, mathematicians and philosophers interested in the theory of computation and its foundations, and it is written at a level suitable for non-specialists. Part I provides an accessible introduction to abstract recursion theory and its connection with computability and complexity. This part is suitable for use as a textbook for an advanced undergraduate or graduate course: all the necessary elementary facts from logic, recursion theory, arithmetic and algebra are included. Part II develops and applies an extension of the homomorphism method due jointly to the author and Lou van den Dries for deriving lower complexity bounds for problems in number theory and algebra which (provably or plausibly) restrict all elementary algorithms from specified primitives. The book includes over 250 problems, from simple checks of the reader's understanding, to current open problems.
Choose an application
Mathematical logic --- 517.1 <061.3> --- 510 --- Introduction to analysis--?<061.3> --- Fundamental and general considerations of mathematics. Foundations, logic etc. --- 510 Fundamental and general considerations of mathematics. Foundations, logic etc. --- 517.1 <061.3> Introduction to analysis--?<061.3> --- Logique mathématique --- Récursivité, Théorie de la --- Théorie des ensembles --- Théorie des modèles
Choose an application
Set theory --- Théorie des ensembles --- Théorie des ensembles. --- Logique mathématique
Listing 1 - 10 of 10 |
Sort by
|