Gandhi and Whitehead on Conflict-Solving

Mahatma Gandhi

On Whitehead Precovers

It is proved undecidable in ZFC + GCH whether every Z-module has a {Z}-precover. Let F be a class of R-modules of the form C = {A : Ext(A,C) = 0 for all C ∈ C} for some class C. The first author and Jan Trlifaj proved [7] that a sufficient condition for every module M to have an F -precover is that there is a module B such that F = {B} (= {A : Ext(B,A) = 0}). In [8], generalizing a method used ...

On Generalized Whitehead Products

We define a symmetric monodical pairing G ◦ H among simply connected co-H spaces G and H with the property that S(G◦H) is equivalent to the smash product G∧H as co-H spaces. We further generalize the Whitehead product map to a map G ◦ H → G ∨ H whose mapping cone is the cartesian product. Whitehead products have played an important role in unstable homotopy. They were originally introduced [Whi...

Conflict-Driven Answer Set Solving

We introduce a new approach to computing answer sets of logic programs, based on concepts from constraint processing (CSP) and satisfiability checking (SAT). The idea is to view inferences in answer set programming (ASP) as unit propagation on nogoods. This provides us with a uniform constraintbased framework for the different kinds of inferences in ASP. It also allows us to apply advanced tech...

Economic Thought of Gandhi

"I WOULD LIKE TO SAY TO THE DILIGENT READER OF MY WRITINGS AND to others who are interested in them that I am not at all concerned with appearing to be consistent. In my search after Truth I have discarded many ideas and learnt many new things. Old as I am in age, I have no feeling that I have ceased to grow inwardly or that my growth will stop at the dissolution of the flesh. What I am concern...