15 found
Sort by:
  1. Peter Buser & Bruno Scarpellini (2010). Recursive Analysis of Singular Ordinary Differential Equations. Annals of Pure and Applied Logic 162 (1):20-35.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Bruno Scarpellini (2003). Comments on `Two Undecidable Problems of Analysis'. Minds and Machines 13 (1):79-85.
    We first discuss some technical questions which arise in connection with the construction of undecidable propositions in analysis, in particular in connection with the notion of the normal form of a function representing a predicate. Then it is stressed that while a function f(x) may be computable in the sense of recursive function theory, it may nevertheless have undecidable properties in the realm of Fourier analysis. This has an implication for a conjecture of Penrose's which states that classical physics is (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  3. Bruno Scarpellini (2003). Two Undecidable Problems of Analysis. Minds and Machines 13 (1):49-77.
  4. Bruno Scarpellini (1985). Lower Bound Results on Lengths of Second-Order Formulas. Annals of Pure and Applied Logic 29 (1):29-58.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Bruno Scarpellini (1984). Complete Second Order Spectra. Mathematical Logic Quarterly 30 (32‐34):509-524.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  6. Bruno Scarpellini (1973). On Barinduction of Higher Types for Decidable Predicates. Annals of Mathematical Logic 5 (2):77-163.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Bruno Scarpellini (1972). A Formally Constructive Model for Barrecursion of Higher Types. Mathematical Logic Quarterly 18 (21‐24):321-383.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. Bruno Scarpellini (1972). Induction and Transfinite Induction in Intuitionistic Systems. Annals of Mathematical Logic 4 (2):173-227.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  9. Bruno Scarpellini (1971). Proof Theory and Intuitionistic Systems. New York,Springer-Verlag.
  10. Bruno Scarpellini (1971). Review: C. C. Chang, Logic with Positive and Negative Truth Values. [REVIEW] Journal of Symbolic Logic 36 (2):331-332.
    Direct download  
     
    My bibliography  
     
    Export citation  
  11. Bruno Scarpellini (1971). Review: L. P. Belluce, C. C. Chang, A Weak Completeness Theorem for Infinite Valued First-Order Logic. [REVIEW] Journal of Symbolic Logic 36 (2):332-332.
    Direct download  
     
    My bibliography  
     
    Export citation  
  12. Bruno Scarpellini (1971). Review: L. P. Belluce, Further Results on Infinite Valued Predicate Logic. [REVIEW] Journal of Symbolic Logic 36 (2):332-332.
    Direct download  
     
    My bibliography  
     
    Export citation  
  13. Bruno Scarpellini (1966). On a Family of Models of Zermelo-Fraenkel Set Theory. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 12 (1):191-204.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  14. Bruno Scarpellini (1963). Zwei Unentscheidbare Probleme Der Analysis. Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 9 (18-20):265-289.
    No categories
    Translate to English
    | Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  15. Bruno Scarpellini (1962). Die Nichtaxiomatisierbarkeit Des Unendlichwertigen Prädikatenkalküls Von Łukasiewicz. Journal of Symbolic Logic 27 (2):159-170.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation