29 found
Order:
Disambiguations
Wilfried Buchholz [18]W. Buchholz [9]Walter Buchholz [2]Walther Buchholz [1]
  1.  14
    Epsilon Substitution Method for Elementary Analysis.Grigori Mints, Sergei Tupailo & Wilfried Buchholz - 1996 - Archive for Mathematical Logic 35 (2):103-130.
    We formulate epsilon substitution method for elementary analysisEA (second order arithmetic with comprehension for arithmetical formulas with predicate parameters). Two proofs of its termination are presented. One uses embedding into ramified system of level one and cutelimination for this system. The second proof uses non-effective continuity argument.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark   20 citations  
  2.  60
    Notation Systems for Infinitary Derivations.Wilfried Buchholz - 1991 - Archive for Mathematical Logic 30 (5-6):277-296.
  3.  38
    A Uniform Approach to Fundamental Sequences and Hierarchies.Wilfried Buchholz, Adam Cichon & Andreas Weiermann - 1994 - Mathematical Logic Quarterly 40 (2):273-286.
    In this article we give a unifying approach to the theory of fundamental sequences and their related Hardy hierarchies of number-theoretic functions and we show the equivalence of the new approach with the classical one.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   18 citations  
  4.  8
    A New System of Proof-Theoretic Ordinal Functions.W. Buchholz - 1986 - Annals of Pure and Applied Logic 32 (3):195-207.
  5.  11
    Refined Program Extraction From Classical Proofs.Ulrich Berger, Wilfried Buchholz & Helmut Schwichtenberg - 2002 - Annals of Pure and Applied Logic 114 (1-3):3-25.
    The paper presents a refined method of extracting reasonable and sometimes unexpected programs from classical proofs of formulas of the form ∀x∃yB . We also generalize previously known results, since B no longer needs to be quantifier-free, but only has to belong to a strictly larger class of so-called “goal formulas”. Furthermore we allow unproven lemmas D in the proof of ∀x∃yB , where D is a so-called “definite” formula.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  6.  4
    Proof-Theoretic Analysis of Termination Proofs.Wilfried Buchholz - 1995 - Annals of Pure and Applied Logic 75 (1-2):57-65.
  7.  16
    Explaining the Gentzen–Takeuti Reduction Steps: A Second-Order System.Wilfried Buchholz - 2001 - Archive for Mathematical Logic 40 (4):255-272.
    Using the concept of notations for infinitary derivations we give an explanation of Takeuti's reduction steps on finite derivations (used in his consistency proof for Π1 1-CA) in terms of the more perspicious infinitary approach from [BS88].
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  8.  12
    An Independence Result for (II11-CA)+BI.Wilfried Buchholz - 1987 - Annals of Pure and Applied Logic 33 (2):131-155.
  9.  20
    Anton Setzer. Well-Ordering Proofs for Martin-Löf Type Theory. Annals of Pure and Applied Logic, Vol. 92 , Pp. 113–159.Wilfried Buchholz - 2000 - Bulletin of Symbolic Logic 6 (4):478-479.
  10.  79
    Provable Wellorderings of Formal Theories for Transfinitely Iterated Inductive Definitions.Kurt Schutte, W. Buchholz & W. Pohlers - 1983 - Journal of Symbolic Logic 48 (3):878.
  11.  4
    An Intuitionistic Fixed Point Theory.Wilfried Buchholz - 1997 - Archive for Mathematical Logic 37 (1):21-27.
    . In this article we prove that a certain intuitionistic version of the well-known fixed point theory \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\widehat{\rm ID}_1$\end{document} is conservative over \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document} $\mbox{\sf HA}$\end{document} for almost negative formulas.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  12.  26
    Provable Wellorderings of Formal Theories for Transfinitely Iterated Inductive Definitions.W. Buchholz & W. Pohlers - 1978 - Journal of Symbolic Logic 43 (1):118-125.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  13.  17
    Finitary Treatment of Operator Controlled Derivations.Wilfried Buchholz - 2001 - Mathematical Logic Quarterly 47 (3):363-396.
    By combining the methods of two former papers of ours we develop a finitary ordinal analysis of the axiom system KPi of Kripke-P atek set theory with an inaccessible universe. As a main result we obtain an upper bound for the provably recursive functions of KPi.
    Direct download (8 more)  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  14
    Stephen G. Simpson. Nonprovability of Certain Combinatorial Properties of Finite Trees. Harvey Friedman's Research on the Foundations of Mathematics, Edited by L. A. Harrington, M. D. Morley, A. Ṧčedrov, and S. G. Simpson, Studies in Logic and the Foundations of Mathematics, Vol. 117, North-Holland, Amsterdam, New York, and Oxford, 1985, Pp. 87–117. , Pp. 45–65.). [REVIEW]W. Buchholz - 1990 - Journal of Symbolic Logic 55 (2):868-869.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark  
  15.  4
    Preface.Wilfried Buchholz & Reinhard Kahle - 2005 - Annals of Pure and Applied Logic 133 (1-3):1.
  16.  29
    Darwinismus und Zeitgeist.Fritz Bolle & Walter Buchholz - 1962 - Zeitschrift für Religions- Und Geistesgeschichte 14 (2):143-182.
    Überblicken wir noch einmal das ganze riesige Gebiet des Geistesgeschehens vor und nach der Jahrhundertwende, soweit es darwinistische Züge erkennen läßt, so können wir eines feststellen : Ausgenommen die Konservativen und die Kirchen, die beide angesichts des stürmischen Vorwärtsdrängens darwinistischer Gedankengänge in die Defensive gehen müssen, bedienen sich so gut wie alle geistigen Strömungen des Darwinismus: Die Sozialisten, weil Darwins "Naturtheorie" mit ihrer Gesetzlichkeit des biologischen Fortschritts Gewähr zu bieten scheint, daß auch im Gesellschaftlichen eherne Gesetze des Fortschritts walten, und (...)
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  17.  5
    Heindorf Lutz. Elementare Beweistheorie. Wissenschaftsverlag B. I., Mannheim, Leipzig, Wien, und Zürich, 1994, 240 S.Wilfried Buchholz - 1996 - Journal of Symbolic Logic 61 (3):1051-1052.
    Direct download (3 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  18.  18
    THISBE - ein Erklärungsvorschlag.Walter Buchholz - 1970 - Zeitschrift für Religions- Und Geistesgeschichte 22 (1):80-81.
    Direct download (4 more)  
    Translate
     
     
    Export citation  
     
    Bookmark  
  19.  15
    Induktive Definitionen Und Dilatoren.Wilfried Buchholz - 1988 - Archive for Mathematical Logic 27 (1):51-60.
    In this paper we give a new and comparatively simple proof of the following theorem by Girard [1]:“If ∀x∈ ${\cal O}$ ∃y∈ ${\cal O}$ ψ(x,y) (where the relationψ is arithmetic and positive in Kleene's ${\cal O}$ ), then there exists a recursive DilatorD such that ∀α≧ω∀x∈ ${\cal O}$ <α∃y∈ ${\cal O}$ (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  20.  10
    A Term Calculus for (Co-) Recursive Definitions on Streamlike Data Structures.Wilfried Buchholz - 2005 - Annals of Pure and Applied Logic 136 (1):75-90.
    We introduce a system of simply typed lambda terms and show that a rather comprehensive class of recursion equations on streams or non-wellfounded trees can be solved in our system. Moreover certain conditions are presented which guarantee that the defined functionals are primitive recursive. As a major example we give a co-recursive treatment of Mints’ continuous cut-elimination operator.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark  
  21.  6
    Notation Systems for Infinitary Derivations.Wilfried Buchholz & Sergei Tupailo - 2002 - Bulletin of Symbolic Logic 8 (3):437-439.
  22.  2
    W. A. Howard. A System of Abstract Constructive Ordinals. The Journal of Symbolic Logic, Vol. 37 , Pp. 355–374.Wilfried Buchholz - 1985 - Journal of Symbolic Logic 50 (1):243-244.
  23.  4
    Systems of Predicative Analysis, II: Representations of Ordinals.Solomon Feferman, Peter Aczel, Jane Bridge, W. Buchholz & J. Diller - 1983 - Journal of Symbolic Logic 48 (3):876-877.
    Direct download  
     
    Export citation  
     
    Bookmark  
  24.  6
    Review: W. A. Howard, A System of Abstract Constructive Ordinals. [REVIEW]Wilfried Buchholz - 1985 - Journal of Symbolic Logic 50 (1):243-244.
  25.  1
    Abracadabra.Walther Buchholz - 1956 - Zeitschrift für Religions- Und Geistesgeschichte 8 (3):257-259.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  3
    Review: Stephen G. Simpson, Nonprovability of Certain Combinatorial Properties of Finite Trees. [REVIEW]W. Buchholz - 1990 - Journal of Symbolic Logic 55 (2):868-869.
  27. REVIEWS-Refined Program Extraction From Classical Proofs.U. Berger, W. Buchholz, H. Schwichtenberg & N. Danner - 2003 - Bulletin of Symbolic Logic 9 (1):47-48.
     
    Export citation  
     
    Bookmark  
  28. Proof Theory of Iterated Inductive Definitions Revisited.W. Buchholz - forthcoming - Archive for Mathematical Logic.
     
    Export citation  
     
    Bookmark  
  29. Three Papers on Proof Theory.W. Buchholz, S. Tupailo & Toshiyasu Arai - 2002 - Bulletin of Symbolic Logic 8 (3):437-438.