1,072 reputation
523
bio website
location Aachen, Germany
age 25
visits member for 3 years, 1 month
seen Dec 8 at 20:42

I'm computer science grad student in my first master semester majoring in theoretical computer science.


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!
Dec
3
accepted How much topology for graph theory?
Nov
27
comment How much topology for graph theory?
Where exactly are the notes?
Nov
27
asked How much topology for graph theory?
Nov
22
accepted Generated equivalence relations in logics
Nov
21
revised $\exists x Px \land \exists x Qx$ does not imply $\exists x (P x \land Q x)$
More explenation
Nov
21
answered $\exists x Px \land \exists x Qx$ does not imply $\exists x (P x \land Q x)$
Nov
21
revised $\exists x Px \land \exists x Qx$ does not imply $\exists x (P x \land Q x)$
spelling prettierer relations
Nov
21
suggested approved edit on $\exists x Px \land \exists x Qx$ does not imply $\exists x (P x \land Q x)$
Nov
21
asked Generated equivalence relations in logics