Abstract For every one-relator monoid $$M = \langle A \mid u=v \rangle $$ M = ? A ? u v ? with $$u, v \in A^*$$ , ? <mml:mo...

Following S. Brick, a 2-complex X is called "Kervaire" if all systems of equations, with coefficients in arbitrary groups G and the attaching maps of X as the words in the variable letters, are solvable in an over group of G. An obstruction theory is developed for solving equations modeled on Z = Xp Y, where X and Y are Kervaire 2-complexes and T is a subgraph of Z^\ each connected component of...

This paper is about a practical implementation of a search mechanism, whereby the concepts of an ontological layer are applied over the federal jurisprudence repository of court decisions (STF). After some brief considerations about the basis of this project, we discuss the steps followed to build the system. Resumo. Este artigo apresenta uma implementação real de um mecanismo de busca, onde os...