Hyperenumeration

Luis E. Sanchis
Additional contact information
Luis E. Sanchis: Syracuse University, School of Computer and Information Science

Chapter Chapter 5 in Reflexive Structures, 1988, pp 163-227 from Springer

Abstract: Abstract In this chapter we introduce new closure conditions, much stronger than those considered before. These conditions apply primarily to classes of predicates but can be extended to classes of functions via graph predicates. They are nonfinitary, for they involve different forms of universal quantification. Our main interest is to find reflexive structures that are closed under this type of condition. While they are not total in the sense defined in Chapter 2, we shall see that they may satisfy important selector properties.

Keywords: Induction Hypothesis; Computable Function; Binary Function; Total Function; Elementary Operation (search for similar items in EconPapers)
Date: 1988
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-1-4612-3878-2_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461238782

DOI: 10.1007/978-1-4612-3878-2_5

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().