Order:
Disambiguations
Wilfried Sieg [63]W. Sieg [5]Wilfred Sieg [2]Wilfrid Sieg [1]
  1. Hilbert's Programs: 1917-1922.Wilfried Sieg - 1999 - Bulletin of Symbolic Logic 5 (1):1-44.
    Hilbert's finitist program was not created at the beginning of the twenties solely to counteract Brouwer's intuitionism, but rather emerged out of broad philosophical reflections on the foundations of mathematics and out of detailed logical work; that is evident from notes of lecture courses that were given by Hilbert and prepared in collaboration with Bernays during the period from 1917 to 1922. These notes reveal a dialectic progression from a critical logicism through a radical constructivism toward finitism; the progression has (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   12 citations  
  2. Dedekind's Analysis of Number: Systems and Axioms.Wilfried Sieg & Dirk Schlimm - 2005 - Synthese 147 (1):121 - 170.
    Wilfred Sieg and Dirk Schlimm. Dedekind's Analysis of Number: Systems and Axioms.
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   8 citations  
  3.  10
    Fragments of Arithmetic.Wilfried Sieg - 1983 - Annals of Pure and Applied Logic 28 (1):33-71.
    We establish by elementary proof-theoretic means the conservativeness of two subsystems of analysis over primitive recursive arithmetic. The one subsystem was introduced by Friedman [6], the other is a strengthened version of a theory of Minc [14]; each has been shown to be of considerable interest for both mathematical practice and metamathematical investigations. The foundational significance of such conservation results is clear: they provide a direct finitist justification of the part of mathematical practice formalizable in these subsystems. The results are (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   26 citations  
  4.  21
    On Tait on Kant and Finitism.W. Sieg - 2016 - Journal of Philosophy 113 (5/6):274-285.
    In his “Kant and Finitism” Tait attempts to connect his analysis of finitist arithmetic with Kant’s perspective on arithmetic. The examination of this attempt is the basis for a distinctive view on the dramatic methodological shift from Kant to Dedekind and Hilbert. Dedekind’s 1888 essay “Was sind und was sollen die Zahlen?” gives a logical analysis of arithmetic, whereas Hilbert’s 1899 book “Grundlagen der Geometrie” presents such an analysis of geometry or, as Hilbert puts it, of our spatial intuition. This (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  5.  29
    Godel on Computability.W. Sieg - 2006 - Philosophia Mathematica 14 (2):189-207.
    The identification of an informal concept of ‘effective calculability’ with a rigorous mathematical notion like ‘recursiveness’ or ‘Turing computability’ is still viewed as problematic, and I think rightly so. I analyze three different and conflicting perspectives Gödel articulated in the three decades from 1934 to 1964. The significant shifts in Gödel's position underline the difficulties of the methodological issues surrounding the Church-Turing Thesis.
    Direct download (10 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  6.  9
    Dedekind’s Analysis of Number: Systems and Axioms.Wilfried Sieg & Dirk Schlimm - 2005 - Synthese 147 (1):121-170.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  7.  7
    Herbrand Analyses.Wilfried Sieg - 1991 - Archive for Mathematical Logic 30 (5-6):409-441.
    Herbrand's Theorem, in the form of $$\underset{\raise0.3em\hbox{$\smash{\scriptscriptstyle-}$}}{\exists } $$ -inversion lemmata for finitary and infinitary sequent calculi, is the crucial tool for the determination of the provably total function(al)s of a variety of theories. The theories are (second order extensions of) fragments of classical arithmetic; the classes of provably total functions include the elements of the Polynomial Hierarchy, the Grzegorczyk Hierarchy, and the extended Grzegorczyk Hierarchy $\mathfrak{E}^\alpha $ , α < ε0. A subsidiary aim of the paper is to show (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography   11 citations  
  8.  57
    An Abstract Model For Parallel Computations: Gandy’s Thesis.Wilfried Sieg & John Byrnes - 1999 - The Monist 82 (1):150-164.
    Wilfried Sieg and John Byrnes. AnModel for Parallel Computation: Gandy's Thesis.
    Direct download (9 more)  
     
    Export citation  
     
    My bibliography   6 citations  
  9.  22
    Dedekind's Abstract Concepts: Models and Mappings.Wilfried Sieg & Dirk Schlimm - 2014 - Philosophia Mathematica:nku021.
    Dedekind's mathematical work is integral to the transformation of mathematics in the nineteenth century and crucial for the emergence of structuralist mathematics in the twentieth century. We investigate the essential components of what Emmy Noether called, his ‘axiomatic standpoint’: abstract concepts, models, and mappings.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  10.  31
    Mechanical Procedures and Mathematical Experience.Wilfried Sieg - 1994 - In Alexander George (ed.), Mathematics and Mind. Oxford University Press. pp. 71--117.
    Wilfred Sieg. Mechanical Procedures and Mathematical Experience.
    No categories
    Direct download (6 more)  
     
    Export citation  
     
    My bibliography   7 citations  
  11. Only Two Letters: The Correspondence Between Herbrand and Gödel.Wilfried Sieg - 2005 - Bulletin of Symbolic Logic 11 (2):172-184.
    Two young logicians, whose work had a dramatic impact on the direction of logic, exchanged two letters in early 1931. Jacques Herbrand initiated the correspondence on 7 April and Kurt Gödel responded on 25 July, just two days before Herbrand died in a mountaineering accident at La Bérarde (Isère). Herbrand's letter played a significant role in the development of computability theory. Gödel asserted in his 1934 Princeton Lectures and on later occasions that it suggested to him a crucial part of (...)
    Direct download (13 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  12. Meeting of the Association for Symbolic Logic: Washington, D. C., 1985.Martin Davis, Edgar E. K. Lopez-Escobar & Wilfred Sieg - 1986 - Journal of Symbolic Logic 51 (4):1085-1092.
  13.  25
    Church Without Dogma: Axioms for Computability.Wilfried Sieg - unknown
    Church's and Turing's theses dogmatically assert that an informal notion of effective calculability is adequately captured by a particular mathematical concept of computability. I present an analysis of calculability that is embedded in a rich historical and philosophical context, leads to precise concepts, but dispenses with theses. To investigate effective calculability is to analyze symbolic processes that can in principle be carried out by calculators. This is a philosophical lesson we owe to Turing. Drawing on that lesson and recasting work (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  14.  29
    Step by Recursive Step: Church's Analysis of Effective Calculability.Wilfried Sieg - 1997 - Bulletin of Symbolic Logic 3 (2):154-180.
    Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why, for example, was "Church's Thesis" put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Gödel's general recursiveness, not his own λ (...)
    Direct download (8 more)  
     
    Export citation  
     
    My bibliography   5 citations  
  15.  14
    Calculations by Man and Machine: Conceptual Analysis.Wilfried Sieg - unknown
    Wilfried Sieg. Calculations by Man and Machine: Conceptual Analysis.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  16.  39
    Hilbert's Program Sixty Years Later.Wilfried Sieg - 1988 - Journal of Symbolic Logic 53 (2):338-348.
  17.  3
    The AProS Project: Strategic Thinking & Computational Logic.Wilfried Sieg - 2007 - Logic Journal of the IGPL 15 (4):359-368.
    The paper discusses tools for teaching logic used in Logic & Proofs, a web-based introduction to modern logic that has been taken by more than 1,300 students since the fall of 2003. The tools include a wide array of interactive learning environments or cognitive mini-tutors; most important among them is the Carnegie Proof Lab. The Proof Lab is a sophisticated interface for constructing natural deduction proofs and is central, as strategically guided discovery of proofs is the distinctive focus of the (...)
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  18.  48
    Relative Consistency and Accessible Domains.Wilfried Sieg - 1990 - Synthese 84 (2):259 - 297.
    Wilfred Sieg. Relative Consistency and Accesible Domains.
    Direct download (7 more)  
     
    Export citation  
     
    My bibliography   4 citations  
  19.  53
    Normal Natural Deduction Proofs (in Classical Logic).Wilfried Sieg & John Byrnes - 1998 - Studia Logica 60 (1):67-106.
    Natural deduction (for short: nd-) calculi have not been used systematically as a basis for automated theorem proving in classical logic. To remove objective obstacles to their use we describe (1) a method that allows to give semantic proofs of normal form theorems for nd-calculi and (2) a framework that allows to search directly for normal nd-proofs. Thus, one can try to answer the question: How do we bridge the gap between claims and assumptions in heuristically motivated ways? This informal (...)
    Direct download (12 more)  
     
    Export citation  
     
    My bibliography   2 citations  
  20. Kurt Gödel Collected Works IV-V: Correspondence.Solomon Feferman, John W. Dawson, Warren Goldfarb, Charles Parsons & Wilfried Sieg - 2004 - Bulletin of Symbolic Logic 10 (4):558-563.
  21.  42
    Foundations for Analysis and Proof Theory.Wilfried Sieg - 1984 - Synthese 60 (2):159 - 200.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   3 citations  
  22.  25
    K-Graph Machines: Generalizing Turing's Machines and Arguments.Wilfried Sieg & John Byrnes - unknown
    Wilfred Sieg and John Byrnes. K-Graph Machines: Generalizing Turing's Machines and Arguments.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  23.  24
    The Ways of Hilbert's Axiomatics: Structural and Formal.Wilfried Sieg - 2014 - Perspectives on Science 22 (1):133-157.
    Hilbert gave lectures on the foundations of mathematics throughout his career. Notes for many of them have been preserved and are treasures of information; they allow us to reconstruct the path from Hilbert's logicist position, deeply influenced by Dedekind and presented in lectures starting around 1890, to the program of finitist proof theory in the early 1920s. The development toward proof theory begins, in some sense, in 1917 when Hilbert gave his talk Axiomatisches Denken in Zürich. This talk is rooted (...)
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography  
  24.  10
    Calculations by Man and Machine: Mathematical Presentation.Wilfried Sieg - unknown
    Wilfried Sieg. Calculations by Man and Machine: Mathematical Presentation.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  25.  15
    Note by the Guest Editors.Wilfried Sieg & Frank Pfenning - 1998 - Studia Logica 60 (1):1-1.
    Direct download (5 more)  
     
    Export citation  
     
    My bibliography  
  26.  16
    Program Transformation and Proof Transformation.Wilfried Sieg & Stanley S. Wainer - unknown
    Wilfred Sieg and Stanley S. Wainer. Program Transformation and Proof Transformation.
    No categories
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  27.  41
    David Hilbert and Paul Bernays, Grundlagen der Mathematik I and II: A Landmark.Wilfried Sieg & Mark Ravaglia - unknown
    Wilfred Sieg and Mark Ravaglia. David Hilbert and Paul Bernays, Grundlagen der Mathematik I and II: A Landmark.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  28.  29
    Toward Finitist Proof Theory.Wilfried Sieg - unknown
    This is a summary of developments analysed in my (1997A). A first version of that paper was presented at the workshop Modern Mathematical Thought in Pittsburgh (September 21-24, 1995).
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  29.  19
    Unification For Quantified Formulae.Wilfried Sieg - unknown
    — via appropriate substitutions — syntactically identical. The method can be applied directly to quantifierfree formulae and, in this paper, will b e extended in a natural and strai ghlforward way to quantified formulae.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  30.  2
    Mechanisms and Search: Aspects of Proof Theory.Wilfried Sieg - unknown
    Wilfred Sieg. Mechanisms and Search: Aspects of Proof Theory.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography   1 citation  
  31. Computing Machines.Wilfried Sieg & Rossella Lupacchini - unknown
    Any thorough discussion of computing machines requires the examination of rigorous concepts of computation and is facilitated by the distinction between mathematical, symbolic and physical computations. The delicate connection between the three kinds of computations and the underlying questions, "What are machines?" and "When are they computing?", motivate an extensive theoretical and historical discussion. The relevant outcome of this..
    Translate
     
     
    Export citation  
     
    My bibliography  
  32.  26
    Formal Systems, Church Turing Thesis, and Gödel's Theorems: Three Contributions to The MIT Encyclopedias of Cognitive Science.Wilfried Sieg - unknown
    Wilfried Sieg. Formal Systems, Church Turing Thesis, and Gödel's Theorems: Three Contributions to The MIT Encyclopedias of Cognitive Science.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  33. Trees in Metamathematics.Wilfried Sieg - 1977 - Dissertation, Stanford University
    No categories
     
    Export citation  
     
    My bibliography   1 citation  
  34.  13
    Review: Neil Tennant, Natural Logic. [REVIEW]Wilfried Sieg - 1983 - Journal of Symbolic Logic 48 (1):215-217.
  35.  23
    Mathematics Studies Machines.Daniele Mundici & Wilfried Sieg - unknown
    Machines were introduced as calculating devices to simulate operations carried out by human computors following fixed algorithms: this is true for the early mechanical calculators devised by Pascal and Leibniz, for the analytical engine built by Babbage, and the theoretical machines introduced by Turing. The distinguishing feature of the latter is their universality: They are claimed to be able to capture any algorithm whatsoever and, conversely, any procedure they can carry out is evidently algorithmic. The study of such "paper machines" (...)
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  36.  20
    Proof Theory.Wilfried Sieg - unknown
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  37.  9
    Of the Association for Symbolic Logic.Sergei Artemov, Peter Koellner, Michael Rabin, Jeremy Avigad, Wilfried Sieg, William Tait & Haim Gaifman - 2006 - Bulletin of Symbolic Logic 12 (3-4):503.
  38.  17
    A Symposium on Hilbert's Program.Wilfrid Hodges & Wilfried Sieg - 1988 - Journal of Symbolic Logic 53 (2):337.
  39.  15
    Searching for Proofs.Wilfried Sieg & Richard Scheines - unknown
    The Carnegie Mellon Proof Tutor project was motivated by pedagogical concerns: we wanted to use a "mechanical" (i.e. computerized) tutor for teaching students..
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  40.  16
    Computability Theory.Daniele Mundici & Wilfried Sieg - unknown
    Daniele Mundici and Wilfred Sieg. Computability Theory.
    Translate
      Direct download  
     
    Export citation  
     
    My bibliography  
  41.  15
    Computer Environments for Proof Construction.Richard Scheines & Wilfried Sieg - unknown
    Richard Scheines and Wilfred Sieg. Computer Environments for Proof Construction.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  42.  6
    Normal Natural Deduction Proof (In Non-Classical Logics).Wilfried Sieg & Saverio Cittadini - unknown
    Wilfred Sieg and Saverio Cittadini. Normal Natural Deduction Proof (In Non-Classical Logics.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  43.  4
    Review: Stephen G. Simpson, Friedman's Research on Subsystems of Second Order Arithmetic. [REVIEW]Wilfried Sieg - 1990 - Journal of Symbolic Logic 55 (2):870-874.
  44.  11
    Automated Search for Gödel’s Proofs.Wilfried Sieg & Clinton Field - 2005 - Annals of Pure and Applied Logic 133 (1):319-338.
    Wilfred Sieg and Clinton Field. Automated Search for Gödel's Proofs.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  45.  10
    Generalizing Turing's Machine and Arguments.Wilfried Sieg & John Byrnes - unknown
    Wilfred Sieg and John Byrnes. Generalizing Turing's Machine and Arguments.
    Direct download (2 more)  
     
    Export citation  
     
    My bibliography  
  46.  10
    Gödel, Turing, and K-Graph Machines.Wilfried Sieg & John Byrnes - unknown
  47.  5
    The Hilton New York Hotel New York, NY December 27–29, 2005.Sergei Artemov, Peter Koellner, Michael Rabin, Jeremy Avigad, Wilfried Sieg, William Tait & Haim Gaifman - 2006 - Bulletin of Symbolic Logic 12 (3).
    Direct download  
     
    Export citation  
     
    My bibliography  
  48. Of the Association for Symbolic Logic.S. Lempp, G. Lolli, D. Marker, T. Martin, R. McKenzie, W. Pohlers, W. Sieg, U. de’Liguro, M. Dezani & A. Marcone - 2005 - Bulletin of Symbolic Logic 11 (2).
  49.  2
    Hilbert's Proof Theory.Wilfried Sieg - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 5--321.
    Direct download  
     
    Export citation  
     
    My bibliography  
  50.  2
    H. Rogers, Jr.W. Sieg & J. Byrnes - 1999 - In Edward R. Griffor (ed.), Handbook of Computability Theory. Elsevier. pp. 140--35.
    No categories
    Direct download  
     
    Export citation  
     
    My bibliography  
1 — 50 / 70