A kind of library

• You are currently browsing the A kind of library blog archives for the day Friday, November 15th, 2013.

• Categories

• Recent Comments

  	ปั่นสล็อต on 414/514 The theorems of Rieman…
  	Richard Kimberly Hec… on Woodin’s proof of the se…
  	Is there a Borel-mea… on 414/514 Examples of Baire clas…
  	Simple bijectiveness… on 580 -Some choiceless results…
  	Schur’s theore… on 580 -III. Partition calcu…
  	Uncountable linearly… on 403/503 – Homework …
  	What is a non-constr… on On strong measure zero se…
  	function from Nmathb… on Hindsight
  	Cauchy Schwarz Inequ… on 275 -Positive polynomials
  	What is a Cantor-sty… on 580 -Some choiceless results…
  	Question about Gener… on 580 -Some choiceless results…
  	Set has Measure Zero… on On strong measure zero se…
  	Non-measurable subse… on 580 -Cardinal arithmetic …
  	hmeng1 on 414/514 The theorems of Rieman…
  	580 -Cardinal arithm… on 580 -Cardinal arithmetic …

• Mathematical links

  • American Mathematical Society
  • Andrés Villaveces
  • ArXiv
  • Asaf Karagila
  • Assaf Rinot
  • Association for Symbolic Logic
  • Carlos Matheus
  • Derrick Stolee
  • Emmanuel Kowalski
  • Gil Kalai
  • Harrison Brown
  • Izabella Laba
  • John Baez
  • Kristal Cantwell
  • Leonid Kovalev
  • Lieven Le Bruyn
  • Luca Trevisan
  • Mathematical Association of America
  • Peter Cameron
  • Richard Lipton & Kenneth Regan
  • Richard Zach
  • Secret Blogging Seminar
  • Set theory homepages
  • Terence Tao
  • Timothy Gowers
  • Todd Eisworth (I)
  • Todd Eisworth (II)

• My pages

  • My papers
  • My talks
  • My webpage

• Others

  • Acephalous
  • Andrés Villaveces
  • Boing Boing
  • Bruce Schneier
  • Eddie Campbell
  • Got medieval
  • Jinxworld
  • Language Log
  • Lawrence Lessig
  • Neil Gaiman
  • PostSecret
  • The Perry Bible Fellowship
  • Warren Ellis
  • XKCD

• Mathoverflow

  • Answer by Andrés E. Caicedo for Important open problems that have already been reduced to a finite but infeasible amount of computation
  • Answer by Andrés E. Caicedo for Examples of ZFC theorems proved via forcing
  • Answer by Andrés E. Caicedo for Proper Forcing Axiom for $|\mathbb{P}| \leq \mathfrak{c}$
  • Dual Schroeder-Bernstein theorem
  • Answer by Andrés E. Caicedo for Coding a model of $0^\sharp$ from a $\Pi^1_1$ Gale-Stewart game
  • Answer by Andrés E. Caicedo for Latest status of core model theory?
  • Answer by Andrés E. Caicedo for Determinacy and Woodin cardinals
  • Answer by Andrés E. Caicedo for Does $\mathsf{SVC}^\ast$ exist?
  • Answer by Andrés E. Caicedo for Counterintuitive consequences of the Axiom of Determinacy?
  • Answer by Andrés E. Caicedo for Perfect set property for projective hierarchy

• Math.StackExchange

  • Answer by Andrés E. Caicedo for Can Tarski's circle squaring problem be solved with measurable sets and/or without the Axiom of Choice?
  • Answer by Andrés E. Caicedo for Given an injection $\mathbb{N}\to\mathcal{P}(X)$, how can we construct a surjection $X\to\mathbb{N}$?
  • Answer by Andrés E. Caicedo for Allowing addition of ordinals in forcing
  • Answer by Andrés E. Caicedo for Effective Well ordering of reals
  • Answer by Andrés E. Caicedo for Reference for combinatorial game theory.
  • Answer by Andrés E. Caicedo for What is the difference between Gödel's completeness and incompleteness theorems?
  • Answer by Andrés E. Caicedo for Least beth number $\ge$ an aleph number
  • Answer by Andrés E. Caicedo for Does there exist a continous function for which there is no continuous choice for $\delta$ provided an $\epsilon$?
  • Answer by Andrés E. Caicedo for Without the Axiom of Choice, must two nonempty sets have a surjection between them?
  • Answer by Andrés E. Caicedo for A step in a proof of Erdos's lower bound for R(k, k)

