Given a logic presented in a sequent calculus, a natural question is that of equivalence of proofs: to determine whether two given proofs are equated by any denotational semantics, i.e. any categorical interpretation of the logic compatible with its cut-elimination procedure. This notion can usually be captured syntactically by a set of rule permutations. Very generally, proofnets can be define...

The compressed word problem for a finitely generated monoid M asks whether two given compressed words over the generators of M represent the same element of M . For string compression, straight-line programs, i.e., contextfree grammars that generate a single string, are used in this paper. It is shown that the compressed word problem for a free inverse monoid of finite rank at least two is comp...

A positive temporal template (or a positive temporal constraint language) is a relational structure whose relations can be defined over a dense linear order of rational numbers using a relational symbol ≤, logical conjunction and disjunction. We provide a complexity characterization for quantified constraint satisfaction problems (QCSP) over positive temporal languages. The considered QCSP prob...

The concepts of L-fuzzy ideal generated by a L-fuzzy subset, L-fuzzy prime and completely prime ideal where L is a complete lattice are considered and some results are proved