[bridged from https://mathstodon.xyz/@andrejbauer on the fediverse by https://fed.brid.gy/ ]
Congratulations to @egbertrijke on the publication of his textbook on homotopy type theory and univalent mathematics!
For many of us classically trained mathematicians, learning univalent mathematics and type theory meant adapting to […]
Congratulations to @egbertrijke on the publication of his textbook on homotopy type theory and univalent mathematics!
For many of us classically trained mathematicians, learning univalent mathematics and type theory meant adapting to […]
https://girard.perso.math.cnrs.fr/mustard/article.html
https://girard.perso.math.cnrs.fr/mustard/article.html
Me: "Good luck with your final exam and thesis defense today! If you'd like me to peek at your slides, send them to me."
Student: "Oh no, I totally forgot about […]
Me: "Good luck with your final exam and thesis defense today! If you'd like me to peek at your slides, send them to me."
Student: "Oh no, I totally forgot about […]
Student: Are you really a student of Dana Scott's?
Me: Yes, of course.
Student: Oh my god, you're so old.
Student: Are you really a student of Dana Scott's?
Me: Yes, of course.
Student: Oh my god, you're so old.
Σ X : 𝓤 , (X → 𝓤),
is isomorphic to the type of all functions in 𝓤,
Σ X : 𝓤 , Σ Y : 𝓤 , (X → Y).
Take this as an interesting puzzle, which will be easy for you if you know HoTT/UF.
This can be proved with univalence. I haven't thought whether any […]
Σ X : 𝓤 , (X → 𝓤),
is isomorphic to the type of all functions in 𝓤,
Σ X : 𝓤 , Σ Y : 𝓤 , (X → Y).
Take this as an interesting puzzle, which will be easy for you if you know HoTT/UF.
This can be proved with univalence. I haven't thought whether any […]
Scott, Dana: More on the axiom of extensionality.Essays on the foundations of mathematics, pp. 115–131 Magnes Press, The Hebrew University, Jerusalem, 1961
Randall Holmes has a note […]
Scott, Dana: More on the axiom of extensionality.Essays on the foundations of mathematics, pp. 115–131 Magnes Press, The Hebrew University, Jerusalem, 1961
Randall Holmes has a note […]
Thinking about this on paper turned out to be a bit tricky, so I […]
Thinking about this on paper turned out to be a bit tricky, so I […]
Job Petrovčič, Matevž Miščič and Maša Žaucer worked on it. (At first just one of them […]
Job Petrovčič, Matevž Miščič and Maša Žaucer worked on it. (At first just one of them […]
In the first project, Luka Opravš formalized Polya's enumeration theorem, and then proceeded to also implement and formally verify an efficient algorithmic version.
It […]
In the first project, Luka Opravš formalized Polya's enumeration theorem, and then proceeded to also implement and formally verify an efficient algorithmic version.
It […]
Parallell programming is hard […]
Parallell programming is hard […]
Upon opening a MSc thesis, Acrobat Reader just told me "this appears to be a long document, would you prefer to read a summary?" Are they completely insane?
Upon opening a MSc thesis, Acrobat Reader just told me "this appears to be a long document, would you prefer to read a summary?" Are they completely insane?
Let X be a set. Given A, B ⊆ X, a map f : X → X is a *reduction* from A to B when ∀ a ∈ X. x ∈ A ⇔ f x ∈ B.
Write A ≤₁ B if there is an injective reduction from A to B.
Write A ≡ B if there is […]
Let X be a set. Given A, B ⊆ X, a map f : X → X is a *reduction* from A to B when ∀ a ∈ X. x ∈ A ⇔ f x ∈ B.
Write A ≤₁ B if there is an injective reduction from A to B.
Write A ≡ B if there is […]
[Original post on mathstodon.xyz]
[Original post on mathstodon.xyz]
Majority Decision Principle:
Given propositions p₁, p₂, p₃ and q, suppose
(1) pᵢ ⇒ ¬q ∨ ¬¬q, for i = 1, 2, 3
(2) pᵢ ⇒ ¬pⱼ, for i ≠ j
Then ¬q ∨ ¬¬q.
The principle is classically valid, but not intuitionistically provable […]
Majority Decision Principle:
Given propositions p₁, p₂, p₃ and q, suppose
(1) pᵢ ⇒ ¬q ∨ ¬¬q, for i = 1, 2, 3
(2) pᵢ ⇒ ¬pⱼ, for i ≠ j
Then ¬q ∨ ¬¬q.
The principle is classically valid, but not intuitionistically provable […]
The topos is very good at defying proofs that use the recursion theorem from computability. This is not a surprise […]
The topos is very good at defying proofs that use the recursion theorem from computability. This is not a surprise […]