O desátém Hilbertově problému
On a certain event recognizable in real time
On a connection between the word problem and decidability of the equational theory.
On a hierarchy of groups of computable automorphisms.
On a Problem of Boone.
On a relationship between countable functionals and projective trees
On a sufficient condition for strong constructivizability of atomic Boolean algebras.
On a variety of infinite algebras
On certain decompositions of Gödel numberings.
On changes of input/output coding. I.
On changes of input/output coding. II.
On classifying subsets of natural numbers by their computable permutations.
On computable formal concepts in computable formal contexts.
On computable real functions
On constructive nilpotent groups.
On constructivizability of the tensor product of modules.
On distributive fixed-point expressions
On Distributive Fixed-Point Expressions
For every fixed-point expression e of alternation-depth r, we construct a new fixed-point expression e' of alternation-depth 2 and size . Expression e' is equivalent to e whenever operators are distributive and the underlying complete lattice has a co-continuous least upper bound. We alternation-depth but also w.r.t. the increase in size of the resulting expression.
On dot-depth two
On existentially first-order definable languages and their relation to NP