Computability and logic

@inproceedings{Boolos1974ComputabilityAL,
  title={Computability and logic},
  author={G. Boolos and R. Jeffrey},
  year={1974}
}
  • G. Boolos, R. Jeffrey
  • Published 1974
  • Mathematics, Computer Science
  • Part I. Computability Theory: 1. Enumerability 2. Diagonalization 3. Turing computability 4. Uncomputability 5. Abacus computability 6. Recursive functions 7. Recursive sets and relations 8. Equivalent definitions of computability Part II. Basic Metalogic: 9. A precis of first-order logic: syntax 10. A precis of first-order logic: semantics 11. The undecidability of first-order logic 12. Models 13. The existence of models 14. Proofs and completeness 15. Arithmetization 16. Representability of… CONTINUE READING
    805 Citations

    Topics from this paper

    Automated equational reasoning in nondeterministic lambda-calculi modulo theories H *
    • 4
    Basic Computability Theory
    • 1
    • PDF
    The Topology of Provability in Complexity Theory
    • K. Regan
    • Computer Science, Mathematics
    • J. Comput. Syst. Sci.
    • 1988
    • 5
    Turing oracle machines, online computing, and three displacements in computability theory
    • R. Soare
    • Computer Science
    • Ann. Pure Appl. Log.
    • 2009
    • 64
    • PDF
    Consistency, Turing Computability and Gödel’s First Incompleteness Theorem
    • R. Hadley
    • Computer Science
    • Minds and Machines
    • 2007
    • 3
    • Highly Influenced
    Paraconsistent Machines and their Relation to Quantum Computing
    • 9
    • PDF
    The History and Concept of Computability
    • R. Soare
    • Computer Science, Mathematics
    • Handbook of Computability Theory
    • 1999
    • 34
    • PDF

    References

    SHOWING 1-3 OF 3 REFERENCES
    Logic and Structure, an excellent, but more challenging book, uses trees exclusively
      our authors) mention trees only briefly and prefer boxes. The latter are easier to get right
        • Modern mathematical logic and CS literature more often uses trees