Wilfried Sieg

From MaRDI portal
Person:762483

Available identifiers

zbMath Open sieg.wilfriedWikidataQ102323128 ScholiaQ102323128MaRDI QIDQ762483

List of research outcomes





PublicationDate of PublicationType
A new perspective on completeness and finitist consistency2024-11-12Paper
Proofs as Objects2022-12-14Paper
Shortening of Proof Length is Elusive for Theorem Provers2022-07-08Paper
Human-centered automated proof search2022-01-21Paper
NATURAL FORMALIZATION: DERIVING THE CANTOR-BERNSTEIN THEOREM IN ZF2021-07-22Paper
Methodological Frames: Paul Bernays, Mathematical Structuralism, and Proof Theory2021-03-25Paper
The Ways of Hilbert’s Axiomatics: Structural and Formal2021-03-25Paper
Why Post Did [Not] Have Turing’s Thesis2020-08-06Paper
A Brief Note on Gödel, Nagel, Minds, and Machines2020-02-05Paper
The Cantor–Bernstein theorem: how many proofs?2019-12-05Paper
https://portal.mardi4nfdi.de/entity/Q52364172019-10-15Paper
https://portal.mardi4nfdi.de/entity/Q52296712019-08-16Paper
Dedekind's Abstract Concepts: Models and Mappings2019-02-26Paper
What Is the concept of computation?2018-09-06Paper
Conceptual Confluence in 1936: Post and Turing2018-04-18Paper
IN MEMORIAM: SOLOMON FEFERMAN (1928–2016)2018-01-11Paper
Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency2017-10-11Paper
In the Shadow of Incompleteness: Hilbert and Gentzen2015-06-05Paper
The ways of Hilbert's axiomatics: structural and formal2014-07-22Paper
Gödel's philosophical challenge (to Turing)2014-06-24Paper
Hilbert's programs and beyond2013-03-18Paper
Axioms for computability: do they allow a proof of Church's thesis?2013-02-26Paper
Searching for proofs (and uncovering capacities of the mathematical mind)2011-05-31Paper
https://portal.mardi4nfdi.de/entity/Q53928422011-04-14Paper
https://portal.mardi4nfdi.de/entity/Q30796172011-03-02Paper
Automated search for Gödel's proofs2010-01-11Paper
Beyond Hilbert’s Reach?2009-03-12Paper
Church Without Dogma: Axioms for Computability2008-04-29Paper
The AProS Project: Strategic Thinking & Computational Logic2007-11-27Paper
Relative consistency and accessible domains2007-10-24Paper
On mind \& Turing's machines2007-06-14Paper
Logical Approaches to Computational Barriers2007-04-30Paper
Godel on computability2007-02-13Paper
Beyond Hilbert's reach?2006-11-16Paper
https://portal.mardi4nfdi.de/entity/Q54937592006-10-16Paper
Dedekind's analysis of number: Systems and axioms2006-02-08Paper
Only Two Letters: The Correspondence between Herbrand and Gödel2006-02-08Paper
New Computational Paradigms2006-01-11Paper
Mechanizing Mathematical Reasoning2006-01-10Paper
Automated search for Gödel's proofs2005-04-21Paper
https://portal.mardi4nfdi.de/entity/Q44287072003-09-22Paper
https://portal.mardi4nfdi.de/entity/Q47934292003-07-31Paper
https://portal.mardi4nfdi.de/entity/Q47930402003-02-18Paper
https://portal.mardi4nfdi.de/entity/Q45252922001-01-22Paper
Normal natural deduction proofs (in classical logic)2000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q49419892000-03-19Paper
Hilbert's Programs: 1917–19221999-09-12Paper
Step by Recursive Step: Church's Analysis of Effective Calculability1998-03-17Paper
https://portal.mardi4nfdi.de/entity/Q48931381997-02-24Paper
Paper Machines1996-01-02Paper
https://portal.mardi4nfdi.de/entity/Q43246961995-03-02Paper
Effectiveness and provability1995-01-11Paper
Relative consistency and accessible domains1993-02-02Paper
Herbrand analyses1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34721001990-01-01Paper
Hilbert's program sixty years later1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38243121987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37880031987-01-01Paper
Fragments of arithmetic1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37673461985-01-01Paper
Foundations for analysis and proof theory1984-01-01Paper
Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies1981-01-01Paper

Research outcomes over time

This page was built for person: Wilfried Sieg