Login / Signup
The Class of Representable Ordered Monoids has a Recursively Enumerable, Universal Axiomatisation but it is Not Finitely Axiomatisable.
Robin Hirsch
Published in:
Log. J. IGPL (2005)
Keyphrases
</>
inductive inference
recursive functions
recursively enumerable
real valued functions
data sets
neural network
special case
pattern languages