Some special effective numberings

doi:10.1007/3-540-18253-5_9

A Connotational Theory of Program Structure pp 71-78 | Cite as

Some special effective numberings

Chapter

First Online: 31 May 2005

93 Downloads

Part of the Lecture Notes in Computer Science book series (LNCS, volume 273)

Keywords

Recursive Function Acceptable Numbering Independence Result Partial Recursive Function Primitive Recursive Function

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, to check access.

Preview

Unable to display preview. Download preview PDF.

Copyright information

About this chapter

Cite this chapter as:: (1987) Some special effective numberings. In: A Connotational Theory of Program Structure. Lecture Notes in Computer Science, vol 273. Springer, Berlin, Heidelberg

DOI https://doi.org/10.1007/3-540-18253-5_9
Publisher Name Springer, Berlin, Heidelberg
Print ISBN 978-3-540-18253-5
Online ISBN 978-3-540-47846-1
eBook Packages Springer Book Archive

Personalised recommendations

Actions

Instant download
Readable on all devices
Own it forever
Local sales tax included if applicable