Login / Signup
A necessary and sufficient condition for embedding principally decomposable finite lattices into the computable enumerable degrees preserving greatest element.
Burkhard Englert
Published in:
Ann. Pure Appl. Log. (2001)
Keyphrases
</>
sufficient conditions
finite sets
inductive inference
asymptotic stability
recursively enumerable
lyapunov function
vector space
linear complementarity problem
finite number
exponential stability
efficiently computable
markov networks
hypothesis space