Wilfried Sieg

32 papers B 1C 3Journal 22Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy.
CoRR
Liesbeth De Mol, Yuri V. Matiyasevich, Eugenio G. Omodeo, Alberto Policriti, Wilfried Sieg, Elaine J. Weyuker
2024 J jnl
A new perspective on completeness and finitist consistency.
J. Log. Comput.
Paulo Guilherme Santos, Wilfried Sieg, Reinhard Kahle
2021 J jnl
Human-Centered Automated Proof Search.
J. Autom. Reason.
Wilfried Sieg, Farzaneh Derakhshan
2021 J jnl
Natural Formalization: Deriving the Cantor-Bernstein Theorem in ZF.
Rev. Symb. Log.
Wilfried Sieg, Patrick Walsh
2020 J jnl
Shortening of Proof Length is Elusive for Theorem Provers.
Parallel Process. Lett.
Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil, Wilfried Sieg
2018 C conf
What Is the Concept of Computation?
CiE
Wilfried Sieg
2017 J jnl
In Memoriam: Solomon Feferman (1928-2016).
Bull. Symb. Log.
Charles Parsons, Wilfried Sieg
2016 — ch.
Why Post Did [Not] Have Turing's Thesis.
Martin Davis on Computability, Computational Logic, and Mathematical Foundations
Wilfried Sieg, Máté Szabó, Dawn McLaughlin
2015 J jnl
Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value.
CoRR
Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil, Wilfried Sieg
2014 — ch.
Step by recursive step: Church's analysis of effective calculability.
Turing's Legacy
Wilfried Sieg
2012 — ch.
In the Shadow of Incompleteness: Hilbert and Gentzen.
Epistemology versus Ontology
Wilfried Sieg
2009 — ch.
Hilbert's Proof Theory.
Logic from Russell to Church
Wilfried Sieg
2007 J jnl
On mind & Turing's machines.
Nat. Comput.
Wilfried Sieg
2007 J jnl
The AProS Project: Strategic Thinking & Computational Logic.
Log. J. IGPL
Wilfried Sieg
2006 C conf
Gödel's Conflicting Approaches to Effective Calculability.
CiE
Wilfried Sieg
2005 J jnl
Automated search for Gödel's proofs.
Ann. Pure Appl. Log.
Wilfried Sieg, Clinton Field
2005 C conf
Computability and Discrete Dynamical Systems.
CiE
Wilfried Sieg
2005 J jnl
Dedekind's Analysis of Number: Systems and Axioms.
Synth.
Wilfried Sieg, Dirk Schlimm
2005 — conf
Normal Natural Deduction Proofs (in Non-classical Logics).
Mechanizing Mathematical Reasoning
Wilfried Sieg, Saverio Cittadini
2005 J jnl
Only two letters: The correspondence between Herbrand and Gödel.
Bull. Symb. Log.
Wilfried Sieg
1999 J jnl
Hilbert's programs: 1917-1922.
Bull. Symb. Log.
Wilfried Sieg
1998 J jnl
Normal Natural Deduction Proofs (in classical logic).
Stud Logica
Wilfried Sieg, John Byrnes
1998 J jnl
Note by the Guest Editors.
Stud Logica
Wilfried Sieg, Frank Pfenning
1997 J jnl
Step by recursive step: Church's analysis of effective calculability.
Bull. Symb. Log.
Wilfried Sieg
1994 J jnl
Computer Environments for Proof Construction.
Interact. Learn. Environ.
Richard Scheines, Wilfried Sieg
1993 B conf
Program Transformation and Proof Transformation.
CSL
Wilfried Sieg, Stanley S. Wainer
1991 J jnl
Herbrand analyses.
Arch. Math. Log.
Wilfried Sieg
1988 J jnl
A Symposium on Hilbert's Program.
J. Symb. Log.
Wilfrid Hodges, Wilfried Sieg
1988 J jnl
Hilbert's Program Sixty Years Later.
J. Symb. Log.
Wilfried Sieg
1987 — conf
Relative Konsistenz.
Computation Theory and Logic
Wilfried Sieg
1986 J jnl
Meeting of the Association for Symbolic Logic: Washington, D. C., 1985.
J. Symb. Log.
Martin Davis, E. G. K. López-Escobar, Wilfried Sieg
1985 J jnl
Fragments of arithmetic.
Ann. Pure Appl. Log.
Wilfried Sieg