Computability and logic.

Mostrar otras versiones (1)

This fifth edition of 'Computability and Logic' covers not just the staple topics of an intermediate logic course such as Godel's incompleteness theorems, but also optional topics that include Turing's theory of computability and Ramsey's theorem.

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Boolos, George
Otros Autores: Burgess, John P., 1948-, Jeffrey, Richard C.
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cambridge ; New York : Cambridge University Press, 2007.
Edición:5th ed. /
Temas:
Computable functions.
Recursive functions.
Logic, Symbolic and mathematical.
Fonctions calculables.
Fonctions récursives.
Logique symbolique et mathématique.
COMPUTERS > Machine Theory.
Berechenbarkeit
Mathematische Logik
Symbolisk logik.
Acceso en línea:Texto completo
Tabla de Contenidos:
  • Enumerability
  • Diagonalization
  • Turing Computability
  • Uncomputability
  • Abacus Computability
  • Recursive Functions
  • Recursive Sets and Relations
  • Equivalent Definitions of Computability
  • Precis of First-Order Logic: Syntax
  • Precis of First-Order Logic: Semantics
  • Undecidability of First-Order Logic
  • Models
  • Existence of Models
  • Proofs and Completeness
  • Arithmetization
  • Representability of Recursive Functions
  • Indefinability, Undecidability, Incompleteness
  • Unprovability of Consistency
  • Normal Forms
  • Craig Interpolation Theorem
  • Monadic and Dyadic Logic
  • Second-Order Logic
  • Arithmetical Definability
  • Decidability of Arithmetic without Multiplication
  • Nonstandard Models
  • Ramsey's Theorem
  • Modal Logic and Provability.

Ejemplares similares