↓ Skip to main content
What is this page? Embed badge

An Invitation to Mathematical Logic

Overview of attention for book
An Invitation to Mathematical Logic
Springer Nature Switzerland

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Languages, Structures, and Theories
  3. Altmetric Badge
    Chapter 2 Embeddings and Substructures
  4. Altmetric Badge
    Chapter 3 Formal Proofs
  5. Altmetric Badge
    Chapter 4 Gödel’s Completeness Theorem
  6. Altmetric Badge
    Chapter 5 Compactness and Complete Theories
  7. Altmetric Badge
    Chapter 6 Ultraproducts
  8. Altmetric Badge
    Chapter 7 Quantifier Elimination
  9. Altmetric Badge
    Chapter 8 Model Theory of the Real Field
  10. Altmetric Badge
    Chapter 9 Models of Computation
  11. Altmetric Badge
    Chapter 10 Universal Machines and Undecidability
  12. Altmetric Badge
    Chapter 11 Computably Enumerable and Arithmetic Sets
  13. Altmetric Badge
    Chapter 12 Turing Reducibility
  14. Altmetric Badge
    Chapter 13 Gödel’s Incompleteness Theorems
  15. Altmetric Badge
    Chapter 14 Hilbert’s Tenth Problem
  16. Altmetric Badge
    Chapter 15 Peano Arithmetic and 𝜖 0 $$ \epsilon _0$$
  17. Altmetric Badge
    Chapter 16 Models of Arithmetic and Independence Results
Attention for Chapter 12: Turing Reducibility
Altmetric Badge
Summary
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Turing Reducibility
Chapter number 12
Book title
An Invitation to Mathematical Logic
Published in
Graduate Texts in Mathematics, January 2024
DOI 10.1007/978-3-031-55368-4_12
Book ISBNs
978-3-03-155367-7, 978-3-03-155368-4
Authors

Marker, David

View on publisher site
Timeline

Login to access the full chart related to this output.

If you don’t have an account, click here to discover Explorer

This page is provided by Altmetric.