z-logo
open-access-imgOpen Access
Can a lambda-model have a recursively enumerable theory ?
Author(s) -
Chantal Berline
Publication year - 2007
Publication title -
hal (le centre pour la communication scientifique directe)
Language(s) - English
Resource type - Conference proceedings
Subject(s) - recursively enumerable language , lambda , computer science , recursively enumerable set , theoretical computer science , discrete mathematics , calculus (dental) , algorithm , mathematics , physics , medicine , dentistry , optics

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here