default search action
Reinhard Kahle
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j24]Matthias Baaz, Marcel Ertel, Reinhard Kahle, Thomas Piecha, Jan von Plato:
90 years of Gödel's incompleteness theorems: Logic and computation. J. Log. Comput. 34(6): 1003-1009 (2024) - [j23]Paulo Guilherme Santos, Wilfried Sieg, Reinhard Kahle:
A new perspective on completeness and finitist consistency. J. Log. Comput. 34(6): 1179-1198 (2024) - 2023
- [c12]Reinhard Kahle
:
Zukunft der KI: Verantwortung und Vertrauen. GI-Jahrestagung 2023: 749-755 - 2022
- [j22]Ugo Dal Lago, Reinhard Kahle
Implicit recursion-theoretic characterizations of counting classes. Arch. Math. Log. 61(7-8): 1129-1144 (2022) - [c11]Anna Hoffmann, Reinhard Kahle
Geodaten als Open Data für die Künstliche Intelligenz. GI-Jahrestagung 2022: 1081-1082 - 2021
- [j21]Paulo Guilherme Santos
Variants of Kreisel's Conjecture on a New Notion of Provability. Bull. Symb. Log. 27(4): 337-350 (2021) - [j20]Paulo Guilherme Santos
k-Provability in $\hbox {PA}$. Logica Universalis 15(4): 477-516 (2021) - [c10]Ugo Dal Lago, Reinhard Kahle
A Recursion-Theoretic Characterization of the Probabilistic Class PP. MFCS 2021: 35:1-35:12 - 2020
- [c9]Reinhard Kahle
Konzeptionelle Herausforderungen für die KI. GI-Jahrestagung 2020: 693-694 - [c8]Reinhard Kahle
Primzahlen als Herausforderung. GI-Jahrestagung 2020: 719-727 - [c7]Reinhard Kahle
The Intensional Structure of Epistemic Convictions. SEFM 2020: 192-200
2010 – 2019
- 2019
- [j19]Reinhard Kahle
Is There a "Hilbert Thesis"? Stud Logica 107(1): 145-165 (2019) - 2017
- [j18]Reinhard Kahle:
The logical Cone. FLAP 4(4) (2017) - 2016
- [j17]Guillaume Bonfante, Reinhard Kahle
Two function algebras defining functions in NCk boolean circuits. Inf. Comput. 248: 82-103 (2016) - [p2]Reinhard Kahle:
Towards a Proof-Theoretic Semantics of Equalities. Advances in Proof-Theoretic Semantics 2016: 153-160 - 2015
- [i1]Reinhard Kahle, Wilfried Keller:
Syntax versus Semantics. CoRR abs/1507.04678 (2015) - 2014
- [c6]Reinhard Kahle:
Towards the Structure of Mathematical Proof. CICM Workshops 2014 - 2013
- [j16]Reinhard Kahle
Applicative theories for the polynomial hierarchy of time and its levels. Ann. Pure Appl. Log. 164(6): 663-675 (2013) - 2012
- [p1]Reinhard Kahle
Modalities Without Worlds. The Realism-Antirealism Debate in the Age of Alternative Logics 2012: 101-118 - 2011
- [j15]Reinhard Kahle
The Universal Set and Diagonalization in Frege Structures. Rev. Symb. Log. 4(2): 205-218 (2011) - 2010
- [c5]Reinhard Kahle
An applicative theory for FPH. CL&C 2010: 44-56
2000 – 2009
- 2009
- [e2]Erich Grädel, Reinhard Kahle
Computer Science Logic, 23rd international Workshop, CSL 2009, 18th Annual Conference of the EACSL, Coimbra, Portugal, September 7-11, 2009. Proceedings. Lecture Notes in Computer Science 5771, Springer 2009, ISBN 978-3-642-04026-9 [contents] - 2008
- [c4]Guillaume Bonfante, Reinhard Kahle
Recursion Schemata for NCk. CSL 2008: 49-63 - 2007
- [j14]Reinhard Kahle
Edwin D. Mares, Relevant Logic - A Philosophical Interpretation. Stud Logica 85(3): 419-424 (2007) - [j13]Reinhard Kahle
Freek Wiedijk (Ed.), The Seventeen Provers of the World. Stud Logica 87(2-3): 369-374 (2007) - 2006
- [j12]Reinhard Kahle
Introduction: Proof-theoretic Semantics. Synth. 148(3): 503-506 (2006) - [j11]Reinhard Kahle
A Proof-theoretic View of Necessity. Synth. 148(3): 659-673 (2006) - [c3]Guillaume Bonfante, Reinhard Kahle, Jean-Yves Marion, Isabel Oitavem
Towards an Implicit Characterization of NCk. CSL 2006: 212-224 - 2005
- [j10]Wilfried Buchholz, Reinhard Kahle
Preface. Ann. Pure Appl. Log. 133(1-3): 1- (2005) - [j9]Bernd Buldt, Volker Halbach, Reinhard Kahle
Reflections On Frege And Hilbert. Synth. 147(1): 1-2 (2005) - 2003
- [j8]Reinhard Kahle
Universes over Frege structures. Ann. Pure Appl. Log. 119(1-3): 191-223 (2003) - 2002
- [j7]Reinhard Kahle
Mathematical Proof Theory in the Light of Ordinal Analysis. Synth. 133(1-2): 237-255 (2002) - 2001
- [j6]Gerhard Jäger, Reinhard Kahle
Universes in explicit mathematics. Ann. Pure Appl. Log. 109(3): 141-162 (2001) - [j5]Reinhard Kahle
Formalizing non-termination of recursive programs. J. Log. Algebraic Methods Program. 49(1-2): 1-14 (2001) - [j4]Reinhard Kahle
Truth in Applicative Theories. Stud Logica 68(1): 103-128 (2001) - [e1]Reinhard Kahle
Proof Theory in Computer Science, International Seminar, PTCS 2001, Dagstuhl Castle, Germany, October 7-12, 2001, Proceedings. Lecture Notes in Computer Science 2183, Springer 2001, ISBN 3-540-42752-X [contents] - 2000
- [j3]Reinhard Kahle
N\hbox{\sf N}-strictness in applicative theories. Arch. Math. Log. 39(2): 125-144 (2000) - [c2]Reinhard Kahle
A Theory of Explicit Mathematics Equivalent to ID1. CSL 2000: 356-370 - [c1]Reinhard Kahle
Proof-theoretic notions for software maintenance. MFCSIT 2000: 206-219
1990 – 1999
- 1999
- [j2]Gerhard Jäger, Reinhard Kahle
The Proof-Theoretic Analysis of Transfinitely Iterated Fixed Point Theories. J. Symb. Log. 64(1): 53-67 (1999) - [j1]Reinhard Kahle
Frege Structures for Partial Applicative Theories. J. Log. Comput. 9(5): 683-700 (1999)
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-12-10 21:44 CET 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: