Carl E. Bredlau. Regressive functions and combinatorial functions. Notre Dame journal of formal logic, vol. 8 no. 4 , pp. 301–310 [Book Review]

Journal of Symbolic Logic 38 (2):333 (1973)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Regressive functions and combinatorial functions.Carl E. Bredlau - 1967 - Notre Dame Journal of Formal Logic 8 (4):301-310.
Regressive Functions and Combinatorial Functions.Carl E. Bredlau - 1973 - Journal of Symbolic Logic 38 (2):333-333.
Admissible sets and recursive equivalence types.Carl E. Bredlau - 1979 - Notre Dame Journal of Formal Logic 20 (2):355-365.
A note on arbitrarily complex recursive functions.Carl H. Smith - 1988 - Notre Dame Journal of Formal Logic 29 (2):198-207.
A double-iteration property of Boolean functions.Carl Lyngholm - 1960 - Notre Dame Journal of Formal Logic 1 (3):111-114.
Normal form generation of ${\rm S}5$ functions via truth functions.Gerald J. Massey - 1968 - Notre Dame Journal of Formal Logic 9 (1):81-85.
Errata: ``A double-iteration property of Boolean functions''.Carl Lyngholm & Wolfgang Yourgrau - 1961 - Notre Dame Journal of Formal Logic 2 (4):259-259.
Hyper-Torre isols.Erik Ellentuck - 1981 - Journal of Symbolic Logic 46 (1):1-5.
Counting functions.Fred Johnson - 1992 - Notre Dame Journal of Formal Logic 33 (4):567-568.
Programming the functions of formal logic.S. Summersbee & A. Walters - 1962 - Notre Dame Journal of Formal Logic 3 (3):133-141.

Analytics

Added to PP
2016-06-30

Downloads
17 (#849,202)

6 months
1 (#1,516,429)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references