activity
20062022
most citedIntroducing the hardline in proof theory

1 citations · 1 across the 8 of their papers we have counts for

collaborators
Showing math.LOShow all

11 papers · 1 filter

math.LO2022

Wellfoundedness proof with the maximal distinguished set

Toshiyasu Arai

In arXiv:2208.12944 it is shown that an ordinal is an upper bound for the proof-theoretic ordinal of a set theory ${\sf KP}\…

math.LO2020

Refinement of proof-theoretic analysis of the lpo due to Buchholz

Toshiyasu Arai

We give a refinement of proof-theoretic analysis of the lpo (lexicographic path order) due to W. Buchholz. This note was written in Feb. 5, 2015 when G. Moser visited Japan.

math.LO2020

A constructive proof of a theorem by Ferreira-Zantema

Toshiyasu Arai

This note was written in Jan. 23, 2015 to answer a problem raised by G. Moser, who asked a constructive proof of a theorem by Ferreira-Zantema.

math.LO2020

Two remarks on proof theory of first-order arithmetic

Toshiyasu Arai

In this note let us give two remarks on proof-theory of PA. First a derivability relation is introduced to bound witnesses for provable -formulas in PA. Second Paris-Harring…

math.LO2019

Mahlo classes for first-order reflections

Toshiyasu Arai

In this note we axiomatize the -consequences in the set theory for -reflecting universes in terms of iterations of -recursively Mahlo operati…

math.LO2019

Predicatively unprovable termination of the Ackermannian Goodstein process

Toshiyasu Arai, David Fernández-Duque, Stanley Wainer +1

The classical Goodstein process gives rise to long but finite sequences of natural numbers whose termination is not provable in Peano arithmetic. In this manuscript we consider a v…