bio | website | cwru.edu/artsci/phil/… |
---|---|---|
location | Case Western Reserve University | |
age | 63 | |
visits | member for | 2 years, 4 months |
seen | 5 hours ago | |
stats | profile views | 1,277 |
Jul 7 |
comment |
Does V=L imply transitive containment over, say, Z?
@EmilJeřábek Sure, or in other words I want to know if adding V=L to MAC makes Tco redundant. |
Jul 6 |
comment |
Does V=L imply transitive containment over, say, Z?
Thank you. But I am asking when V is closed under transitive closure, not just when there is inner model with transitive closures. |
Jul 6 |
comment |
Generate Finite Field power of g
The sequence is a notation for the successive polynomial powers of $x$ modulo $x^4+x+1$, over $F_2$. Here $abcd$ indicates $ax^3+bx^2+cx+d$. Does this answer your question? |
Jul 6 |
asked | Does V=L imply transitive containment over, say, Z? |
Jul 2 |
awarded | Inquisitive |
Jul 2 |
awarded | Curious |
May 18 |
comment |
Interactions between (set theory, model theory) and (algebraic geometry, algebraic number theory ,…)
It may be worth remarking that this theorem is independent of ZFC but not stronger than ZFC since ZFC can interpret it as a theorem on constructible sets. |
Apr 10 |
awarded | Yearling |
Mar 29 |
asked | $n$th order arithmetic with predicates for orders |
Mar 23 |
awarded | Necromancer |
Mar 18 |
comment |
Is realness of number fields exponentially bounded?
@GerryMyerson Yes. But for integers ``very small even up to conjugacy'' cannot. |
Mar 18 |
comment |
Is realness of number fields exponentially bounded?
@GerryMyerson Consult MR0485681 as cited in user's answer. The magnitude bound is given not for separate conjugates, separately, but on the maximal complex magnitude of any conjugate of a given algebraic number. You can see why this is natural? |
Mar 17 |
comment |
Quoting mathreviews
It is a good student question. Not research mathematics. |
Mar 17 |
comment |
Would a non-constructible set become constructible if we had oracles of arbitrarily high cardinality for the halting problems of ordinal computers?
Constructibility of sets is not about making decisions. You cannot turn a set constructible by using more information. You probably want to know about relative constructibility as described on Wikipedia. |
Mar 17 |
comment |
Is realness of number fields exponentially bounded?
@GerryMyerson The question concerns complexity. For integers, including algebraic integers, complexity agrees with magnitude, and so Raghavan's magnitude bound also bounds complexity. For rationals and other non-integer algebraic numbers very small can be very complex. |
Mar 17 |
comment |
Is realness of number fields exponentially bounded?
But I believe stufe have not got to do with (necessarily) integral summands, and so do not directly address the question of complexity. |
Mar 16 |
accepted | Is realness of number fields exponentially bounded? |
Mar 16 |
comment |
Is realness of number fields exponentially bounded?
Indeed this answers the question asked. |
Mar 16 |
revised |
Is realness of number fields exponentially bounded?
Clarified question. |
Mar 16 |
comment |
Is realness of number fields exponentially bounded?
Can you put some complexity bound on the summands $x_1,x_2,x_3,x_4,x_5$ themselves? Or on your $a,b,c,d$? |