Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilfried Sieg
Person information
- affiliation: Carnegie Mellon University, Department of Philosophy, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j19]Wilfried Sieg
, Farzaneh Derakhshan:
Human-Centered Automated Proof Search. J. Autom. Reason. 65(8): 1153-1190 (2021)- [j18]Wilfried Sieg, Patrick Walsh:
Natural Formalization: Deriving the Cantor-Bernstein Theorem in ZF. Rev. Symb. Log. 14(1): 250-284 (2021) - 2020
- [j17]Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil, Wilfried Sieg:
Shortening of Proof Length is Elusive for Theorem Provers. Parallel Process. Lett. 30(4): 2050013:1-2050013:14 (2020) - 2017
- [j16]Charles Parsons, Wilfried Sieg:
In Memoriam: Solomon Feferman (1928-2016). Bull. Symb. Log. 23(3): 337-344 (2017) - 2007
- [j15]Wilfried Sieg:
The AProS Project: Strategic Thinking & Computational Logic. Log. J. IGPL 15(4): 359-368 (2007) - [j14]Wilfried Sieg:
On mind & Turing's machines. Nat. Comput. 6(2): 187-205 (2007) - 2005
- [j13]Wilfried Sieg, Clinton Field:
Automated search for Gödel's proofs. Ann. Pure Appl. Log. 133(1-3): 319-338 (2005) - [j12]Wilfried Sieg:
Only two letters: The correspondence between Herbrand and Gödel. Bull. Symb. Log. 11(2): 172-184 (2005) - [j11]Wilfried Sieg, Dirk Schlimm:
Dedekind's Analysis of Number: Systems and Axioms. Synth. 147(1): 121-170 (2005) - 1999
- [j10]Wilfried Sieg:
Hilbert's programs: 1917-1922. Bull. Symb. Log. 5(1): 1-44 (1999) - 1998
- [j9]Wilfried Sieg, Frank Pfenning:
Note by the Guest Editors. Stud Logica 60(1): 1 (1998) - [j8]Wilfried Sieg, John Byrnes:
Normal Natural Deduction Proofs (in classical logic). Stud Logica 60(1): 67-106 (1998) - 1997
- [j7]Wilfried Sieg:
Step by recursive step: Church's analysis of effective calculability. Bull. Symb. Log. 3(2): 154-180 (1997) - 1994
- [j6]Richard Scheines, Wilfried Sieg:
Computer Environments for Proof Construction. Interact. Learn. Environ. 4(2): 159-169 (1994) - 1991
- [j5]Wilfried Sieg:
Herbrand analyses. Arch. Math. Log. 30(5-6): 409-441 (1991) - 1988
- [j4]Wilfrid Hodges, Wilfried Sieg:
A Symposium on Hilbert's Program. J. Symb. Log. 53(2): 337 (1988) - [j3]Wilfried Sieg:
Hilbert's Program Sixty Years Later. J. Symb. Log. 53(2): 338-348 (1988) - 1986
- [j2]Martin Davis, E. G. K. López-Escobar, Wilfried Sieg:
Meeting of the Association for Symbolic Logic: Washington, D. C., 1985. J. Symb. Log. 51(4): 1085-1092 (1986) - 1985
- [j1]Wilfried Sieg:
Fragments of arithmetic. Ann. Pure Appl. Log. 28(1): 33-71 (1985)
Conference and Workshop Papers
- 2018
- [c6]Wilfried Sieg:
What Is the Concept of Computation? CiE 2018: 386-396 - 2006
- [c5]Wilfried Sieg:
Gödel's Conflicting Approaches to Effective Calculability. CiE 2006: 536-537 - 2005
- [c4]Wilfried Sieg, Saverio Cittadini:
Normal Natural Deduction Proofs (in Non-classical Logics). Mechanizing Mathematical Reasoning 2005: 169-191 - [c3]Wilfried Sieg:
Computability and Discrete Dynamical Systems. CiE 2005: 440-440 - 1993
- [c2]Wilfried Sieg, Stanley S. Wainer:
Program Transformation and Proof Transformation. CSL 1993: 305-317 - 1987
- [c1]Wilfried Sieg:
Relative Konsistenz. Computation Theory and Logic 1987: 360-381
Parts in Books or Collections
- 2016
- [p3]Wilfried Sieg, Máté Szabó, Dawn McLaughlin:
Why Post Did [Not] Have Turing's Thesis. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 175-208 - 2014
- [p2]Wilfried Sieg:
Step by recursive step: Church's analysis of effective calculability. Turing's Legacy 2014: 434-466 - 2012
- [p1]Wilfried Sieg:
In the Shadow of Incompleteness: Hilbert and Gentzen. Epistemology versus Ontology 2012: 87-127
Reference Works
- 2009
- [r1]Wilfried Sieg:
Hilbert's Proof Theory. Logic from Russell to Church 2009: 321-384
Informal and Other Publications
- 2015
- [i1]Santiago Hernández-Orozco, Francisco Hernández Quiroz, Hector Zenil, Wilfried Sieg:
Rare Speed-up in Automatic Theorem Proving Reveals Tradeoff Between Computational Time and Information Value. CoRR abs/1506.04349 (2015)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-09 05:16 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
