• Luis E. Sanchis


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.


Induction Hypothesis Computable Function Binary Function Total Function Elementary Operation 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag New York Inc. 1988

Authors and Affiliations

  • Luis E. Sanchis
    • 1
  1. 1.School of Computer and Information ScienceSyracuse UniversitySyracuseUSA

Personalised recommendations