Want to take part in these discussions? Sign in if you have an account, or apply for one below
Vanilla 1.1.10 is a product of Lussumo. More Information: Documentation, Community Support.
Wrote recursive subset and partial recursive function. Not much more than stubs.
Thanks! I have added more hyperlinks, have cross-linked the two entries, and have cross linked with entries such as recursion, set, function, definable set.
Nice! I added a couple of properties.
Thanks guys – I’m still adding stuff.
Partial recursive or primitive recursive functions may be regarded as -ary operations of a Lawvere theory. Is there any literature on algebras over these Lawvere theories?
Well – maybe answering my own question – this looks like it might be connected with Joyal’s arithmetic universes or arithmetic pretoposes. As a first guess as to what’s going on, perhaps it’s true that in the Lawvere theory of primitive recursive functions (say), the generating object is a parametrized natural numbers object. And perhaps the Lawvere theory of primitive recursive functions is initial among such Lawvere theories. (Which would be a nice POV on things. But for now I’m guessing without calculating.)
Wild guess: could this be related to the Cockett-Hofstra notion of “Turing category”?
Thanks, Mike. I’m having a look.
1 to 7 of 7