Wilfried Sieg

According to our database, Wilfried Sieg authored at least 31 papers between 1985 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

A new perspective on completeness and finitist consistency.

Paulo Guilherme Santos, Wilfried Sieg, Reinhard Kahle

J. Log. Comput., 2024

2021

Natural Formalization: Deriving the Cantor-Bernstein Theorem in ZF.

Wilfried Sieg, Patrick Walsh

Rev. Symb. Log., 2021

Human-Centered Automated Proof Search.

Wilfried Sieg, Farzaneh Derakhshan

J. Autom. Reason., 2021

2020

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

2018

What Is the Concept of Computation?

Wilfried Sieg

Proceedings of the Sailing Routes in the World of Computation, 2018

2017

In Memoriam: Solomon Feferman (1928-2016).

Charles Parsons, Wilfried Sieg

Bull. Symb. Log., 2017

2016

Why Post Did [Not] Have Turing's Thesis.

Wilfried Sieg, Máté Szabó, Dawn McLaughlin

Proceedings of the Martin Davis on Computability, 2016

2015

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

2014

Step by recursive step: Church's analysis of effective calculability.

Wilfried Sieg

Proceedings of the Turing's Legacy: Developments from Turing's Ideas in Logic, 2014

2012

In the Shadow of Incompleteness: Hilbert and Gentzen.

Wilfried Sieg

Proceedings of the Epistemology versus Ontology, 2012

2009

Hilbert's Proof Theory.

Wilfried Sieg

Proceedings of the Logic from Russell to Church, 2009

2007

On mind & Turing's machines.

Wilfried Sieg

Nat. Comput., 2007

The AProS Project: Strategic Thinking & Computational Logic.

Wilfried Sieg

Log. J. IGPL, 2007

2006

Gödel's Conflicting Approaches to Effective Calculability.

Wilfried Sieg

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Dedekind's Analysis of Number: Systems and Axioms.

Wilfried Sieg, Dirk Schlimm

Synth., 2005

Only two letters: The correspondence between Herbrand and Gödel.

Wilfried Sieg

Bull. Symb. Log., 2005

Automated search for Gödel's proofs.

Wilfried Sieg, Clinton Field

Ann. Pure Appl. Log., 2005

Computability and Discrete Dynamical Systems.

Wilfried Sieg

Proceedings of the New Computational Paradigms, 2005

Normal Natural Deduction Proofs (in Non-classical Logics).

Wilfried Sieg, Saverio Cittadini

Proceedings of the Mechanizing Mathematical Reasoning, 2005

1999

Hilbert's programs: 1917-1922.

Wilfried Sieg

Bull. Symb. Log., 1999

1998

Note by the Guest Editors.

Wilfried Sieg, Frank Pfenning

Stud Logica, 1998

Normal Natural Deduction Proofs (in classical logic).

Wilfried Sieg, John Byrnes

Stud Logica, 1998

1997

Step by recursive step: Church's analysis of effective calculability.

Wilfried Sieg

Bull. Symb. Log., 1997

1994

Computer Environments for Proof Construction.

Richard Scheines, Wilfried Sieg

Interact. Learn. Environ., 1994

1993

Program Transformation and Proof Transformation.

Wilfried Sieg, Stanley S. Wainer

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1991

Herbrand analyses.

Wilfried Sieg

Arch. Math. Log., 1991

1988

Hilbert's Program Sixty Years Later.

Wilfried Sieg

J. Symb. Log., 1988

A Symposium on Hilbert's Program.

Wilfrid Hodges, Wilfried Sieg

J. Symb. Log., 1988

1987

Relative Konsistenz.

Wilfried Sieg

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986

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

1985

Fragments of arithmetic.

Wilfried Sieg

Ann. Pure Appl. Log., 1985