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.


Jul
11
comment Is infinitary logics $\mathcal{L}_{\infty\omega}$ an abstract logic?
"$\varphi_T$ identifies a Turing Machine T" means that all models of $\varphi_T$ are isomorphic to T. Does this make sense? Thanks for the hints.
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$.
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!
Nov
27
comment How much topology for graph theory?
Where exactly are the notes?
Jun
23
comment Stochastic Automaton accepting every word with same probability
Which is exactly what you want since you want to avoid a probability higher then $c$.
Jun
9
comment Constraint satisfaction problem - Arc consistency
Thats correct this is what makes it arc-inconsitent.
May
5
comment Infinite Chomp is a finite game?
Thanks. That narrows it down to problem I have. There are infinite proper subsets of $\omega$ right (e.g. $\omega \setminus \{1\})$? Isn't it possible for example to choose a bite of $(1\times1)$ still resulting in a infinite choclate bar of size $\omega-1 \times \omega-1$?
Jan
20
comment First Order logic with vertex covers
Try using Ehrenfeucht–Fraïssé game. I'm trying to figure it out, too.
Jan
19
comment Define infinite path with a finite relation in a graph with Least Fixed Point logic
Okay, the existence of a reachable node is similar to the transitive closure but how do I model an infinite path with a single formula without a set of formulas?
Jan
14
comment All classes of finite structures are axiomatizable in $L_{\infty\omega}$
Thanks a lot. Out of curiosity: Why is $L_{\infty\omega}$ a proper class?
Jan
13
comment Class of structures isomorphic to $(\mathbb{Z},<)$ in infinitary logic $L_{\omega_1 \omega}$
Thanks! That helps me a lot.
Jan
13
comment Class of structures isomorphic to $(\mathbb{Z},<)$ in infinitary logic $L_{\omega_1 \omega}$
Can you give an example of an infinite interval in $\mathbb{Z} \times 2$?
Jan
13
comment Class of structures isomorphic to $(\mathbb{Z},<)$ in infinitary logic $L_{\omega_1 \omega}$
I think you are right so it would be expressable in $L_{\omega\omega}$. But this is kind of confusing regarding Exercise 1.4.(i). This exercise could have easily been restricted to first order logic if you are right.
Jan
12
comment Class of structures isomorphic to $(\mathbb{Z},<)$ in infinitary logic $L_{\omega_1 \omega}$
Finitely many quantifiers and countable conjunctions and disjunctions.
Nov
11
comment Reaching elements with finite applications of the successor relation in well-ordered sets
How is $G$ defined?
Nov
10
comment Comparing the cardinality of sets
Can you give me a hint for a injective function from $\mathbb{R}^2$ to $\mathbb{R}$?
Nov
9
comment Comparing the cardinality of sets
Probably not ...
Nov
4
comment Set with lower bound but without an infimum w.r.t. $\subseteq$
Yes that exactly right. $x,y$ are elements of $M$ but there are sets themself partially ordered by $\subseteq$.
Oct
28
comment Why is the class of all sets a stage?
p. 19 bottom: $\mathbb{S}$ is the only stage that is a proper class