Kreisel's squeezing argument shows that provability in formal systems and truth in intended models can come apart, so model existence from consistency does not vindicate the claim about actual computational totality.
?Rate how convincing each reason is below to see the overall strength.
No one has weighed in yet. Be the first to share reasons for or against this statement.
Sign in or register to share your perspective on this statement.
Provability in formal systems(one of the two things that can come apart)
Whether a statement can be derived or proven using the strict rules and symbols of a mathematical or logical system (like the rules of arithmetic).
Truth in intended models(the other thing that can come apart from provability)
Whether a statement accurately describes reality in the way we actually want the system to apply (as opposed to some weird, unexpected interpretation).
squeezing argument(philosophy of logic)
Kreisel's argument that uses proof theory to support the model-theoretic definition of logical consequence, depending on the language having a sound and complete proof system