The following pages link to Joost J. Joosten (Q385072):
Displaying 45 items.
- Hyperations, Veblen progressions and transfinite iteration of ordinal functions (Q385073) (← links)
- Provability and interpretability logics with restricted realizations (Q435232) (← links)
- On provability logics with linearly ordered modalities (Q456968) (← links)
- Fractal dimension versus process complexity (Q504699) (← links)
- Turing-Taylor expansions for arithmetic theories (Q514512) (← links)
- Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA (Q711565) (← links)
- Provability logics for natural Turing progressions of arithmetical theories (Q804564) (← links)
- To drive or not to drive: a logical and computational analysis of European transport regulations (Q821552) (← links)
- Interpretability in PRA (Q1035648) (← links)
- The omega-rule interpretation of transfinite provability logic (Q1694812) (← links)
- The interpretability logic of all reasonable arithmetical theories. The new conjecture (Q1840999) (← links)
- Hyperarithmetical worm battles (Q2151396) (← links)
- The logic of Turing progressions (Q2176413) (← links)
- Propositional proof systems and fast consistency provers (Q2469433) (← links)
- The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\) (Q2565986) (← links)
- The closed fragment of IL is PSPACE hard (Q2825406) (← links)
- \(\Pi_1^0\)-ordinal analysis beyond first-order arithmetic (Q2862108) (← links)
- A secure additive protocol for card players (Q2869467) (← links)
- Self provers and \(\Sigma_{1}\) sentences (Q2903747) (← links)
- Turing Progressions and Their Well-Orders (Q2904409) (← links)
- Hidden Variables Simulating Quantum Contextuality Increasingly Violate the Holevo Bound (Q3007705) (← links)
- A new principle in the interpretability logic of all reasonable arithmetical theories (Q3081234) (← links)
- Turing Jumps Through Provability (Q3195699) (← links)
- Modal Matters for Interpretability Logics (Q3535605) (← links)
- Well-orders in the transfinite Japaridze algebra (Q4644499) (← links)
- MÜNCHHAUSEN PROVABILITY (Q5015723) (← links)
- (Q5104696) (← links)
- TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES (Q5107215) (← links)
- Characterizations of interpretability in bounded arithmetic (Q5213551) (← links)
- The Worm Calculus (Q5224557) (← links)
- Relational Semantics for the Turing Schmerl Calculus (Q5224574) (← links)
- Labelled tableaux for interpretability logics (Q5224691) (← links)
- Models of transfinite provability logic (Q5300077) (← links)
- PREDICATIVITY THROUGH TRANSFINITE REFLECTION (Q5359565) (← links)
- (Q5419879) (← links)
- A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic (Q5696302) (← links)
- Arithmetical and Hyperarithmetical Worm Battles (Q5872868) (← links)
- Theory and application of labelling techniques for interpretability logics (Q6094159) (← links)
- AN ESCAPE FROM VARDANYAN’S THEOREM (Q6140187) (← links)
- M\"unchhausen provability (Q6324383) (← links)
- Quantified Reflection Calculus with one modality (Q6337696) (← links)
- An overview of Verbrugge semantics, a.k.a. generalised Veltman semantics (Q6612811) (← links)
- Correction to: ``Arithmetical and hyperarithmetical worm battles'' (Q6636671) (← links)
- Feferman Interpretability (Q6734151) (← links)
- A tree rewriting system for the Reflection Calculus (Q6737087) (← links)
