Helmut Schwichtenberg

From MaRDI portal
Person:234585

Available identifiers

zbMath Open schwichtenberg.helmutWikidataQ1291944 ScholiaQ1291944MaRDI QIDQ234585

List of research outcomes

PublicationDate of PublicationType
Program extraction from classical proofs2023-12-12Paper
Computational Aspects of Bishop’s Constructive Mathematics2023-08-11Paper
Logic for Exact Real Arithmetic: Multiplication2023-08-04Paper
Lookahead analysis in exact real arithmetic with logical methods2023-01-05Paper
Mathematische Logik2021-12-03Paper
https://portal.mardi4nfdi.de/entity/Q49894022021-05-25Paper
Program Extraction from Proofs: The Fan Theorem for Uniformly Coconvex Bars2020-08-10Paper
Higman’s Lemma and Its Computational Content2020-08-07Paper
Logic for Gray-code Computation2020-04-03Paper
Tiered Arithmetics2020-02-05Paper
Logic for exact real arithmetic2019-04-29Paper
The greatest common divisor: A case study for program extraction from classical proofs2019-01-15Paper
A bound for Dickson's lemma2017-10-12Paper
A syntactical analysis of non-size-increasing polynomial time computation2017-06-13Paper
Program extraction in exact real arithmetic2016-07-27Paper
Embedding classical in minimal implicational logic2016-03-17Paper
Viewing \({\lambda}\)-terms through maps2014-09-03Paper
Program Extraction from Nested Definitions2013-08-07Paper
Minimal from classical proofs2013-04-15Paper
Constructive aspects of Riemann's permutation theorem for series2013-03-28Paper
Proofs and Computations2012-01-27Paper
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras2011-09-02Paper
https://portal.mardi4nfdi.de/entity/Q30011032011-05-31Paper
https://portal.mardi4nfdi.de/entity/Q30816442011-03-09Paper
Realizability interpretation of proofs in constructive analysis2009-05-08Paper
Program Extraction in Constructive Analysis2009-03-12Paper
Dialectica interpretation of well-founded induction2008-06-12Paper
https://portal.mardi4nfdi.de/entity/Q53849802008-04-29Paper
https://portal.mardi4nfdi.de/entity/Q54573882008-04-14Paper
https://portal.mardi4nfdi.de/entity/Q54356372008-01-14Paper
https://portal.mardi4nfdi.de/entity/Q53108912007-10-15Paper
Logical Approaches to Computational Barriers2007-04-30Paper
An arithmetic for polynomial-time computation2006-08-16Paper
Program extraction from normalization proofs2006-03-17Paper
Artificial Intelligence and Symbolic Computation2005-08-19Paper
https://portal.mardi4nfdi.de/entity/Q30248482005-07-04Paper
https://portal.mardi4nfdi.de/entity/Q46638392005-04-04Paper
https://portal.mardi4nfdi.de/entity/Q48231432004-10-26Paper
An arithmetic for non-size-increasing polynomial-time computation2004-08-06Paper
https://portal.mardi4nfdi.de/entity/Q44360232003-11-23Paper
Term rewriting for normalization by evaluation.2003-08-19Paper
https://portal.mardi4nfdi.de/entity/Q45247662003-07-29Paper
Refined program extraction from classical proofs2002-09-16Paper
https://portal.mardi4nfdi.de/entity/Q49342912002-01-31Paper
https://portal.mardi4nfdi.de/entity/Q27520522001-10-21Paper
The Warshall algorithm and Dickson's lemma: Two examples of realistic program extraction2001-02-18Paper
Higher type recursion, ramification and polynomial time2000-09-04Paper
https://portal.mardi4nfdi.de/entity/Q44990842000-08-28Paper
Finite notations for infinite terms2000-05-09Paper
Monotone majorizable functionals1999-10-28Paper
https://portal.mardi4nfdi.de/entity/Q42638341999-09-22Paper
Termination of permutative conversions in intuitionistic Gentzen calculi1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q43970331998-06-25Paper
https://portal.mardi4nfdi.de/entity/Q43956181998-06-11Paper
https://portal.mardi4nfdi.de/entity/Q43570671997-10-07Paper
https://portal.mardi4nfdi.de/entity/Q48505551997-06-15Paper
https://portal.mardi4nfdi.de/entity/Q47162711996-11-25Paper
https://portal.mardi4nfdi.de/entity/Q48425321995-09-26Paper
https://portal.mardi4nfdi.de/entity/Q43095061995-01-05Paper
https://portal.mardi4nfdi.de/entity/Q31388281993-11-11Paper
https://portal.mardi4nfdi.de/entity/Q42029541993-09-06Paper
An upper bound for reduction sequences in the typed \(\lambda\)-calculus1991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38015451987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33220971983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33220861982-01-01Paper
On bar recursion of types 0 and 11979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38741691979-01-01Paper
Definierbare Funktionen imλ-Kalkül mit Typen1976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40796011975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41083111975-01-01Paper
Bemerkungen zum Spektralproblem1972-01-01Paper
Beweistheoretische Charakterisierung einer Erweiterung der Grzegorczyk-Hierarchie1972-01-01Paper
Eine Klassifikation der ε0‐Rekursiven Funktionen1971-01-01Paper
Rekursionszahlen und die Grzegorczyk-Hierarchie1969-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Helmut Schwichtenberg