Results 131 to 140 of about 11,252 (154)
Some of the next articles are maybe not open access.
The Journal of Symbolic Logic, 1986
AbstractGiven an admissible indexing φ of the countable atomless Boolean algebra ℬ, an automorphism F of ℬ is said to be recursively presented (relative to φ) if there exists a recursive function p ϵ Sym(ω) such that F ∘ φ = φ ∘ p. Our key result on recursiveness: Both the subset of Aut(ℬ) consisting of all those automorphisms which are recursively ...
Madison, E. W., Zimmermann-Huisgen, B.
openaire +1 more source
AbstractGiven an admissible indexing φ of the countable atomless Boolean algebra ℬ, an automorphism F of ℬ is said to be recursively presented (relative to φ) if there exists a recursive function p ϵ Sym(ω) such that F ∘ φ = φ ∘ p. Our key result on recursiveness: Both the subset of Aut(ℬ) consisting of all those automorphisms which are recursively ...
Madison, E. W., Zimmermann-Huisgen, B.
openaire +1 more source
Miniaturization and Combinatorial Approach in Organic Electrochemistry
Chemical Reviews, 2018Koichi Mitsudo, Seiji Suga
exaly
Combinatorial biosynthesis of reduced polyketides
Nature Reviews Microbiology, 2005Kira J Weissman, Peter F Leadlay
exaly
Drug discovery by dynamic combinatorial libraries
Nature Reviews Drug Discovery, 2002Olof Ramström, Jean-Marie Lehn
exaly