Skip to main content
Oscar Cunningham's user avatar
Oscar Cunningham's user avatar
Oscar Cunningham's user avatar
Oscar Cunningham
  • Member for 14 years, 9 months
  • Last seen this week
comment
Trace in the category of propositional statements
@YemonChoi True. But note that you can define trace for an endomorphism of a dualizable object even if the category doesn't have duals for all objects.
comment
Trace in the category of propositional statements
There's only one morphism $I\to I$ so the trace would be trivial even if it was defined.
comment
Big list of comonads
@geodude The étalification comonad is idempotent. I don't know what you mean by "universal covering" in this context.
comment
Big list of comonads
Saying there are "at least as many" is false in some sense. Different adjuctions $(G,F)$ can give the same comonad $F\circ G$.
revised
Big list of comonads
added 809 characters in body
Loading…
answered
Loading…
awarded
comment
Does "every" first-order theory have a finitely axiomatizable conservative extension?
@FrançoisG.Dorais Why does this only work for effectively axiomatizable theories?
revised
Loading…
Loading…
comment
Relative consistency of ETCS over the theory of a well-pointed topos with NNO
@ZhenLin Could you point out where the following argument falls down? Claim: If $A$ and $B$ are well-orderable then so is $A^B$. Proof: Let $\alpha\simeq A$ and $\beta\simeq B$ be ordinals. Then $\alpha^\beta$ is hereditary-ordinal-definable. Since Choice holds in HOD, $\alpha^\beta$ is well-orderable. Then since $A^B\simeq\alpha^\beta$ we have that $A^B$ is well-orderable.
awarded
comment
Most harmful heuristic?
I'd argue that categories really should be named after their objects, but that you can only tell what the objects really are by looking at the structure of the morphisms. For example the category $\mathbf{Rel}$ of "sets" and relations should really be called $\mathbf{FreeSupLat}$.
comment
How are the two natural ways to define “the category of models of a first-order theory $T$” related?
There's a nice paper "Morphism Axioms"(pdf) by Florian Rabe that suggests that one should specify additional axioms for a first order theory that say what the morphisms between models should be. This means that you don't have to worry about equivalent theories having inequivalent categories of models, because you can just explicitly define the morphisms.
comment
The geometric median of a triangle
@Gro-Tsen It's hard to contact people via mathoverflow, so I sent him an email.
comment
What, mathematically speaking, does it mean to say that the continuation monad can simulate all monads?
"In a category with internal homs $[-,-]$, given an object $S$, the continuation monad is the endofunctor $X\mapsto[[X,S],S]$." ncatlab.org/nlab/show/continuation+monad
awarded
revised
Most general formulation of Gödel's incompleteness theorems
Corrected definition of $^*$ operator
Loading…
comment
Looking for a tractable algorithm or formula for the determinant of a tensor
By the way, I think your nice properties only hold when the tensor has an even number of indices (i.e. $m$ is even). For example when $m=1$ your formula reduces to saying that $\mathrm{Det} v$ is just the product of the entries of $v$, which is clearly not basis-independent even if we restrict the possible change-of-basis matrices to unitaries with determinant $1$.
comment
Most general formulation of Gödel's incompleteness theorems
The definition of $^*$ used to be "$A^* = \{ n : \Phi(E_n,n) \in T \}$", which I think is incorrect because $A$ doesn't appear on the right hand side. I made an attempt at a correction, but I'd appreciate if someone could check with a copy of Smullyan's book.
1
6 7
8
9 10
13