Characterizing the Join-Irreducible Medvedev Degrees

Multi-Valued Logic Programming Semantics: An Algebraic Approach

In this paper we introduce the notion of join irreducibility in the context of bilattices and present a procedural semantics for bilattice based logic programs which uses as its basis the join irreducible elements of the knowledge part of the bilattice The join irreducible elements in a bilattice represent the primitive bits of information present within the system In bilattices which have the ...

On Finite Groups With Two Irreducible Character Degrees

Lattice Embeddings into the R . E . Degrees Preserving 0 and 1 Klaus Ambos - Spies

We show that a finite distributive lattice can be embedded into the r.e. degrees preserving least and greatest element if and only if the lattice contains a join-irreducible noncappable element.

Some connections between powers of conjugacy classes and degrees of irreducible characters in solvable groups

‎Let $G$ be a finite group‎. ‎We say that the derived covering number of $G$ is finite if and only if there exists a positive integer $n$ such that $C^n=G'$ for all non-central conjugacy classes $C$ of $G$‎. ‎In this paper we characterize solvable groups $G$ in which the derived covering number is finite‎.‎ 

Lattice Embeddings into the R . E . Degrees Preserving 0 and 1

We show that a nite distributive lattice can be embedded into the r.e. degrees preserving least and greatest element i the lattice contains a join-irreducible noncappable element.