default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHelmut Schwichtenberg
Person information
- affiliation: Ludwig Maximilian University of Munich, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j24]Nils Köpp, Helmut Schwichtenberg:
Lookahead analysis in exact real arithmetic with logical methods. Theor. Comput. Sci. 943: 171-186 (2023)- 2021
- [j23]Helmut Schwichtenberg, Franziskus Wiesnet:
Logic for exact real arithmetic. Log. Methods Comput. Sci. 17(2) (2021)
2010 – 2019
- 2017
- [j22]Josef Berger, Helmut Schwichtenberg:
A bound for Dickson's lemma. Log. Methods Comput. Sci. 13(3) (2017) - 2016
- [j21]Hannes Leitgeb, Iosif Petrakis, Peter Schuster, Helmut Schwichtenberg:
Editorial. FLAP 3(4): 513-516 (2016) - [j20]Hajime Ishihara, Helmut Schwichtenberg:
Embedding classical in minimal implicational logic. Math. Log. Q. 62(1-2): 94-101 (2016) - 2015
- [j19]Kenji Miyamoto, Helmut Schwichtenberg:
Program extraction in exact real arithmetic. Math. Struct. Comput. Sci. 25(8): 1692-1704 (2015) - 2013
- [j18]Helmut Schwichtenberg, Christoph Senjak:
Minimal from classical proofs. Ann. Pure Appl. Log. 164(6): 740-748 (2013) - [c13]Kenji Miyamoto, Fredrik Nordvall Forsberg
, Helmut Schwichtenberg:
Program Extraction from Nested Definitions. ITP 2013: 370-385 - 2012
- [b3]Helmut Schwichtenberg, Stanley S. Wainer:
Proofs and Computations. Perspectives in logic, Association for Symbolic Logic 2012, ISBN 978-0-521-51769-0, pp. I-XIII, 1-465 - 2011
- [c12]Ulrich Berger, Kenji Miyamoto, Helmut Schwichtenberg, Monika Seisenberger:
Minlog - A Tool for Program Extraction Supporting Algebras and Coalgebras. CALCO 2011: 393-399
2000 – 2009
- 2008
- [j17]Helmut Schwichtenberg:
Dialectica interpretation of well-founded induction. Math. Log. Q. 54(3): 229-239 (2008) - [j16]Helmut Schwichtenberg:
Realizability interpretation of proofs in constructive analysis. Theory Comput. Syst. 43(3-4): 583-602 (2008) - 2006
- [j15]Ulrich Berger, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg:
Program Extraction from Normalization Proofs. Stud Logica 82(1): 25-49 (2006) - [j14]Helmut Schwichtenberg:
An arithmetic for polynomial-time computation. Theor. Comput. Sci. 357(1-3): 202-214 (2006) - [c11]Helmut Schwichtenberg:
Inverting Monotone Continuous Functions in Constructive Analysis. CiE 2006: 490-504 - [p2]Helmut Schwichtenberg:
Minlog. The Seventeen Provers of the World 2006: 151-157 - 2005
- [j13]Helmut Schwichtenberg:
A Direct Proof of the Equivalence between Brouwer's Fan Theorem and König's Lemma with a Uniqueness Hypothesis. J. Univers. Comput. Sci. 11(12): 2086-2095 (2005) - 2004
- [j12]Klaus Aehlig, Ulrich Berger, Martin Hofmann, Helmut Schwichtenberg:
An arithmetic for non-size-increasing polynomial-time computation. Theor. Comput. Sci. 318(1-2): 3-27 (2004) - [c10]Helmut Schwichtenberg:
Proof Search in Minimal Logic. AISC 2004: 15-25 - 2003
- [j11]Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg:
Term rewriting for normalization by evaluation. Inf. Comput. 183(1): 19-42 (2003) - 2002
- [j10]Ulrich Berger, Wilfried Buchholz, Helmut Schwichtenberg:
Refined program extraction form classical proofs. Ann. Pure Appl. Log. 114(1-3): 3-25 (2002) - [j9]Klaus Aehlig, Helmut Schwichtenberg:
A syntactical analysis of non-size-increasing polynomial time computation. ACM Trans. Comput. Log. 3(3): 383-401 (2002) - 2001
- [j8]Ulrich Berger, Helmut Schwichtenberg, Monika Seisenberger:
The Warshall Algorithm and Dickson's Lemma: Two Examples of Realistic Program Extraction. J. Autom. Reason. 26(2): 205-221 (2001) - [c9]Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn:
Linear Ramified Higher Type Recursion and Parallel Complexity. Proof Theory in Computer Science 2001: 1-21 - 2000
- [b2]Anne Sjerp Troelstra, Helmut Schwichtenberg:
Basic proof theory, Second Edition. Cambridge tracts in theoretical computer science 43, Cambridge University Press 2000, ISBN 978-0-521-77911-1, pp. I-XII, 1-417 - [j7]Stephen J. Bellantoni, Karl-Heinz Niggl, Helmut Schwichtenberg:
Higher type recursion, ramification and polynomial time. Ann. Pure Appl. Log. 104(1-3): 17-30 (2000) - [c8]Klaus Aehlig, Helmut Schwichtenberg:
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. LICS 2000: 84-91 - [e1]Peter Clote, Helmut Schwichtenberg:
Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau, Germany, August 21-26, 2000, Proceedings. Lecture Notes in Computer Science 1862, Springer 2000, ISBN 3-540-67895-6 [contents] - [i1]Klaus Aehlig, Helmut Schwichtenberg:
A syntactical analysis of non-size-increasing polynomial time computation. CoRR cs.LO/0011037 (2000)
1990 – 1999
- 1999
- [j6]Helmut Schwichtenberg:
Monotone Majorizable Functionals. Stud Logica 62(2): 283-289 (1999) - [j5]Helmut Schwichtenberg:
Termination of Permutative Conversions in Intuitionistic Gentzen Calculi. Theor. Comput. Sci. 212(1-2): 247-260 (1999) - [p1]Helmut Schwichtenberg:
Classifying Recursive Functions. Handbook of Computability Theory 1999: 533-586 - 1998
- [j4]Helmut Schwichtenberg:
Finite Notations for Infinite Terms. Ann. Pure Appl. Log. 94(1-3): 201-222 (1998) - [c7]Ulrich Berger, Matthias Eberl, Helmut Schwichtenberg:
Normalisation by Evaluation. Prospects for Hardware Foundations 1998: 117-137 - 1996
- [b1]Anne Sjerp Troelstra, Helmut Schwichtenberg:
Basic proof theory. Cambridge tracts in theoretical computer science 43, Cambridge University Press 1996, ISBN 978-0-521-57223-1, pp. I-XI, 1-343 - 1995
- [c6]Jaco van de Pol, Helmut Schwichtenberg:
Strict Functionals for Termination Proofs. TLCA 1995: 350-364 - [c5]Ulrich Berger, Helmut Schwichtenberg:
The Greatest Common Divisor: A Case Study for Program Extraction from Classical Proofs. TYPES 1995: 36-46 - 1994
- [c4]Ulrich Berger, Helmut Schwichtenberg:
Program Extraction from Classical Proofs. LCC 1994: 77-97 - 1991
- [j3]Helmut Schwichtenberg:
An upper bound for reduction sequences in the typed λ-calculus. Arch. Math. Log. 30(5-6): 405-408 (1991) - [c3]Helmut Schwichtenberg:
Minimal from Classical Proofs. CSL 1991: 326-328 - [c2]Ulrich Berger, Helmut Schwichtenberg:
An Inverse of the Evaluation Functional for Typed lambda-calculus. LICS 1991: 203-211
1980 – 1989
- 1987
- [c1]Helmut Schwichtenberg:
Ein einfaches Verfahren zur Normalisierung unendlicher Herleitungen. Computation Theory and Logic 1987: 334-348
1970 – 1979
- 1979
- [j2]Helmut Schwichtenberg:
On Bar Recursion of Types 0 and 1. J. Symb. Log. 44(3): 325-329 (1979) - 1975
- [j1]Helmut Schwichtenberg:
Definierbare Funktionen imλ-Kalkül mit Typen. Arch. Math. Log. 17(3-4): 113-114 (1975)
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-04-24 22:48 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:
