We separate many of the basic fragments of classical logic which are used in reverse constructive mathematics. A group of related Kripke and topological models is used to show that various fragments of the Weak Law of the Excluded Middle, the Limited Principle of Omniscience, and Markov’s Principle, including Weak Markov’s Principle, do not imply each other. §

It is known that any linear code allows for a decoding strategy that treats errors and erasures separately over an error-erasure channel. In particular, a carefully designed paritycheck matrix makes efficient erasure correction possible through iterative decoding while instantly providing the necessary paritycheck equations for independent error correction on demand. The separating redundancy o...

The ALMA Band 6 (211-275 GHz) receivers use sideband-separating SIS mixer-preamplifiers with dual 4-12 GHz IF outputs. The sideband-separating mixers are of the phasing type, with the LO driving two component mixers in-phase and the RF signal connected to the mixers through a quadrature hybrid. The IF outputs of the mixers are amplified, then combined in a quadrature hybrid which separates the ...

The theory of separating systems has been applied in different areas of science and technology such as automata synthesis, technical diagnosis, and authenticating ownership claims. Constructions of (2 2)-separating systems derived from error-correcting codes are given, together with bounds on their parameters based on distance considerations.

We introduce a proof technique in-calculus which can facilitate inductive reasoning on-terms by separating certain-developments from other-reductions. We present proofs based on this technique for several fundamental theorems in-calculus such as the Church-Rosser theorem, the standardisation theorem, the conservation theorem and the normalisation theorem. The appealing features of these proofs ...

Separating codes find applications in many fields including automata theory and digital fingerprinting. It is known that the Kerdock code of sufficient order is (2 1)and (2 2)-separating, but the separating weight is only known by a lower bound due to Sagalovich. In this correspondence, we prove that the lower bound on the (2 1)-separating weight is met with equality.