All blackboards are gone. They were replaced during the break. (So, no chance to use this MathOverflow question on the near future.) Makes me think of T.H. Huxley’s On a Piece of Chalk (see here) and wonder what the equivalent will be in a few decades.

On the plus side, we now have computers and projection equipment on each classroom. I am using this quite a bit in my abstract algebra class. Except that, during the first few weeks, it was more often than not that the keyboard would be locked away.

Annoyed, I called OIT and asked that they please make sure it was unlocked before my class. It worked for a few days. But then, again, I found it locked.

I called again (I was charming, I am sure). So, somebody came to the classroom, looked at me, smiled. And pressed a button, to open the drawer.

Sigh.

(In my defense, the class is at 8:30 in the morning, and I’m supposed to drink less coffee these days. But still.)

(“Thanks. I’m sorry. I’m an idiot.” “Oh, no, no. It is new.” “It is a button.”)

43.614000-116.202000

Like this:

LikeLoading...

Related

This entry was posted on Sunday, February 19th, 2012 at 4:26 pm and is filed under Life. You can follow any responses to this entry through the RSS 2.0 feed.
You can leave a response, or trackback from your own site.

Have you had a chance to use a tablet+projection to replace the whiteboard? Infinite paper with infinite zoom to add additional comments in the right place is a great tool I use for taking notes, but never had a chance to use in class.

The argument you are looking for is given in Kanamori's book, see Theorem 28.15. For the more nuanced version of the lemma, see section 7D in Moschovakis's descriptive set theory book (particularly 7.D.5-8), or section 3.1 in the Koellner-Woodin chapter of the Handbook.

This problem is very much open. Cheng Yong calls Harrington's $\star$ the assumption that there is a real $x$ such that all $x$-admissible ordinals are $L$-cardinals. From the work of Yong we know that Second- and even Third-order arithmetic do not suffice to prove that Harrington's $\star$ implies the existence of $0^\sharp$. Whether this was poss […]

Georgii: Let me start with some brief remarks. In a series of three papers: a. Wacław Sierpiński, "Contribution à la théorie des séries divergentes", Comp. Rend. Soc. Sci. Varsovie 3 (1910) 89–93 (in Polish). b. Wacław Sierpiński, "Remarque sur la théorème de Riemann relatif aux séries semi-convergentes", Prac. Mat. Fiz. XXI (1910) 17–20 […]

What precisely do you mean by a standard model? An $\omega$-model? (That is, a model whose set of natural numbers is isomorphic to $\omega$.) Or a $\beta$-model? (That is, a model whose ordinals are well-ordered.) If the latter, the Mostowski collapse theorem tells us any such model is isomorphic in a unique way to a unique transitive model. If the former, t […]

This is Theorem 39 in the paper (see Theorem 4.(i) for a user-friendly preview). But the fact that $(2^\kappa)^+\to(\kappa^+)^2_\kappa$ is older (1946) and due to Erdős, see here: Paul Erdős. Some set-theoretical properties of graphs, Univ. Nac. Tucumán. Revista A. 3 (1942), 363-367 MR5,151d. (Anyway, it is probably easier to read a more modern presentation, […]

It is not possible to give a finitary proof of this fact. Consider, for instance, the statement that all Goodstein sequences terminate. This is an arithmetic claim, it is independent of $\mathsf{PA}$, and it is equivalent to the claim that some (very specific) computable non-increasing sequences of polynomial towers stabilize. Instead of Goodstein sequences, […]

Given any field automorphism of $\mathbb C$, the rational numbers are fixed. In fact, any number that is explicitly definable in $\mathbb C$ (in the first order language of fields) is fixed. (Actually, this means that we can only ensure that the rationals are fixed, I expand on this below.) Any construction of a wild automorphism uses the axiom of choice. Se […]

A proof can be found in Kanamori's book The higher infinite. The result follows from work of Solovay on the theory of uniform indiscernibles and work of Martin on projective scales. Look at sections 14, 28, and 30 of the book. A different approach (using the infinite partition properties of $\omega_1$ and $\omega_2$, themselves due to Solovay and Martin […]

Forcing with sufficiently homogeneous forcing that adds reals is enough to obtain the negation of $(*)$. The point is that if a formula $\phi$ defines a parameter-free well-ordering of $\mathbb R$, then for any ordinal $\alpha$, the statement "$x$ is the $\alpha$-th real in the well-ordering defined by $\phi$" uniquely characterizes $x$ in terms of […]

Assuming that $\gamma$ is finite, the argument is fairly simple: Suppose $\beta\to(\alpha)^\gamma_\delta$, and fix a bijection $f$ between $|\beta|$ and $\beta$. Consider a coloring $c:[|\beta|]^\gamma\to\delta$. Using $f$ , this gives us a coloring $c':[\beta]^\gamma\to\delta$ (here we used that $\gamma$ is finite). We want to argue that there is a $c$ […]

RT @replicakill: @andrescaicedo I'm starting another consulting company with some friends and the name I chose was ω_1, so this is funny an… 2 days ago

This is quite hilarious (I sympathize).

Have you had a chance to use a tablet+projection to replace the whiteboard? Infinite paper with infinite zoom to add additional comments in the right place is a great tool I use for taking notes, but never had a chance to use in class.

I haven’t, but I probably should. I’ve heard Hugh Woodin uses this quite effectively teaching precalculus, of all things.