Some more independence results in complexity theory

Independence in Algebraic Complexity Theory

Yet some more complexity results for default logic

We identify several new tractable subsets and several new intractable simple cases for reasoning in the propositional version of Reiter’s default logic. The majority of our findings are related to brave reasoning. By making some intuitive observations, most classes that we identify can be derived quite easily from some subsets of default logic already known in the literature. Some of the subset...

Some independence results on reflection

We prove that there is a certain degree of independence between stationary reflection phenomena at different cofinalities.

Some Independence Results for EquationalUni

For nite convergent term-rewriting systems the equational uniication problem is shown to be recursively independent of the equa-tional matching problem, the word matching problem, and the (simultaneous) 2 nd-order equational matching problem. We also present some new decidability results for simultaneous equational uniication and 2 nd-order equational matching.

Some Independence Results on Reeection

We prove that there is a certain degree of independence between stationary reeection phenomena at diierent coonalities.