Fragments of arithmetic. - Wilfried Sieg (Ann. Pure Appl. Log., 1985)

Meeting of the Association for Symbolic Logic: Washington, D. C., 1985. - Martin Davis; E. G. K. López-Escobar; Wilfried Sieg (J. Symb. Log., 1986)

Relative Konsistenz. - Wilfried Sieg (Computation Theory and Logic, 1987)

A Symposium on Hilbert's Program. - Wilfrid Hodges; Wilfried Sieg (J. Symb. Log., 1988)

Hilbert's Program Sixty Years Later. - Wilfried Sieg (J. Symb. Log., 1988)

Herbrand analyses. - Wilfried Sieg (Arch. Math. Log., 1991)

Program Transformation and Proof Transformation. - Wilfried Sieg; Stanley S. Wainer (CSL, 1993)

Computer Environments for Proof Construction. - Richard Scheines; Wilfried Sieg (Interact. Learn. Environ., 1994)

Step by recursive step: Church's analysis of effective calculability. - Wilfried Sieg (Bull. Symb. Log., 1997)

Normal Natural Deduction Proofs (in classical logic). - Wilfried Sieg; John Byrnes (Stud Logica, 1998)

Note by the Guest Editors. - Wilfried Sieg; Frank Pfenning (Stud Logica, 1998)

Hilbert's programs: 1917-1922. - Wilfried Sieg (Bull. Symb. Log., 1999)

Normal Natural Deduction Proofs (in Non-classical Logics). - Wilfried Sieg; Saverio Cittadini (Mechanizing Mathematical Reasoning, 2005)

Computability and Discrete Dynamical Systems. - Wilfried Sieg (CiE, 2005)

Automated search for Gödel's proofs. - Wilfried Sieg; Clinton Field (Ann. Pure Appl. Log., 2005)

Only two letters: The correspondence between Herbrand and Gödel. - Wilfried Sieg (Bull. Symb. Log., 2005)

Dedekind's Analysis of Number: Systems and Axioms. - Wilfried Sieg; Dirk Schlimm (Synth., 2005)

Gödel's Conflicting Approaches to Effective Calculability. - Wilfried Sieg (CiE, 2006)

The AProS Project: Strategic Thinking & Computational Logic. - Wilfried Sieg (Log. J. IGPL, 2007)

On mind & Turing's machines. - Wilfried Sieg (Nat. Comput., 2007)

Hilbert's Proof Theory. - Wilfried Sieg (Logic from Russell to Church, 2009)

In the Shadow of Incompleteness: Hilbert and Gentzen. - Wilfried Sieg (Epistemology versus Ontology, 2012)

Step by recursive step: Church's analysis of effective calculability. - Wilfried Sieg (Turing's Legacy, 2014)

Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value. - Santiago Hernández-Orozco; Francisco Hernández Quiroz; Hector Zenil; Wilfried Sieg (CoRR, 2015)

Why Post Did [Not] Have Turing's Thesis. - Wilfried Sieg; Máté Szabó; Dawn McLaughlin (Martin Davis on Computability, Computational Logic, and Mathematical Foundations, 2016)

In Memoriam: Solomon Feferman (1928-2016). - Charles Parsons; Wilfried Sieg (Bull. Symb. Log., 2017)

What Is the Concept of Computation? - Wilfried Sieg (CiE, 2018)

Shortening of Proof Length is Elusive for Theorem Provers. - Santiago Hernández-Orozco; Francisco Hernández Quiroz; Hector Zenil; Wilfried Sieg (Parallel Process. Lett., 2020)

Human-Centered Automated Proof Search. - Wilfried Sieg; Farzaneh Derakhshan (J. Autom. Reason., 2021)

Natural Formalization: Deriving the Cantor-Bernstein Theorem in ZF. - Wilfried Sieg; Patrick Walsh (Rev. Symb. Log., 2021)

A new perspective on completeness and finitist consistency. - Paulo Guilherme Santos; Wilfried Sieg; Reinhard Kahle (J. Log. Comput., 2024)

Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy. - Liesbeth De Mol; Yuri V. Matiyasevich; Eugenio G. Omodeo; Alberto Policriti; Wilfried Sieg; Elaine J. Weyuker (CoRR, 2025)