Envío express desde $5  Ver más

Enviar a
Quito, Pichincha
0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

Selecciona tu país

América

Europa

Resto del mundo

portada Incompleteness for Higher-Order Arithmetic: An Example Based on Harrington's Principle (en Inglés)
Formato
Libro Físico
Editorial
Idioma
Inglés
N° páginas
122
Encuadernación
Tapa Blanda
Dimensiones
23.4x15.6x0.8 cm
Peso
0.20 kg.
ISBN13
9789811399480

Incompleteness for Higher-Order Arithmetic: An Example Based on Harrington's Principle (en Inglés)

Yong Cheng (Autor) · Springer · Tapa Blanda

Incompleteness for Higher-Order Arithmetic: An Example Based on Harrington's Principle (en Inglés) - Cheng, Yong

Libro Nuevo Importado
Envío: 20 a 27 días háb.
$ 123.11$ 67.71
-45%
Costos de importación incluídos en el precio ✅
Libro Nuevo

Quedan más de 100 unidades

$ 67.71
Llega entre el 13 Oct y el 26 Oct a Quito, Pichincha. Seleccionar ubicación

Reseña del libro "Incompleteness for Higher-Order Arithmetic: An Example Based on Harrington's Principle (en Inglés)"

Gödel's true-but-unprovable sentence from the first incompleteness theorem is purely logical in nature, i.e. not mathematically natural or interesting. An interesting problem is to find mathematically natural and interesting statements that are similarly unprovable. A lot of research has since been done in this direction, most notably by Harvey Friedman. A lot of examples of concrete incompleteness with real mathematical content have been found to date. This brief contributes to Harvey Friedman's research program on concrete incompleteness for higher-order arithmetic and gives a specific example of concrete mathematical theorems which is expressible in second-order arithmetic but the minimal system in higher-order arithmetic to prove it is fourth-order arithmetic.This book first examines the following foundational question: are all theorems in classic mathematics expressible in second-order arithmetic provable in second-order arithmetic? The author gives a counterexample for this question and isolates this counterexample from the Martin-Harrington Theorem in set theory. It shows that the statement "Harrington's principle implies zero sharp" is not provable in second-order arithmetic. This book further examines what is the minimal system in higher-order arithmetic to prove the theorem "Harrington's principle implies zero sharp" and shows that it is neither provable in second-order arithmetic or third-order arithmetic, but provable in fourth-order arithmetic. The book also examines the large cardinal strength of Harrington's principle and its strengthening over second-order arithmetic and third-order arithmetic.

Opiniones del libro

Preguntas frecuentes sobre el libro

Todos los libros de nuestro catálogo son Originales.
El libro está escrito en Inglés.
La encuadernación de esta edición es Tapa Blanda.

Preguntas y respuestas sobre el libro

¿Tienes una pregunta sobre el libro? Inicia sesión para poder agregar tu propia pregunta.

Opiniones sobre Buscalibre

Ver más opiniones de clientes