The following pages link to Reinhard Kahle (Q194998):
Displaying 50 items.
- Two function algebras defining functions in \(\mathsf{NC}^k\) Boolean circuits (Q276257) (← links)
- Saved from the cellar. Gerhard Gentzen's shorthand notes on logic and foundations of mathematics (Q530609) (← links)
- The Suslin operator in applicative theories: its proof-theoretic analysis via ordinal theories (Q639666) (← links)
- Cut elimination for S4C: A case study (Q817705) (← links)
- Mathematical method and proof (Q857692) (← links)
- Unifying functional interpretations (Q867407) (← links)
- Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 (Q873911) (← links)
- Analytic proof systems for \(\lambda\)-calculus: the elimination of transitivity, and why it matters (Q884953) (← links)
- A solution to Curry and Hindley's problem on combinatory strong reduction (Q1014284) (← links)
- Full operational set theory with unbounded existential quantification and power set (Q1024551) (← links)
- Desperately seeking mathematical proof (Q1026606) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- A note on the wise girls puzzle (Q1349271) (← links)
- Proof theory for theories of ordinals. I: Recursively Mahlo ordinals (Q1400597) (← links)
- The proof-theoretic analysis of \(\Sigma_{1}^{1}\) transfinite dependent choice (Q1400604) (← links)
- Polytime, combinatory logic and positive safe induction (Q1407533) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Hilbert's paradox (Q1604663) (← links)
- From Dedekind to Zermelo versus Peano to Gödel (Q1694959) (← links)
- An ordinal analysis of stability (Q1765099) (← links)
- An ordinal analysis of parameter free \(\Pi^{1}_{2}\)-comprehension (Q1777268) (← links)
- Universes over Frege structures (Q1861539) (← links)
- Mathematical proof theory in the light of ordinal analysis (Q1868167) (← links)
- Proof theory for theories of ordinals. II: \(\Pi_{3}\)-reflection (Q1887655) (← links)
- Herbrand's fundamental theorem in the eyes of Jean van Heijenoort (Q1942097) (← links)
- Applicative theories for the polynomial hierarchy of time and its levels (Q1946672) (← links)
- N-strictness in applicative theories (Q1976882) (← links)
- \(k\)-provability in \(\mathrm{PA}\) (Q2070428) (← links)
- Implicit recursion-theoretic characterizations of counting classes (Q2085583) (← links)
- The intensional structure of epistemic convictions (Q2234051) (← links)
- Proof theory for heterogeneous logic combining formulas and diagrams: proof normalization (Q2238136) (← links)
- A note on the theory of positive induction, \({{\text{ID}}^*_1}\) (Q2267752) (← links)
- On a distinction of two facets of meaning and its role in proof-theoretic semantics (Q2342803) (← links)
- Fresh logic: Proof-theory and semantics for FM and nominal techniques (Q2372191) (← links)
- \(LE^{t}_{ \to }, LR^{ \circ }_{\widehat{\sim}}, LK\) and cutfree proofs (Q2454875) (← links)
- On Feferman's operational set theory \textsf{OST} (Q2463480) (← links)
- Generalized definitional reflection and the inversion principle (Q2470764) (← links)
- A proof-theoretic view of necessity (Q2500817) (← links)
- Theories and ordinals in proof theory (Q2500821) (← links)
- Equivalences between pure type systems and systems of illative combinatory logic (Q2565990) (← links)
- A simple proof of second-order strong normalization with permutative conversions (Q2566069) (← links)
- Is there a ``Hilbert thesis''? (Q2631647) (← links)
- Strict \({\varPi^1_1}\)-reflection in bounded arithmetic (Q2655140) (← links)
- (Q2753685) (← links)
- Modalities Without Worlds (Q2908759) (← links)
- (Q2931087) (← links)
- Checking Proofs (Q2950035) (← links)
- (Q3003834) (← links)
- (Q3081647) (← links)
- THE UNIVERSAL SET AND DIAGONALIZATION IN FREGE STRUCTURES (Q3094184) (← links)
