Wilfried Sieg - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 28 from 28

2021

Human-Centered Automated Proof SearchWilfried Sieg, Farzaneh Derakhshan. JAR, 65(8):1153-1190, 2021. [doi]

Natural Formalization: Deriving the Cantor-Bernstein Theorem in ZFWilfried Sieg, Patrick Walsh. rsl, 14(1):250-284, 2021. [doi]

2020

Shortening of Proof Length is Elusive for Theorem ProversSantiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil, Wilfried Sieg. ppl, 30(4), 2020. [doi]

2018

What Is the Concept of Computation?Wilfried Sieg. CiE 2018: 386-396 [doi]

2017

In Memoriam: Solomon Feferman (1928-2016)Charles Parsons, Wilfried Sieg. bsl, 23(3):337-344, 2017. [doi]

2016

Why Post Did [Not] Have Turing's ThesisWilfried Sieg, Máté Szabó, Dawn McLaughlin. In Eugenio G. Omodeo, Alberto Policriti, editors, Martin Davis on Computability, Computational Logic, and Mathematical Foundations. Volume 10 of Outstanding Contributions to Logic, pages 175-208, Springer, 2016. [doi]

2014

Step by recursive step: Church's analysis of effective calculabilityWilfried Sieg. In Rod Downey, editor, Turing's Legacy: Developments from Turing's Ideas in Logic. Volume 42 of Lecture Notes in Logic, pages 434-466, Cambridge University Press, 2014. [doi]

2012

In the Shadow of Incompleteness: Hilbert and GentzenWilfried Sieg. In Peter Dybjer, Sten Lindström, Erik Palmgren, Göran Sundholm, editors, Epistemology versus Ontology - Essays on the Philosophy and Foundations of Mathematics in Honour of Per Martin-Löf. Volume 27 of Logic, Epistemology, and the Unity of Science, pages 87-127, Springer, 2012. [doi]

2009

Hilbert's Proof TheoryWilfried Sieg. In Dov M. Gabbay, John Woods, editors, Logic from Russell to Church. Volume 5 of Handbook of the History of Logic, pages 321-384, Elsevier, 2009. [doi]

2007

On mind & Turing s machinesWilfried Sieg. nc, 6(2):187-205, 2007. [doi]

The AProS Project: Strategic Thinking & Computational LogicWilfried Sieg. igpl, 15(4):359-368, 2007. [doi]

2006

Gödel s Conflicting Approaches to Effective CalculabilityWilfried Sieg. cie 2006: 536-537 [doi]

2005

Normal Natural Deduction Proofs (in Non-classical Logics)Wilfried Sieg, Saverio Cittadini. BIRTHDAY 2005: 169-191 [doi]

Computability and Discrete Dynamical SystemsWilfried Sieg. cie 2005: 440-440 [doi]

Only two letters: The correspondence between Herbrand and GödelWilfried Sieg. bsl, 11(2):172-184, 2005. [doi]

Automated search for Gödel s proofsWilfried Sieg, Clinton Field. APAL, 133(1-3):319-338, 2005. [doi]

Dedekind's Analysis of Number: Systems and AxiomsWilfried Sieg, Dirk Schlimm. synthese, 147(1):121-170, 2005. [doi]

1999

Hilbert s programs: 1917--1922Wilfried Sieg. bsl, 5(1):1-44, 1999. [doi]

1998

Normal Natural Deduction Proofs (in classical logic)Wilfried Sieg, John Byrnes. sLogica, 60(1):67-106, 1998.

Note by the Guest EditorsWilfried Sieg, Frank Pfenning. sLogica, 60(1):1, 1998.

1997

Step by recursive step: Church s analysis of effective calculabilityWilfried Sieg. bsl, 3(2):154-180, 1997. [doi]

1994

Computer Environments for Proof ConstructionRichard Scheines, Wilfried Sieg. ile, 4(2):159-169, 1994. [doi]

1993

Program Transformation and Proof TransformationWilfried Sieg, Stanley S. Wainer. csl 1994: 305-317

1991

Herbrand analysesWilfried Sieg. AML, 30(5-6):409-441, 1991. [doi]

1988

A Symposium on Hilbert s ProgramWilfrid Hodges, Wilfried Sieg. JSYML, 53(2):337, 1988.

Hilbert s Program Sixty Years LaterWilfried Sieg. JSYML, 53(2):338-348, 1988.

1987

Relative KonsistenzWilfried Sieg. BIRTHDAY 1987: 360-381

1985

Fragments of arithmeticWilfried Sieg. APAL, 28(1):33-71, 1985. [doi]

Sign in or sign up to see more results.

runs on WebDSL