Andrea Sorbi
Complexity, Logic, and Recursion Theory
221,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
Melden Sie sich
hier
hier
für den Produktalarm an, um über die Verfügbarkeit des Produkts informiert zu werden.
Andrea Sorbi
Complexity, Logic, and Recursion Theory
- Gebundenes Buch
Presents coverage of research at the interface of logic, computability theory, and theoretical computer science. This book integrates two approaches to computability.
Andere Kunden interessierten sich auch für
- Jorg BewersdorffLuck, Logic, and White Lies68,99 €
- Ubiquitous Computing, Complexity, and Culture303,99 €
- Roman IngardenThe Literary Work of Art: An Investigation of the Borderlines of Ontology, Logic, and Theory of Language36,99 €
- White Logic, White Methods77,99 €
- Sylvain NeuvelA History of What Comes Next9,49 €
- James L. HeinDiscrete Structures, Logic, And Computability99,99 €
- Kari GrainCritical Hope: How to Grapple with Complexity, Lead with Purpose, and Cultivate Transformative Social Change17,99 €
-
-
-
Presents coverage of research at the interface of logic, computability theory, and theoretical computer science. This book integrates two approaches to computability.
Produktdetails
- Produktdetails
- Lecture Notes in Pure and Applied Mathematics
- Verlag: Taylor & Francis Ltd
- Seitenzahl: 380
- Erscheinungstermin: 7. Juni 2019
- Englisch
- Abmessung: 263mm x 184mm x 27mm
- Gewicht: 842g
- ISBN-13: 9781138404106
- ISBN-10: 1138404101
- Artikelnr.: 57050964
- Lecture Notes in Pure and Applied Mathematics
- Verlag: Taylor & Francis Ltd
- Seitenzahl: 380
- Erscheinungstermin: 7. Juni 2019
- Englisch
- Abmessung: 263mm x 184mm x 27mm
- Gewicht: 842g
- ISBN-13: 9781138404106
- ISBN-10: 1138404101
- Artikelnr.: 57050964
Andrea Sorbi is Associate Professor in the Department of Mathematics at the University of Siena, Italy. The author or coauthor of several key professional papers and book chapters on computability theory and mathematical logic, he is a member of the American Mathematical Society and the Association for Symbolic Logic, among other organizations. Dr. Sorbi received the Ph.D. degree (1987) in mathematics from the City University of New York, New York.
Preface
Contributors
Resource-Bounded Measure and Randomness
Degree Structures in Local Degree Theory
Compressibility of Infinite Binary Sequences
Beyond Gödel's Theorem: The Failure to Capture Information Content
Progressions of Theories of Bounded Arithmetic
On Presentations of Algebraic Structures
Witness-Isomorphic Reductions and Local Search
A Survey of Inductive Inference with an Emphasis on Queries
A Uniformity of Degree Structures
Short Course on Logic
Algebra
and Topology
The Enumeration Degrees of the ¿02 Sets
The Convenience of Tilings
Contributors
Resource-Bounded Measure and Randomness
Degree Structures in Local Degree Theory
Compressibility of Infinite Binary Sequences
Beyond Gödel's Theorem: The Failure to Capture Information Content
Progressions of Theories of Bounded Arithmetic
On Presentations of Algebraic Structures
Witness-Isomorphic Reductions and Local Search
A Survey of Inductive Inference with an Emphasis on Queries
A Uniformity of Degree Structures
Short Course on Logic
Algebra
and Topology
The Enumeration Degrees of the ¿02 Sets
The Convenience of Tilings
Preface
Contributors
Resource-Bounded Measure and Randomness
Degree Structures in Local Degree Theory
Compressibility of Infinite Binary Sequences
Beyond Gödel's Theorem: The Failure to Capture Information Content
Progressions of Theories of Bounded Arithmetic
On Presentations of Algebraic Structures
Witness-Isomorphic Reductions and Local Search
A Survey of Inductive Inference with an Emphasis on Queries
A Uniformity of Degree Structures
Short Course on Logic
Algebra
and Topology
The Enumeration Degrees of the ¿02 Sets
The Convenience of Tilings
Contributors
Resource-Bounded Measure and Randomness
Degree Structures in Local Degree Theory
Compressibility of Infinite Binary Sequences
Beyond Gödel's Theorem: The Failure to Capture Information Content
Progressions of Theories of Bounded Arithmetic
On Presentations of Algebraic Structures
Witness-Isomorphic Reductions and Local Search
A Survey of Inductive Inference with an Emphasis on Queries
A Uniformity of Degree Structures
Short Course on Logic
Algebra
and Topology
The Enumeration Degrees of the ¿02 Sets
The Convenience of Tilings