Reputation
1,146
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
8 27
Impact
~24k people reached

May
9
revised Finding 1000th 5-smooth number
Beautify, Latex ...
May
9
suggested approved edit on Finding 1000th 5-smooth number
May
9
accepted Reusing Variables First Order Logics
May
8
asked Reusing Variables First Order Logics
Mar
28
awarded  Tumbleweed
Mar
21
accepted Natural Decision Problem not in PTIME
Mar
21
answered Natural Decision Problem not in PTIME
Mar
3
asked Natural Decision Problem not in PTIME
Feb
13
comment Selecting a unique pair satisfying a condition $\varphi$ with an ordering
Okay, you're right. I tried to make this problem as general as possible. But it back-fired. $A$ is finite. Furthermore, we assume that there is always a pair which satisfies $\varphi$.
Feb
13
revised Selecting a unique pair satisfying a condition $\varphi$ with an ordering
Specialization
Feb
12
asked Selecting a unique pair satisfying a condition $\varphi$ with an ordering
Feb
7
accepted Transforming Nested Fixed-Point Formulas into Infinitary Logic Formulas with Finitely many Variables
Feb
5
answered Transforming Nested Fixed-Point Formulas into Infinitary Logic Formulas with Finitely many Variables
Feb
5
revised Transforming Nested Fixed-Point Formulas into Infinitary Logic Formulas with Finitely many Variables
correct the set
Feb
3
revised Transforming Nested Fixed-Point Formulas into Infinitary Logic Formulas with Finitely many Variables
correct
Feb
3
revised Transforming Nested Fixed-Point Formulas into Infinitary Logic Formulas with Finitely many Variables
correct formula
Feb
2
asked Transforming Nested Fixed-Point Formulas into Infinitary Logic Formulas with Finitely many Variables
Dec
10
awarded  Popular Question
Dec
10
comment Computable Criteria to check whether a given basis is a Gröbner Basis
I think what your describing is the cancellation criterion of Buchberger's algorithm. I was trying to avoid that computation and was looking for some kind of short cut to proof that the computation can be stopped at this point. I am starting to think that the answer is that there is no such short-cut.
Dec
3
comment How much topology for graph theory?
Exactly what I was looking for. Thanks!