The Foundations of Computability Theory, Robič Borut
Автор: George S. Boolos Название: Computability and logic ISBN: 0521701465 ISBN-13(EAN): 9780521701464 Издательство: Cambridge Academ Рейтинг: Цена: 33790.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Computability and Logic has become a classic because of its accessibility to students without a mathematical background and because it covers not simply the staple topics of an intermediate logic course, but also a large number of optional topics, from Turing`s theory of computability to Ramsey`s theorem. This fifth edition was first published in 2007.
Автор: Omodeo Eugenio G., Policriti Alberto Название: Martin Davis on Computability, Computational Logic, and Mathematical Foundations ISBN: 3319824430 ISBN-13(EAN): 9783319824437 Издательство: Springer Рейтинг: Цена: 93160.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book presents a set of historical recollections on the work of Martin Davis and his role in advancing our understanding of the connections between logic, computing, and unsolvability.
Автор: Merlin Carl Название: Ordinal Computability: An Introduction to Infinitary Machines ISBN: 3110495627 ISBN-13(EAN): 9783110495621 Издательство: Walter de Gruyter Цена: 123910.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: Ordinal Computability discusses models of computation obtained by generalizing classical models, such as Turing machines or register machines, to transfinite working time and space. In particular, recognizability, randomness, and applications to other areas of mathematics are covered.
Автор: Eugenio G. Omodeo; Alberto Policriti Название: Martin Davis on Computability, Computational Logic, and Mathematical Foundations ISBN: 3319418416 ISBN-13(EAN): 9783319418414 Издательство: Springer Рейтинг: Цена: 111790.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book presents a set of historical recollections on the work of Martin Davis and his role in advancing our understanding of the connections between logic, computing, and unsolvability.
Название: Structure and randomness in computability and set theory ISBN: 9813228229 ISBN-13(EAN): 9789813228221 Издательство: World Scientific Publishing Рейтинг: Цена: 126720.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание:
This volume presents some exciting new developments occurring on the interface between set theory and computability as well as their applications in algebra, analysis and topology. These include effective versions of Borel equivalence, Borel reducibility and Borel determinacy. It also covers algorithmic randomness and dimension, Ramsey sets and Ramsey spaces. Many of these topics are being discussed in the NSF-supported annual Southeastern Logic Symposium.
Contents: Limits of the Kucerea-Gacs Coding Method (George Barmpalias and Andrew Lewis-Pye); Infinitary partition properties of sums of selective ultrafilters (Andreas Blass); Semiselective Coideals and Ramsey Sets (Carlos DiPrisco and Leonardo Pacheco); Survey on Topological Ramsey Spaces Dense in Forcings (Natasha Dobrinen); Higher Computability in the Reverse Mathematics of Borel Determinacy (Sherwood Hachtman); Computability and Definability (Valentina Harizanov); A Ramsey Space of Infinite Polyhedra and the Random Polyhedron (Jose G Mijares Palacios and Gabriel Padilla); Computable Reducibility for Cantor Space (Russell G Miller); Information vs Dimension - An Algorithmic Perspective (Jan Reimann);
Readership: Graduate students and researchers interested in the interface between set theory and computability.
Автор: Centrone Stefania, Negri Sara, Sarikaya Deniz Название: Mathesis Universalis, Computability and Proof ISBN: 3030204499 ISBN-13(EAN): 9783030204495 Издательство: Springer Цена: 111790.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: 1. Introduction: Mathesis Universalis, Proof and ComputationStefania Centrone 2. Diplomacy of Trust in the European CrisisEnno Aufderheide 3. Mathesis Universalis and Homotopy Type TheorySteve Awodey 4. Note on the Benefit of Proof Representations by NameMatthias Baaz 5. Constructive Proofs of Negated StatementsJosef Berger and Gregor Svindland 6. Constructivism in Abstract MathematicsUlrich Berger 7. Addressing Circular Definitions via Systems of ProofsRiccardo Bruni 8. The Monotone Completeness Theorem in Constructive Reverse MathematicsHajime Ishihara and Takako Nemoto 9. From Mathesis Universalis to Fixed Points and Related Set-Theoretic ConceptsGerhard Jдger and Silvia Steila 10. Through an Inference Rule, DarklyRoman Kuznets 11. Objectivity and Truth in Mathematics: A Sober Non-Platonist PerspectiveGodehard Link 12. From Mathesis Universalis to Provability, Computability, and ConstructivityKlaus Mainzer 13. Analytic Equational Proof Systems for Combinatory Logic and λ-Calculus: a SurveyPierluigi Minari 14. Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful ProgramsThomas Powell 15. The Concepts of Proof and GroundDag Prawitz 16. On Relating Theories: Proof-Theoretical ReductionMichael Rathjen and Michael Toppel 17. Program Extraction from Proofs: the Fan Theorem for Uniformly Coconvex BarsHelmut Schwichtenberg 18. Counting and Numbers, from Pure Mathesis to Base Conversion AlgorithmsJan von Plato 19. Point-Free Spectra of Linear SpreadsDaniel Wessel
Автор: John Longley; Dag Normann Название: Higher-Order Computability ISBN: 3662479915 ISBN-13(EAN): 9783662479919 Издательство: Springer Рейтинг: Цена: 121110.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This book offers a self-contained exposition of the theory of computability in a higher-order context, where `computable operations` may themselves be passed as arguments to other computable operations.
Автор: Pour-El Название: Computability in Analysis and Physics ISBN: 1107168449 ISBN-13(EAN): 9781107168442 Издательство: Cambridge Academ Рейтинг: Цена: 121440.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: This is the first graduate-level treatment of computable analysis within the tradition of classical mathematical reasoning. The authors are concerned with the computability or noncomputability of standard processes in analysis and physics. The book is self-contained and serves well as an introduction to research in this area.
Автор: Ershov, I?U?rii? Leonidovich. Название: Definability and computability / ISBN: 0306110393 ISBN-13(EAN): 9780306110399 Издательство: Springer Рейтинг: Цена: 213360.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: In this book, Yurii L. Ershov posits the view that computability-in the broadest sense-can be regarded as the Sigma-definability in the suitable sets. He presents a new approach to providing the G del incompleteness theorem based on systematic use of the formulas with the restricted quantifiers. The volume also includes a novel exposition on the foundations of the theory of admissible sets with urelements, using the Gandy theorem throughout the theory's development. Other topics discussed are forcing, Sigma-definability, dynamic logic, and Sigma-predicates of finite types.
Автор: Rogers, H. Название: Theory of recursive functions and effective computability / ISBN: 0262680521 ISBN-13(EAN): 9780262680523 Издательство: MIT Press Рейтинг: Цена: 56430.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: (Reprint of the 1967 edition)
Автор: Stefania Centrone; Sara Negri; Deniz Sarikaya; Pet Название: Mathesis Universalis, Computability and Proof ISBN: 3030204464 ISBN-13(EAN): 9783030204464 Издательство: Springer Рейтинг: Цена: 93160.00 T Наличие на складе: Есть у поставщика Поставка под заказ. Описание: In a fragment entitled Elementa Nova Matheseos Universalis (1683?) Leibniz writes “the mathesis […] shall deliver the method through which things that are conceivable can be exactly determined”; in another fragment he takes the mathesis to be “the science of all things that are conceivable.” Leibniz considers all mathematical disciplines as branches of the mathesis and conceives the mathesis as a general science of forms applicable not only to magnitudes but to every object that exists in our imagination, i.e. that is possible at least in principle. As a general science of forms the mathesis investigates possible relations between “arbitrary objects” (“objets quelconques”). It is an abstract theory of combinations and relations among objects whatsoever.In 1810 the mathematician and philosopher Bernard Bolzano published a booklet entitled Contributions to a Better-Grounded Presentation of Mathematics. There is, according to him, a certain objective connection among the truths that are germane to a certain homogeneous field of objects: some truths are the “reasons” (“Gr?nde”) of others, and the latter are “consequences” (“Folgen”) of the former. The reason-consequence relation seems to be the counterpart of causality at the level of a relation between true propositions. Arigorous proof is characterized in this context as a proof that shows the reason of the proposition that is to be proven. Requirements imposed on rigorous proofs seem to anticipate normalization results in current proof theory.The contributors of Mathesis Universalis, Computability and Proof, leading experts in the fields of computer science, mathematics, logic and philosophy, show the evolution of these and related ideas exploring topics in proof theory, computability theory, intuitionistic logic, constructivism and reverse mathematics, delving deeply into a contextual examination of the relationship between mathematical rigor and demands for simplification.
Казахстан, 010000 г. Астана, проспект Туран 43/5, НП2 (офис 2) ТОО "Логобук" Тел:+7 707 857-29-98 ,+7(7172) 65-23-70 www.logobook.kz