• November 2013

  M	T	W	T	F	S	S
  				1	2	3
  4	5	6	7	8	9	10
  11	12	13	14	15	16	17
  18	19	20	21	22	23	24
  25	26	27	28	29	30

• Archives

  • June 2019 (2)
  • February 2019 (7)
  • January 2019 (1)
  • December 2018 (1)
  • October 2018 (2)
  • August 2018 (1)
  • February 2018 (1)
  • October 2017 (1)
  • July 2017 (1)
  • September 2016 (2)
  • August 2016 (3)
  • July 2016 (2)
  • April 2016 (1)
  • October 2015 (1)
  • June 2015 (1)
  • May 2015 (1)
  • April 2015 (7)
  • March 2015 (5)
  • February 2015 (7)
  • January 2015 (11)
  • December 2014 (2)
  • November 2014 (5)
  • October 2014 (6)
  • September 2014 (3)
  • August 2014 (3)
  • April 2014 (3)
  • March 2014 (5)
  • February 2014 (2)
  • January 2014 (2)
  • December 2013 (2)
  • November 2013 (10)
  • October 2013 (6)
  • September 2013 (7)
  • August 2013 (5)
  • June 2013 (1)
  • May 2013 (8)
  • April 2013 (7)
  • March 2013 (5)
  • February 2013 (9)
  • January 2013 (2)
  • November 2012 (1)
  • September 2012 (1)
  • August 2012 (3)
  • May 2012 (3)
  • April 2012 (10)
  • March 2012 (4)
  • February 2012 (13)
  • January 2012 (15)
  • November 2011 (8)
  • October 2011 (14)
  • September 2011 (7)
  • August 2011 (1)
  • April 2011 (1)
  • March 2011 (3)
  • February 2011 (4)
  • January 2011 (7)
  • December 2010 (1)
  • November 2010 (7)
  • October 2010 (12)
  • September 2010 (13)
  • August 2010 (3)
  • May 2010 (4)
  • April 2010 (11)
  • March 2010 (6)
  • February 2010 (12)
  • December 2009 (9)
  • November 2009 (11)
  • October 2009 (13)
  • September 2009 (19)
  • August 2009 (10)
  • June 2009 (1)
  • May 2009 (2)
  • April 2009 (14)
  • March 2009 (17)
  • February 2009 (19)
  • January 2009 (15)
  • December 2008 (5)
  • November 2008 (12)
  • October 2008 (17)
  • September 2008 (10)
  • August 2008 (3)
  • June 2008 (3)
  • May 2008 (15)
  • April 2008 (21)
  • March 2008 (10)
  • February 2008 (13)
  • January 2008 (11)
  • September 2007 (1)
  • July 2007 (1)
  • March 2007 (4)
  • February 2007 (20)
  • January 2007 (23)
  • December 2006 (4)

• Alan Turing Alexander S. Kechris Alfred Tarski algebraic numbers Andras Hajnal Andreas Blass Andrew Michael Bruckner arithmetic mean-geometric mean inequality Arnoud C. M. van Rooij Augustin Cauchy Axel Thue Bernhard Riemann BEST bpfa compactness completeness covering property determinacy Donald A. Martin elementary embedding Emile Borel Euclidean algorithm extension field field field extension Francisco Frank Plumpton Ramsey Fred Galvin Galvin-Hajnal theorem GCH Georg Cantor Godfrey Harold Hardy Grigor Sargsyan Harvey Friedman ideal Isaac Newton James Baumgartner Jerome Keisler Johan Thim John R. Steel Karl Theodor Wilhelm Weierstrass Koenig's lemma Kurt Goedel Lech Maligranda Marion Scheepers measurable cardinal Menachem Magidor midterm mm Nowhere differentiable function Paul Erdos Paul Larson pfa propositional logic quartic equation Ramsey theorem Rene Baire Richard Rado Robert Solovay Saharon Shelah Samuel Coskey sch Silver's theorem Stefan Banach Stevo Todorcevic supercompact cardinals Tarski's conjecture Turing degrees ultrafilter ultrapower Undecidability and incompleteness Unsolvable problems W. Hugh Woodin Wacław Franciszek Sierpiński Wilhelmus Hendricus Schikhof

Create a free website or blog at WordPress.com.