My past research interests included differential algebraic equations, nonlinear analysis and relations between symmetries and structural properties.

I recently investigated hierarchical structures, starting from group cohomology, continuing with semi-group theory and ending with lattices and universal algebra.

1d
answered Are monoids with zero and partial homomorphisms related?
1d
awarded Self-Learner
2d
accepted Does P/poly $\neq$ NP/poly have any interesting implications?
2d
answered Does P/poly $\neq$ NP/poly have any interesting implications?
Jun
26
comment Does P/poly $\neq$ NP/poly have any interesting implications?
@EmilJeřábek I think I got it now. NP $\subseteq$ P/poly implies P/poly = NP/poly, because the deterministic algorithm can get both its own advice string for becoming as powerful as NP, together with the advice-string for the language from NP/poly, and this is enough for deciding that language.
Jun
26
comment Does P/poly $\neq$ NP/poly have any interesting implications?
@AndrásSalamon I guess the motivation was too long, compared to the question itself. It would have been enough motivation to just say that the advice string could be a formal axiomatic system (automatically guaranteed to be consistent, grin) whose strength is quickly increasing with input length and that NP is extermely good at exploiting this advice.
Jun
26
comment Does P/poly $\neq$ NP/poly have any interesting implications?
@EmilJeřábek So you say P/poly $\neq$ NP/poly implies NP $\not\subseteq$ P/poly. Do you have any reference for this, or can you explain me how to see this? If yes, then this definitively qualifies as an answer.
Jun
26
asked Does P/poly $\neq$ NP/poly have any interesting implications?
Jun
24
comment What is the formal name for an "entry" in an ontology?
Quine certainly talks about ontology (and ontological commitments) in "On What There Is", where ontology "is the philosophical study of the nature of being, becoming, existence, or reality". He refers to single sorted first order logic, when he says "The variables of quantification, „something‟, „nothing‟, „everything‟, range over our whole ontology, whatever it may be;" and points to modal logic by saying "Possibility, along with the other modalities ..., raises problems upon which I do not mean to imply that we should turn our backs. But we can at least limit modalities to whole statements."
Jun
24
comment What is the formal name for an "entry" in an ontology?
@vzn In the article about ontology languages, the ontology languages are classified as frame-based, description logic-based, and first-order logic-based. It is said that "description logic has more efficient decision problems than first-order predicate logic" and also allows some "modal operations". This nicely sums up the practical drawbacks of first order logic as an ontology language, but still some ontology languages are directly based on it.
Jun
23
awarded Yearling
Jun
23
awarded Yearling
Jun
22
reviewed Reviewed Is it a fallacy to blame someone for an action without reason?
Jun
22
reviewed Looks Good Fallacy: L is almost always wrong. D is L. So D is almost always wrong
Jun
22
reviewed Leave Open What is the term used for logic statements which are non reversible?
Jun
22
reviewed Leave Open Does Burke's political philosophy actually endorse a kind of totalitarianism?
Jun
22
comment Does an Expression in RPN Give us a Linear Way of Writing What Happens in a Circuit?
Because one needs variables anyway, one just omitts the stack. This notion is called straight line program, and it is equivalent to arithmetic circuits: What is the relation between arithmetic circuits and straight line programs?
Jun
22
comment Does an Expression in RPN Give us a Linear Way of Writing What Happens in a Circuit?
No, even with a "duplicate" operation, you can only represent trees, but not general acyclic graphs: Is “duplicate” in RPN enough for replacing variable binding in term expressions?
Jun
21
comment What is the formal name for an "entry" in an ontology?
In philosophy, ontology is important in questions of ontological commitments. Quine's famous On What There Is where he highlights the role of bound first order variables (as opposed to mere names) for ontological commitments. But there are also ontological commitments in first order logic itself.
Jun
21
answered What is the formal name for an "entry" in an ontology?
1 2 3 4 5