hmm, would you reject the cosmological argument for the existence of God? As the main principles use causality as a means to prove His existence — Charlotte Thomas-Rowe
That is, must consciousness always only occur, or exist, in a first person, present tense mode? — charles ferraro
You, not we. There's nothing in the list of things that constitute the self that continues past death — Banno
The "I" is memory, body, intent, narrative...
None of which survive death. — Banno
Category theory is a popular mathematical area. An offshoot of algebra, it can be used as an alternative to establish the foundations of math. It searches for so-called universal properties in various categories. Personally, I find it alien and entirely non-productive in the nitty gritty stuff I study in complex variables.
The Wikipedia page for Category theory gets 575 views/day, a respectable number. The page you linked gets 5 views/day and is classified as low priority (like my math page). So it may not help. But good try. — jgill
You point is obscure. The caterpillar becomes a butterfly. — Banno
I baulk at having a different sort of truth for science than for religion. Truth is truth. The you that awakes forma coma has the very same body as the you that entered the coma. There is a publicly available way to asses the meaning of "I" in "But was I really unconscious previously". It's missing from reincarnation. — Banno
..and no basis for calling it true. Reincarnation becomes a form of life that does not make contact with truth or falsehood. It's use - meaning - can only be in its social function. — Banno
There is no a priori linguistic definition of "heap" in terms of any specific number of grains of sand,
— sime
Yes, that is the problem. — bongo fury
Any finite number of grains of sand does not have this property.
— sime
So... isn't a heap? — bongo fury
Agreed. But what is the smallest number of grains that would need considering by speakers as a particular case? Is it 1? — bongo fury
like imagining a heap of sand that never changes after a grain is removed or added.
— sime
... leading to the conclusion (incompatible with a premise, or there's no puzzle) that a single grain is a heap. Does that happen also with your "infinite" element, so that it can evaluate to 1? — bongo fury
What's a "theorem prover"? Computer program? A tutor? — jgill
think you are focusing too much on the fact that theoremhood is not strongly representable in PA, with the consequence that you are ignoring the fact that it is weakly representable in PA. Indeed, while theoremhood is not computable, it is computably enumerable. In other words, there is an algorithm which lists all and only theorems of PA. It exploits the fact that, given your favorite proof system, whether or not a sequence of formulas is a proof of a sentence of PA is decidable. Call the algorithm which decides that "Check Proof". Here's an algorithm which lists all the theorems of PA, relative, of course, to some Gödel coding:
Step 1: Check whether n is the Gödel number of a sequence of formulas of PA (starting with 0). If YES, go to the next step. Otherwise, go to the next number (i.e. n+1).
Step 2: Decode the sequence of formulas and use Check Proof to see if it is a proof. If YES, go to the next step. Otherwise, go back to Step 1 using as input n+1.
Step 3: Erase all the formulas in the sequence except the last. Go back to Step 1, using as input n+1.
This (horrible) algorithm lists all the theorems, i.e. if S is a theorem of PA, it will eventually appear in this list. Obviously, this cannot be used to decide whether or not a given formula is a theorem, since, if it is not a theorem, then we will never know it isn't, since the list is endless. But, again, it can be used to list all the theorems. My point is that there is nothing comparable for the truths, i.e. there is no algorithm that lists all the truths. In fact, by Tarski's theorem, there can be no such algorithm. So, again, the two lists (the list of all the theorems, the list of all the truths) are not the same, whence the concepts are different. — Nagase
The upshot of all this is that, in my opinion, constructivists should resist the temptation of reducing truth to provability. Instead, they should follow Dummett and Heyting (on some of their most sober moments, anyway) and declare truth to be a meaningless notion. If truth were reducible to provability, then it would be a constructively respectable notion. But it isn't (because of the above considerations). So the constructivist should reject it. (Unsurprisingly, most constructivists who tried to explicate truth in terms of provability invariably ended up in a conceptual mess---cf. Raatikainen's article "Conceptions of truth in intuitionism" for an analysis that corroborates this point.) — Nagase
In your view, if flourishing has to be the intention of a moral action, then how should moral intentionality be determined?
— sime
Hi sime, sorry, did not understand the question, can you restate in a different form? Thanks! — Thomas Quine
I don't think Löb's theorem supports the constructivist position. That's because truth is generally taken, prima facie to obey the capture and release principles: if T('S'), then S (release), and, if S, then T('S') (capture). But what Löb's theorem shows is that proof does not obey the release principle. So there is at least something suspicious going on here. — Nagase
Moreover, one can show that the addition of a minimally adequate truth-predicate to PA (one that respects the compositional nature of truth) is not conservative over PA. Call this theory CT (for compositional truth). Then CT⊢∀x(Sent(x)→(Prov(x)→T(x)))CT⊢∀x(Sent(x)→(Prov(x)→T(x))), where "T" is the truth predicate. As a corollary, CT proves the consistency of PA. So truth, unlike provability, is not conservative over PA. — Nagase
Finally, you have yet to reply to my argument regarding the computability properties of the two predicates, namely that one does have an algorithm for listing all the theorems of PA, whereas one does not have an algorithm for listing all the truths of PA. So the two cannot be identical. — Nagase
1. Proof is necessary for truth [Godel assumes and thus proves his incompleteness theorems]
2. The incompleteness theorems proves that proof is unnecessary for truth
3. Proof is unnecessary for truth (from 2)
1 and 3 contradict each other, no? This is a meta-cognitive statement regarding Godel's thought processes. — TheMadFool
As another example, how about "there is a number greater than zero and smaller than every real number". Is it true or false? Does it even make sense to say that it's either true or false? Or is it more correct to say that it's provable if using the hyperreals and that its inverse is provable if not? — Michael
Does empirical statistical evidence count as rational? This intelligent "fluke" seems to be built-in to the mathematical foundation of Nature. :smile: — Gnomon