Does anyone know of any proof systems in which some but not all contents have negations? I’m looking for examples for a developing project.

Advertisements