Sujet : Re: universal quantification, because g⤨(g⁻¹(x)) = g(y) [1/2] Re: how
De : james.g.burns (at) *nospam* att.net (Jim Burns)
Groupes : sci.mathDate : 10. May 2024, 23:26:29
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <58fcd3ad-ba5f-43e5-83e5-364d36a05bb6@att.net>
References : 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22
User-Agent : Mozilla Thunderbird
On 5/10/2024 4:12 PM, Ross Finlayson wrote:
On 05/10/2024 03:59 AM, Jim Burns wrote:
[...]
>
I'd like to suggest a reading from
Dehaene's "The Number Sense",
in Chapter 9 "Of Neurons and Numbers",
in the section
"When Intuition Outruns Axioms".
>
I found a copy online from
the International Cognition and Culture Institute,
and about page 238.
>
He explains that there _are_
non-standard models of integers.
Is "When Intuition Outruns Axioms" concerned with
other.than.standard.issue quantifiers?
[1]
If so,
since you are currently holding the talking.stick,
you could use the opportunity to expound on
what Dehaene has to say.
Maybe I should clarify:
I don't say that there aren't non.standard objects.
That's not the same as saying that
there aren't non.standard quantifiers.
I also don't say that there aren't
non.standard quantifiers.
There might not be.
Quantifiers are live near the roots of our logic.
There might be.
Mathematicians are smart.
What I say is
I don't know yet what sort of
non.standard.quantification scheme
you introduced at your "universal quantification"
post.
If you wish I had more to say about your posts
(a big IF, not everyone does)
helping me to understand your posts seems like
an effective strategy for bringing that about.
Just saying.
Again, what correspondence of yours I see,
which is any in response to me, I've replied.
If you have used ∀? ∀+ ∀* ∀$ in sentences,
I have overlooked them.
Surely, it would only be a very small favor to me
to repeat those sentences.
By doing so, you would increase the chances
of me NOT balking and clamming up.
Could you please do so again?
[1]
By other.than.standard.issue quantifiers, I mean
other than those such that:
| ∀x:B(x) ⇒ B(t)
| ∀x:(B⇒C(x)) ⇒ (B⇒∀x:C(x))
| B(x) ⊢ ∀x:B(x)
| ∃x:B(x) ⇔ ¬∀x:¬B(x)