Joel David Hamkins

mathematics and philosophy of the infinite

Search

Main menu

Skip to primary content

Skip to secondary content

Home
Publications
Talks
- Talks
- Recent and Upcoming Talks
Appointments and Grants
Teaching
- About My Courses
Students
- About My Graduate Students
- List of My Graduate Students
Mathematical Shorts
Math for Kids

Tag Archives: NWO

Modal logics in set theory, NWO grants, 2006 – 2008

Posted on April 30, 2006 by Joel David Hamkins

Reply

Modal logics in set theory, (with Benedikt Löwe), Nederlandse Organisatie voor Wetenschappelijk (B 62-619), 2006-2008.

Share:

Click to share on Twitter (Opens in new window)
Click to share on Facebook (Opens in new window)
Click to share on Reddit (Opens in new window)
Click to share on WhatsApp (Opens in new window)
Click to email this to a friend (Opens in new window)
Click to print (Opens in new window)
More

Click to share on LinkedIn (Opens in new window)
Click to share on Tumblr (Opens in new window)
Click to share on Pocket (Opens in new window)
Click to share on Pinterest (Opens in new window)

Posted in Grants and Awards | Tagged Amsterdam, NWO | Leave a reply

My new book

Recent Comments

Joel David Hamkins on Math for eight-year-olds: graph theory for kids!
jeanetteparry on Math for eight-year-olds: graph theory for kids!
Joel David Hamkins on Philosophy of Mathematics, graduate lecture seminar, Oxford, Trinity term 2019
Joel David Hamkins on Philosophy of Mathematics, graduate lecture seminar, Oxford, Trinity term 2019
Michał Tomasz Godziszewski on Philosophy of Mathematics, graduate lecture seminar, Oxford, Trinity term 2019

JDH on Twitter

Blogroll

A kind of library
Aleph zero categorical
Barbara Gail Montero
Benjamin Steinberg
Cantor’s Attic
Combinatorics and more
GC Math Department
Global Set Theory Talks
Gowers’s weblog
JDH on Wikipedia
Mathblogging.org
MathOverflow
Peano’s parlour
Richard Zach
Terence Tao

Mathoverflow activity

Comment by Joel David Hamkins on Clearing misconceptions: Defining "is a model of ZFC" in ZFC
Asaf, isn't that exactly the argument I described? I said look at the longest initial segment true in a $V_\alpha$ (not just consistent). This must be nonstandard, since all the standard ones are true in a $V_\alpha$ by reflection.
Comment by Joel David Hamkins on Does $2^X=2^Y\Rightarrow |X|=|Y|$ imply the axiom of choice?
Yes, that's right.
Comment by Joel David Hamkins on Does $2^X=2^Y\Rightarrow |X|=|Y|$ imply the axiom of choice?
@Holo Every ordinal less than $\kappa^+$ is the order type of a relation on $\kappa$; this relation is a subset of $\kappa\times\kappa$. Thus, $\kappa^+\leq^* 2^{\kappa^2}$. This does not seem to require $\kappa^2\sim \kappa$.
Comment by Joel David Hamkins on Terminology about trees
Those kind of trees aren't often considered, but I would just call them trees, and remark on the variant usage for that purpose. Some people might use pseudo tree, but I find that terminology regrettable, as clearly the linearly ordered version is a fundamental and genuine tree concept, of which the well-ordered version is a […]
Comment by Joel David Hamkins on Adjoints to forcing
That is an interesting idea; I'll have to think about it.
Comment by Joel David Hamkins on Adjoints to forcing
Well, anyway, the lack of a functorial Borel map selecting generic filters for the countable models of set theory is interesting. It shows that the quotient step you mention is inherently difficult to achieve in a uniform way.
Comment by Joel David Hamkins on Adjoints to forcing
I'm not sure how it affects the categorical set-up here, but there are other senses in which there is no computable nor even Borel functor from models of set theory to their corresponding forcing extensions. See my upcoming talk at jdh.hamkins.org/…. The paper is not yet released, but it is joint with Russell Miller, Kameryn […]
Comment by Joel David Hamkins on Are there any I1 embeddings with interweaving critical sequences?
Yes, I agree, the construction idea I mentioned is going to be an inverse limit.

New York Logic

Title TBA
Resource Sharing Linear Logic, I
Sub-Kripkean epistemic models I
Generic logical semantics of justifications III
Generic logical semantics of justifications II
Generic logical semantics of justifications.
Cut Elimination
Functors and infinitary interpretations of structures
Recursive Reducts of PA III
Kripke completeness of strictly positive modal logics and related problems

Cantor’s Attic activity

Model BartekChom
Library BartekChom
Ramsey BartekChom
Library BartekChom
Mitchell rank BartekChom
Unfoldable BartekChom
Ramsey BartekChom
Silver cardinal BartekChom
Constructible universe BartekChom
Rank into rank BartekChom
Ramsey BartekChom
Remarkable BartekChom
Supercompact BartekChom
Upper attic BartekChom
Rank into rank BartekChom

Meta

Log in
Entries RSS
Comments RSS
WordPress.org

Subscribe to receive update notifications by email.

Email Address

Tags

absoluteness Arthur Apter automorphism towers buttons+switches CH chess class forcing computability countable models definability determinacy diamond elementary embeddings equivalence relations forcing forcing axioms games GBC geology ground axiom HOD hypnagogic digraph indestructibility infinitary computability infinite chess infinite games ITTMs Jonas Reitz kids KM large cardinals maximality principle modal logic models of PA multiverse open games potentialism PSC-CUNY supercompact truth universal definition universal program Victoria Gitman W. Hugh Woodin weakly compact

Proudly powered by WordPress

Send to Email Address Your Name Your Email Address

Cancel

Post was not sent - check your email addresses!

Email check failed, please try again

Sorry, your blog cannot share posts by email.