Switch to: References

Add citations

You must login to add citations.
  1. Fixed points and unfounded chains.Claudio Bernardi - 2001 - Annals of Pure and Applied Logic 109 (3):163-178.
    By an unfounded chain for a function f:X→X we mean a sequence nω of elements of X s.t. fxn+1=xn for every n. Unfounded chains can be regarded as a generalization of fixed points, but on the other hand are linked with concepts concerning non-well-founded situations, as ungrounded sentences and the hypergame. In this paper, among other things, we prove a lemma in general topology, we exhibit an extensional recursive function from the set of sentences of PA into itself without an (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations