We survey known results about the complexity of surjective homomorphism problems, studied in the context of related problems in the literature such as list homomorphism, retraction and compaction. In comparison with these problems, surjective homomorphism problems seem to be harder to classify and we examine especially three concrete problems that have arisen from the literature, two of which r...

A knot in a solid torus defines map on the set of (smooth or topological) concordance classes knots S 3 S^3 ...

In his well-known paper \How computer should think" ((Be77b]) Belnap argues that four valued semantics is a very suitable setting for computerized reasoning. In this paper we vindicate this thesis by showing that the logical role that the four-valued structure has among Ginsberg's well-known bilattices is similar to the role that the two-valued algebra has among Boolean algebras. Speciically, w...

Axiomatic bases of admissible rules are obtained for fragments of the substructural logic R-mingle. In particular, it is shown that a “modus-ponens-like” rule introduced by Arnon Avron forms a basis for the admissible rules of its implication and implication-fusion fragments, while a basis for the admissible rules of the full multiplicative fragment requires an additional countably infinite set...

–a notion of amenability for topological semigroups is introduced. a topological semigroup s iscalled johnson amenable if for every banach s -bimodule e , every bounded crossed homomorphism froms to e* is principal. in this paper it is shown that a discrete semigroup s is johnson amenable if and only if1(s) is an amenable banach algebra. also, we show that if a topological semigroup s is johns...