A curious inference
type: Item
instance of: scholarly article
title: A curious inference
zbMATH Open document ID: 0623.03054
DOI: 10.1007/BF00250612
author: George Boolos
published in: Journal of Philosophical Logic
publication date: 1987-01-01T00:00:00Z
review text: The paper discusses the proof of a statement about a recursively defined rapidly increasing function. The hypotheses involve universal quantifiers and the statement is easily proved in second order logic. An estimate of the size of the set needed to replace the quantifiers by Gentzen cuts shows that the first order proof would need a number of symbols largely in excess of the number of atoms in the universe; such a proof cannot be written down. The author's conclusion is that this gives additional strength to the position ''that first order logic ought never to have been accorded canonical status as logic''. \{The argument is mathematically sound but the conclusion is questionable. In mathematics and computer science one presupposes a sufficiently large supply of labels that allow one to use abbreviations (from the purely logical point of view these would transform the language used to a new one) and which bring the proof down to manageable size.\}
Mathematics Subject Classification ID: 03F60
Mathematics Subject Classification ID: 03A05
Mathematics Subject Classification ID: 03B10
zbMATH DE Number: 4010519
zbMATH Keywords: recursively defined rapidly increasing function
zbMATH Keywords: universal quantifiers
zbMATH Keywords: Gentzen cuts
zbMATH Keywords: first order logic
reviewed by: Heinrich Guggenheimer
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1007/bf00250612
OpenAlex ID: W2090308107
Recommended article: Q4523481
Recommended article: Some more curious inferences
Recommended article: Q3784728
Recommended article: Paradoxes of pure curiosity
Recommended article: Q4811767
Recommended article: Q3567506
description: scientific article; zbMATH DE number 4010519