Toshiyasu Arai

According to our database, Toshiyasu Arai authored at least 37 papers between 1990 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2023

Wellfoundedness proof with the maximal distinguished set.

Toshiyasu Arai

Arch. Math. Log., May, 2023

2021

Goodstein sequences based on a Parametrized Ackermann-Péter function.

Toshiyasu Arai, Stanley S. Wainer, Andreas Weiermann

Bull. Symb. Log., 2021

2020

A Simplified Ordinal Analysis of First-order Reflection.

Toshiyasu Arai

J. Symb. Log., 2020

Proof-theoretic strengths of the well-ordering principles.

Toshiyasu Arai

Arch. Math. Log., 2020

2018

Proof-Theoretic strengths of Weak Theories for positive Inductive Definitions.

Toshiyasu Arai

J. Symb. Log., 2018

Cut-elimination for <i>ω</i>₁.

Toshiyasu Arai

Ann. Pure Appl. Log., 2018

Derivatives of normal functions and ω-models.

Toshiyasu Arai

Arch. Math. Log., 2018

2015

Intuitionistic fixed point theories over set theories.

Toshiyasu Arai

Arch. Math. Log., 2015

Predicatively computable functions on sets.

Toshiyasu Arai

Arch. Math. Log., 2015

2014

Conservations of First-order Reflections.

Toshiyasu Arai

J. Symb. Log., 2014

Lifting Proof Theory to the Countable Ordinals: Zermelo-Fraenkel Set Theory.

Toshiyasu Arai

J. Symb. Log., 2014

2013

Proof Theory of Weak compactness.

Toshiyasu Arai

J. Math. Log., 2013

A polynomial time complete disjunction property in intuitionistic propositional logic.

Toshiyasu Arai

CoRR, 2013

2011

Quick cut-elimination for strictly positive cuts.

Toshiyasu Arai

Ann. Pure Appl. Log., 2011

Exact bounds on epsilon processes.

Toshiyasu Arai

Arch. Math. Log., 2011

Nested PLS.

Toshiyasu Arai

Arch. Math. Log., 2011

2010

Wellfoundedness proofs by means of non-monotonic inductive definitions II: First order operators.

Toshiyasu Arai

Ann. Pure Appl. Log., 2010

2009

A new function algebra of EXPTIME functions by safe nested recursion.

Toshiyasu Arai, Naohi Eguchi

ACM Trans. Comput. Log., 2009

2008

Non-elementary speed-ups in logic calculi.

Toshiyasu Arai

Math. Log. Q., 2008

2006

Epsilon substitution method for Π⁰₂-FIX.

Toshiyasu Arai

J. Symb. Log., 2006

2005

Ideas in the epsilon substitution method for <i>II</i> ₁ ⁰-FIX.

Toshiyasu Arai

Ann. Pure Appl. Log., 2005

Proofs of Termination of Rewrite Systems for Polytime Functions.

Toshiyasu Arai, Georg Moser

Proceedings of the FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science, 2005

2004

Wellfoundedness proofs by means of non-monotonic inductive definitions I: Pi ⁰₂-operators.

Toshiyasu Arai

J. Symb. Log., 2004

Proof theory for theories of ordinals II: Pi₃-reflection.

Toshiyasu Arai

Ann. Pure Appl. Log., 2004

2003

Proof theory for theories of ordinals - I: recursively Mahlo ordinals.

Toshiyasu Arai

Ann. Pure Appl. Log., 2003

Epsilon substitution method for <i>ID</i>₁(Pi₁⁰ or Sigma₁⁰).

Toshiyasu Arai

Ann. Pure Appl. Log., 2003

2002

On the Slowly Well Orderedness of epsilon₀.

Toshiyasu Arai

Math. Log. Q., 2002

Epsilon substitution method for theories of jump hierarchies.

Toshiyasu Arai

Arch. Math. Log., 2002

2000

Extended normal form theorems for logical proofs from axioms.

Toshiyasu Arai, Grigori Mints

Theor. Comput. Sci., 2000

Ordinal Diagrams for PI₃-Reflection.

Toshiyasu Arai

J. Symb. Log., 2000

A Bounded Arithmetic AID for Frege Systems.

Toshiyasu Arai

Ann. Pure Appl. Log., 2000

Ordinal diagrams for recursively Mahlo universes.

Toshiyasu Arai

Arch. Math. Log., 2000

1998

Variations on a Theme by Weiermann.

Toshiyasu Arai

J. Symb. Log., 1998

Some Results on Cut-Elimination, Provable Well-Orderings, Induction, and Reflection.

Toshiyasu Arai

Ann. Pure Appl. Log., 1998

Consistency proof via pointwise induction.

Toshiyasu Arai

Arch. Math. Log., 1998

1991

A Slow Growing Analogue to Buchholz' Proof.

Toshiyasu Arai

Ann. Pure Appl. Log., 1991

1990

Derivability Conditions on Rosser's Provability Predicates.

Toshiyasu Arai

Notre Dame J. Formal Log., 1990