Switch to: References

Add citations

You must login to add citations.
  1. Functional Interpretations of Constructive Set Theory in All Finite Types.Justus Diller - 2008 - Dialectica 62 (2):149-177.
    Gödel's dialectica interpretation of Heyting arithmetic HA may be seen as expressing a lack of confidence in our understanding of unbounded quantification. Instead of formally proving an implication with an existential consequent or with a universal antecedent, the dialectica interpretation asks, under suitable conditions, for explicit ‘interpreting’ instances that make the implication valid. For proofs in constructive set theory CZF‐, it may not always be possible to find just one such instance, but it must suffice to explicitly name a set (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Intuition, Iteration, Induction.Mark van Atten - 2024 - Philosophia Mathematica 32 (1):34-81.
    Brouwer’s view on induction has relatively recently been characterised as one on which it is not only intuitive (as expected) but functional, by van Dalen. He claims that Brouwer’s ‘Ur-intuition’ also yields the recursor. Appealing to Husserl’s phenomenology, I offer an analysis of Brouwer’s view that supports this characterisation and claim, even if assigning the primary role to the iterator instead. Contrasts are drawn to accounts of induction by Poincaré, Heyting, and Kreisel. On the phenomenological side, the analysis provides an (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On n-quantifier induction.Charles Parsons - 1972 - Journal of Symbolic Logic 37 (3):466-482.
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • Logical problems of functional interpretations.Justus Diller - 2002 - Annals of Pure and Applied Logic 114 (1-3):27-42.
    Gödel interpreted Heyting arithmetic HA in a “logic-free” fragment T 0 of his theory T of primitive recursive functionals of finite types by his famous Dialectica-translation D . This works because the logic of HA is extremely simple. If the logic of the interpreted system is different—in particular more complicated—, it forces us to look for different and more complicated functional translations. We discuss the arising logical problems for arithmetical and set theoretical systems from HA to CZF . We want (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Functional interpretations of constructive set theory in all finite types.Justus Diller - 2008 - Dialectica 62 (2):149–177.
    Gödel's dialectica interpretation of Heyting arithmetic HA may be seen as expressing a lack of confidence in our understanding of unbounded quantification. Instead of formally proving an implication with an existential consequent or with a universal antecedent, the dialectica interpretation asks, under suitable conditions, for explicit 'interpreting' instances that make the implication valid. For proofs in constructive set theory CZF-, it may not always be possible to find just one such instance, but it must suffice to explicitly name a set (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation