This is a preview. Log in through your library . Abstract Quasi-equational logic concerns with a completeness theorem, i.e. a list of general syntactical rules such that, being given a set of graded ...