23 found
Order:
  1.  38
    Die Nichtaxiomatisierbarkeit Des Unendlichwertigen Prädikatenkalküls Von Łukasiewicz.Bruno Scarpellini - 1962 - Journal of Symbolic Logic 27 (2):159-170.
  2.  32
    Zwei Unentscheidbare Probleme Der Analysis.Bruno Scarpellini - 1963 - Mathematical Logic Quarterly 9 (18-20):265-289.
    No categories
    Direct download  
    Translate
     
     
    Export citation  
     
    Bookmark   10 citations  
  3.  1
    Proof Theory and Intuitionistic Systems.Bruno Scarpellini - 1971 - New York: Springer Verlag.
  4.  20
    Induction and Transfinite Induction in Intuitionistic Systems.Bruno Scarpellini - 1972 - Annals of Mathematical Logic 4 (2):173.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  5.  75
    Two Undecidable Problems of Analysis.Bruno Scarpellini - 2003 - Minds and Machines 13 (1):49-77.
  6.  37
    Comments on `Two Undecidable Problems of Analysis'.Bruno Scarpellini - 2003 - 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 (4 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  7.  3
    Die Nichtaxiomatisierbarkeit des Unendlichwertigen Prädikatenkalküls von Łukasiewicz.Bruno Scarpellini - 1964 - Journal of Symbolic Logic 29 (3):145-145.
    Direct download  
     
    Export citation  
     
    Bookmark   4 citations  
  8.  2
    On Barinduction of Higher Types for Decidable Predicates.Bruno Scarpellini - 1973 - Annals of Mathematical Logic 5 (2):77.
  9.  49
    Recursive Analysis of Singular Ordinary Differential Equations.Peter Buser & Bruno Scarpellini - 2010 - Annals of Pure and Applied Logic 162 (1):20-35.
    We investigate systems of ordinary differential equations with a parameter. We show that under suitable assumptions on the systems the solutions are computable in the sense of recursive analysis. As an application we give a complete characterization of the recursively enumerable sets using Fourier coefficients of recursive analytic functions that are generated by differential equations and elementary operations.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  10.  19
    L. P. Belluce and C. C. Chang. A Weak Completeness Theorem for Infinite Valued First-Order Logic. The Journal of Symbolic Logic, Vol. 28 No. 1 , Pp. 43–50.Bruno Scarpellini - 1971 - Journal of Symbolic Logic 36 (2):332.
  11.  24
    On a Family of Models of Zermelo-Fraenkel Set Theory.Bruno Scarpellini - 1966 - Mathematical Logic Quarterly 12 (1):191-204.
    Direct download  
     
    Export citation  
     
    Bookmark  
  12.  25
    A Formally Constructive Model for Barrecursion of Higher Types.Bruno Scarpellini - 1972 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 18 (21-24):321-383.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  13.  21
    Complete Second Order Spectra.Bruno Scarpellini - 1984 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 30 (32-34):509-524.
    Direct download  
     
    Export citation  
     
    Bookmark  
  14.  7
    Chang C. C.. Logic with Positive and Negative Truth Values. Proceedings of a Colloquium on Modal and Many-Valued Logics, Helsinki, 23–26 August, 1962, Acta Philosophica Fennica, No. 16, Helsinki 1963, Pp. 19–39. [REVIEW]Bruno Scarpellini - 1971 - Journal of Symbolic Logic 36 (2):331-332.
  15.  9
    Review: C. C. Chang, Logic with Positive and Negative Truth Values. [REVIEW]Bruno Scarpellini - 1971 - Journal of Symbolic Logic 36 (2):331-332.
  16.  17
    A Weak Completeness Theorem for Infinite Valued First-Order Logic.Bruno Scarpellini, L. P. Belluce & C. C. Chang - 1971 - Journal of Symbolic Logic 36 (2):332.
  17.  4
    On a Family of Models of Zermelo-Fraenkel Set Theory.Bruno Scarpellini - 1969 - Journal of Symbolic Logic 34 (4):654-654.
    Direct download  
     
    Export citation  
     
    Bookmark  
  18.  4
    Undecidability Through Fourier Series.Peter Buser & Bruno Scarpellini - 2016 - Annals of Pure and Applied Logic 167 (7):507-524.
  19.  4
    Complete Second Order Spectra.Bruno Scarpellini - 1984 - Mathematical Logic Quarterly 30 (32‐34):509-524.
    Direct download  
     
    Export citation  
     
    Bookmark  
  20.  4
    Lower Bound Results on Lengths of Second-Order Formulas.Bruno Scarpellini - 1985 - Annals of Pure and Applied Logic 29 (1):29-58.
  21.  4
    A Formally Constructive Model for Barrecursion of Higher Types.Bruno Scarpellini - 1972 - Mathematical Logic Quarterly 18 (21‐24):321-383.
    Direct download  
     
    Export citation  
     
    Bookmark  
  22.  4
    Review: L. P. Belluce, Further Results on Infinite Valued Predicate Logic. [REVIEW]Bruno Scarpellini - 1971 - Journal of Symbolic Logic 36 (2):332-332.
  23.  1
    Preface.Bruno Scarpellini - 1972 - Annals of Mathematical Logic 4 (4):341.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark