Joost J. Joosten

From MaRDI portal
Person:385072

Available identifiers

zbMath Open joosten.joost-jMaRDI QIDQ385072

List of research outcomes





PublicationDate of PublicationType
Correction to: ``Arithmetical and hyperarithmetical worm battles2024-11-12Paper
An overview of Verbrugge semantics, a.k.a. generalised Veltman semantics2024-10-01Paper
AN ESCAPE FROM VARDANYAN’S THEOREM2023-12-22Paper
Strictly Positive Fragments of the Provability Logic of Heyting Arithmetic2023-12-22Paper
Theory and application of labelling techniques for interpretability logics2023-09-12Paper
Arithmetical and Hyperarithmetical Worm Battles2023-01-04Paper
https://portal.mardi4nfdi.de/entity/Q51046962022-09-15Paper
Hyperarithmetical worm battles2022-07-01Paper
MÜNCHHAUSEN PROVABILITY2021-12-09Paper
To drive or not to drive: a logical and computational analysis of European transport regulations2021-09-21Paper
An overview of Generalised Veltman Semantics2020-07-09Paper
The logic of Turing progressions2020-05-04Paper
The interpretability logic of all reasonable arithmetical theories2020-04-27Paper
TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES2020-04-17Paper
Quantified Reflection Calculus with one modality2020-03-30Paper
Assuring and critical labels for relations between maximal consistent sets for interpretability logics2020-03-10Paper
Characterizations of interpretability in bounded arithmetic2020-02-03Paper
M\"unchhausen provability2019-08-29Paper
Relational Semantics for the Turing Schmerl Calculus2019-07-24Paper
The Worm Calculus2019-07-24Paper
Labelled tableaux for interpretability logics2019-07-24Paper
The Reduction Property Revisited2019-03-08Paper
Well-orders in the transfinite Japaridze algebra2019-01-08Paper
The omega-rule interpretation of transfinite provability logic2018-02-06Paper
PREDICATIVITY THROUGH TRANSFINITE REFLECTION2017-09-26Paper
Turing-Taylor expansions for arithmetic theories2017-03-02Paper
Fractal dimension versus process complexity2017-01-17Paper
The closed fragment of IL is PSPACE hard2016-10-07Paper
Turing Jumps Through Provability2015-10-20Paper
Two series of formalized interpretability principles for weak systems of arithmetic2015-03-31Paper
On provability logics with linearly ordered modalities2014-09-26Paper
https://portal.mardi4nfdi.de/entity/Q54198792014-06-11Paper
A secure additive protocol for card players2014-01-03Paper
Hyperations, Veblen progressions and transfinite iteration of ordinal functions2013-11-29Paper
\(\Pi_1^0\)-ordinal analysis beyond first-order arithmetic2013-11-14Paper
Models of transfinite provability logic2013-06-24Paper
Turing Progressions and Their Well-Orders2012-08-14Paper
Self provers and \(\Sigma_{1}\) sentences2012-08-01Paper
Provability and interpretability logics with restricted realizations2012-07-11Paper
Well-orders in the transfinite Japaridze algebra II: Turing progressions and their well-orders2012-04-20Paper
Hidden Variables Simulating Quantum Contextuality Increasingly Violate the Holevo Bound2011-06-17Paper
A new principle in the interpretability logic of all reasonable arithmetical theories2011-03-07Paper
Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA2010-10-27Paper
Interpretability in PRA2009-11-04Paper
Modal Matters for Interpretability Logics2008-11-13Paper
Propositional proof systems and fast consistency provers2008-02-05Paper
A Finitary Treatment of the Closed Fragment of Japaridze's Provability Logic2005-10-18Paper
The closed fragment of the interpretability logic of PRA with a constant for I\(\Sigma^1\)2005-09-28Paper
The interpretability logic of all reasonable arithmetical theories. The new conjecture2001-12-18Paper

Research outcomes over time

This page was built for person: Joost J. Joosten