57 found
Sort by:
Disambiguations:
Wilfried Sieg [51]W. Sieg [4]Wilfrid Sieg [1]Wilfred Sieg [1]
  1. Daniele Mundici & Wilfried Sieg, Mathematics Studies Machines.
    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" (...)
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  2. Wilfried Sieg, Toward Finitist Proof Theory.
    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 (3 more)  
     
    My bibliography  
     
    Export citation  
  3. Wilfried Sieg, Unification For Quantified Formulae.
    — 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.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Wilfried Sieg & Rossella Lupacchini, Computing Machines.
    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..
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  5. Wilfried Sieg & Richard Scheines, Searching for Proofs.
    The Carnegie Mellon Proof Tutor project was motivated by pedagogical concerns: we wanted to use a "mechanical" (i.e. computerized) tutor for teaching students..
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  6. Wilfried Sieg (2014). The Ways of Hilbert's Axiomatics: Structural and Formal. 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 (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Wilfried Sieg (2013). Hilbert's Programs and Beyond. Oup Usa.
    David Hilbert was one of the great mathematicians who expounded the centrality of their subject in human thought. In this collection of essays, Wilfried Sieg frames Hilbert's foundational work, from 1890 to 1939, in a comprehensive way and integrates it with modern proof theoretic investigations.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  8. Wilfried Sieg (2009). Hilbert's Proof Theory. In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. 5--321.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  9. Sergei Artemov, Peter Koellner, Michael Rabin, Jeremy Avigad, Wilfried Sieg, William Tait & Haim Gaifman (2006). Of the Association for Symbolic Logic. Bulletin of Symbolic Logic 12 (3-4):503.
    Direct download  
     
    My bibliography  
     
    Export citation  
  10. Sergei Artemov, Peter Koellner, Michael Rabin, Jeremy Avigad, Wilfried Sieg, William Tait & Haim Gaifman (2006). The Hilton New York Hotel New York, NY December 27–29, 2005. Bulletin of Symbolic Logic 12 (3).
    Direct download  
     
    My bibliography  
     
    Export citation  
  11. W. Sieg (2006). Godel on Computability. 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 (7 more)  
     
    My bibliography  
     
    Export citation  
  12. S. Lempp, G. Lolli, D. Marker, T. Martin, R. McKenzie, W. Pohlers, W. Sieg, U. de’Liguro, M. Dezani & A. Marcone (2005). Of the Association for Symbolic Logic. Bulletin of Symbolic Logic 11 (2).
    Direct download  
     
    My bibliography  
     
    Export citation  
  13. W. Sieg, R. Sommer, C. Talcott & David Charles McCarty (2005). REVIEWS-Reflections on the Foundations of Mathematics: Essays in Honor of Solomon Feferman. Bulletin of Symbolic Logic 11 (2):239-240.
    No categories
     
    My bibliography  
     
    Export citation  
  14. Wilfried Sieg, Church Without Dogma: Axioms for Computability.
    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)  
     
    My bibliography  
     
    Export citation  
  15. Wilfried Sieg (2005). Only Two Letters: The Correspondence Between Herbrand and Gödel. 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 (12 more)  
     
    My bibliography  
     
    Export citation  
  16. Wilfried Sieg & Rosella Lupiccini, Computing Machines: Entry for the Second Edition of the Encyclopedia of Philsophy.
    Wilfred Sieg and Rosella Lupiccini. Computing Machines: Entry for the Second Edition of the Encyclopedia of Philsophy.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  17. Wilfried Sieg & Dirk Schlimm (2005). Dedekind's Analysis of Number: Systems and Axioms. Synthese 147 (1):121 - 170.
    Wilfred Sieg and Dirk Schlimm. Dedekind's Analysis of Number: Systems and Axioms.
    No categories
    Direct download (11 more)  
     
    My bibliography  
     
    Export citation  
  18. Wilfried Sieg & Mark Ravaglia, David Hilbert and Paul Bernays, Grundlagen der Mathematik I and II: A Landmark.
    Wilfred Sieg and Mark Ravaglia. David Hilbert and Paul Bernays, Grundlagen der Mathematik I and II: A Landmark.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  19. Wilfried Sieg & Clinton Field, Automated Search for Gödel's Proofs.
    Wilfred Sieg and Clinton Field. Automated Search for Gödel's Proofs.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  20. Wilfried Sieg & Saverio Cittadini, Normal Natural Deduction Proof (In Non-Classical Logics).
    Wilfred Sieg and Saverio Cittadini. Normal Natural Deduction Proof (In Non-Classical Logics.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  21. Wilfried Sieg, Four Introductory Notes.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  22. Wilfried Sieg, Calculations by Man and Machine: Conceptual Analysis.
    Wilfried Sieg. Calculations by Man and Machine: Conceptual Analysis.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Wilfried Sieg, Calculations by Man and Machine: Mathematical Presentation.
    Wilfried Sieg. Calculations by Man and Machine: Mathematical Presentation.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. W. Sieg & J. Byrnes (1999). H. Rogers, Jr. In Edward R. Griffor (ed.), Handbook of Computability Theory. Elsevier. 140--35.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  25. Wilfried Sieg (1999). Hilbert's Programs: 1917-1922. 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 (7 more)  
     
    My bibliography  
     
    Export citation  
  26. Wilfried Sieg & John Byrnes, An Abstract Model for Parallel Computation: Gandy's Thesis.
    Wilfried Sieg and John Byrnes. AnModel for Parallel Computation: Gandy's Thesis.
    No categories
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  27. Wilfried Sieg & John Byrnes (1998). Normal Natural Deduction Proofs (in Classical Logic). 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)  
     
    My bibliography  
     
    Export citation  
  28. Wilfried Sieg & Frank Pfenning (1998). Note by the Guest Editors. Studia Logica 60 (1):1-1.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  29. Wilfried Sieg, Formal Systems, Church Turing Thesis, and Gödel's Theorems: Three Contributions to The MIT Encyclopedias of Cognitive Science.
    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)  
     
    My bibliography  
     
    Export citation  
  30. Wilfried Sieg (1997). Step by Recursive Step: Church's Analysis of Effective Calculability. 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 (7 more)  
     
    My bibliography  
     
    Export citation  
  31. Wilfried Sieg & John Byrnes, Gödel, Turing, and K-Graph Machines.
    Wilfried Sieg and John Byrnes. Gödel, Turing, and K-Graph Machines.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  32. John Byrnes & Wilfried Sieg (1996). A Graphical Presentation of Gandy's Parallel Machines'. Bulletin of Symbolic Logic 2:452-3.
     
    My bibliography  
     
    Export citation  
  33. Stephen Menn, G. E. Reyes, Teddy Seidenfeld & Wilfrid Sieg (1996). Frege Versus Cantor and Dedekind: On the Concept of Number WW Tait. In Matthias Schirn (ed.), Frege: Importance and Legacy. Walter de Gruyter. 70.
    No categories
     
    My bibliography  
     
    Export citation  
  34. Wilfried Sieg, Proof Theory.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  35. Wilfried Sieg & John Byrnes, K-Graph Machines: Generalizing Turing's Machines and Arguments.
    Wilfred Sieg and John Byrnes. K-Graph Machines: Generalizing Turing's Machines and Arguments.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  36. Daniele Mundici & Wilfried Sieg, Computability Theory.
    Daniele Mundici and Wilfred Sieg. Computability Theory.
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  37. Richard Scheines & Wilfried Sieg, Computer Environments for Proof Construction.
    Richard Scheines and Wilfred Sieg. Computer Environments for Proof Construction.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  38. Wilfried Sieg, Intercalculation Calculi for Classical Logic.
    Wilfred Sieg. Intercalculation Calculi for Classical Logic.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  39. Wilfried Sieg (1994). Mechanical Procedures and Mathematical Experience. In Alexander George (ed.), Mathematics and Mind. Oxford University Press. 71--117.
    Wilfred Sieg. Mechanical Procedures and Mathematical Experience.
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  40. Wilfried Sieg & John Byrnes, Generalizing Turing's Machine and Arguments.
    Wilfred Sieg and John Byrnes. Generalizing Turing's Machine and Arguments.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  41. Wilfried Sieg & Stanley S. Wainer, Program Transformation and Proof Transformation.
    Wilfred Sieg and Stanley S. Wainer. Program Transformation and Proof Transformation.
    No categories
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  42. Richard Scheines & Wilfried Sieg, An Experimental Comparison of Alternative Proof Construction Environments.
    : "In this paper we compare computerized environments in which students complete proof construction exercises in formal logic. Afterbeing given a pretest for logical aptitude, three matched groups were presented identical course material on logic for approximately five weeks by a computer. During the treatment, all students were required to complete several hundred proof construction exercises. The three groups did the exercises and the midterm in different environments. The group with a more sophisticated interface performed better on the midterm. Nearly (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  43. Wilfried Sieg, Aspects of Mathematical Experience.
    Wilfred Sieg. Aspects of Mathematical Experience.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  44. Wilfried Sieg, Church's Thesis, "Consistency", "Formalization", "Proof Theory" : Dictionary Entries.
    Wilfred Sieg. “Church's Thesis”, “Consistency”, “Formalization”, “Proof Theory”: Dictionary Entries.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  45. Wilfried Sieg, Effectiveness and Provability.
    Wilfred Sieg. Effectiveness and Provability.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  46. Wilfried Sieg, Mechanisms and Search: Aspects of Proof Theory.
    Wilfred Sieg. Mechanisms and Search: Aspects of Proof Theory.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  47. Wilfried Sieg (1991). Herbrand Analyses. 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 (...)
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  48. Wilfried Sieg (1990). Relative Consistency and Accessible Domains. Synthese 84 (2):259 - 297.
    Wilfred Sieg. Relative Consistency and Accesible Domains.
    No categories
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  49. Wilfried Sieg (1990). Review: Rick L. Smith, The Consistency Strengths of Some Finite Forms of the Higman and Kruskal Theorems. [REVIEW] Journal of Symbolic Logic 55 (2):869-870.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  50. Wilfried Sieg (1990). Review: Stephen G. Simpson, Friedman's Research on Subsystems of Second Order Arithmetic. [REVIEW] Journal of Symbolic Logic 55 (2):870-874.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 57