Recursive Word‐Functions over Infinite Alphabets

DOI10.1002/MALQ.19700160203MaRDI QIDQ5595154zbMATH OpenOpenAlexFDO

Authors

Publication date 1970

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.19700160203

zbMATH Keywords

recursion theory, constructive mathematics

Cited in

(5)

• scientific article; zbMATH DE number 7559499 (Why is no real title available?)
• A comparison of the indices arising in the transfinite iteration of functions
• On the power of recursive word-functions without concatenation
• Smooth words over arbitrary alphabets
• On quasi-universal word functions

This page was built for publication: Recursive Word‐Functions over Infinite Alphabets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5595154)