Impact
~1k
people reached
- 0 posts edited
- 0 helpful flags
- 29 votes cast
Mar
5 |
awarded | Popular Question |
Oct
3 |
revised |
An example of a beautiful proof that would be accessible at the high school level?
deleted 6 characters in body |
Sep
8 |
answered | An example of a beautiful proof that would be accessible at the high school level? |
Jul
25 |
accepted | Statistical calculations over algebraic structures |
Jul
17 |
asked | Statistical calculations over algebraic structures |
Jan
27 |
comment |
Real-closed fields minus existentials for Presburger-like power and multiplication?
Disappointing, but not too surprising. Ah well, back to the drawing board :) Thanks! |
Jan
27 |
accepted | Real-closed fields minus existentials for Presburger-like power and multiplication? |
Jan
27 |
comment |
Real-closed fields minus existentials for Presburger-like power and multiplication?
I see, thanks! Could you elaborate on where my line of reasoning (from integral domains to integers to nonnegative integers, assuming the slides are correct) breaks down, though? |
Jan
27 |
revised |
Real-closed fields minus existentials for Presburger-like power and multiplication?
Meh, I can't make up my mind about the title |
Jan
27 |
asked | Real-closed fields minus existentials for Presburger-like power and multiplication? |
Jan
27 |
accepted | Proving inequalities over algebraic structures |
Aug
28 |
awarded | Scholar |
Aug
8 |
awarded | Autobiographer |
Aug
6 |
awarded | Supporter |
Aug
6 |
comment |
Proving inequalities over algebraic structures
Well, the main semiring I care about is the naturals with the usual addition and multiplication (actual multiplication, not the weakened form in that omega Presburger solver tactic, that just expands constant multiplicands), so nothing exotic. Mostly was just curious how general such a solver could be though. Superficially, I'd like something that can tell me things like: forall x. x < x + 1 is true forall x y. x <= y is unknown So really, something that leads to a partial order of polynomials over an arbitrary instance of an (ideally fairly weak) algebraic structure. |
Aug
5 |
awarded | Editor |
Aug
5 |
revised |
Proving inequalities over algebraic structures
Made link prettier |
Aug
4 |
awarded | Student |
Aug
3 |
asked | Proving inequalities over algebraic structures |