Toshiyasu Arai

38 papers Journal 37Unranked 1

Year	Rank	Type	Title / Venue / Authors
2023	J	`jnl`	Wellfoundedness proof with the maximal distinguished set. Arch. Math. Log. Toshiyasu Arai
2021	J	`jnl`	Goodstein sequences based on a Parametrized Ackermann-Péter function. Bull. Symb. Log. Toshiyasu Arai, Stanley S. Wainer, Andreas Weiermann
2020	J	`jnl`	A Simplified Ordinal Analysis of First-order Reflection. J. Symb. Log. Toshiyasu Arai
2020	J	`jnl`	Proof-theoretic strengths of the well-ordering principles. Arch. Math. Log. Toshiyasu Arai
2018	J	`jnl`	Cut-elimination for Ann. Pure Appl. Log. Toshiyasu Arai
2018	J	`jnl`	Derivatives of normal functions and ω-models. Arch. Math. Log. Toshiyasu Arai
2018	J	`jnl`	Proof-Theoretic strengths of Weak Theories for positive Inductive Definitions. J. Symb. Log. Toshiyasu Arai
2015	J	`jnl`	Intuitionistic fixed point theories over set theories. Arch. Math. Log. Toshiyasu Arai
2015	J	`jnl`	Predicatively computable functions on sets. Arch. Math. Log. Toshiyasu Arai
2014	J	`jnl`	Conservations of First-order Reflections. J. Symb. Log. Toshiyasu Arai
2014	J	`jnl`	Lifting Proof Theory to the Countable Ordinals: Zermelo-Fraenkel Set Theory. J. Symb. Log. Toshiyasu Arai
2013	J	`jnl`	A polynomial time complete disjunction property in intuitionistic propositional logic. CoRR Toshiyasu Arai
2013	J	`jnl`	Proof Theory of Weak compactness. J. Math. Log. Toshiyasu Arai
2011	J	`jnl`	Exact bounds on epsilon processes. Arch. Math. Log. Toshiyasu Arai
2011	J	`jnl`	Nested PLS. Arch. Math. Log. Toshiyasu Arai
2011	J	`jnl`	Quick cut-elimination for strictly positive cuts. Ann. Pure Appl. Log. Toshiyasu Arai
2010	J	`jnl`	Wellfoundedness proofs by means of non-monotonic inductive definitions II: First order operators. Ann. Pure Appl. Log. Toshiyasu Arai
2009	J	`jnl`	A new function algebra of EXPTIME functions by safe nested recursion. ACM Trans. Comput. Log. Toshiyasu Arai, Naohi Eguchi
2008	J	`jnl`	Non-elementary speed-ups in logic calculi. Math. Log. Q. Toshiyasu Arai
2006	J	`jnl`	A new function algebra of EXPTIME functions by safe nested recursion CoRR Toshiyasu Arai, Naohi Eguchi
2006	J	`jnl`	Epsilon substitution method for Π J. Symb. Log. Toshiyasu Arai
2005	J	`jnl`	Ideas in the epsilon substitution method for Ann. Pure Appl. Log. Toshiyasu Arai
2005	—	`conf`	Proofs of Termination of Rewrite Systems for Polytime Functions. FSTTCS Toshiyasu Arai, Georg Moser
2004	J	`jnl`	Proof theory for theories of ordinals II: Pi Ann. Pure Appl. Log. Toshiyasu Arai
2004	J	`jnl`	Wellfoundedness proofs by means of non-monotonic inductive definitions I: Pi J. Symb. Log. Toshiyasu Arai
2003	J	`jnl`	Epsilon substitution method for Ann. Pure Appl. Log. Toshiyasu Arai
2003	J	`jnl`	Proof theory for theories of ordinals - I: recursively Mahlo ordinals. Ann. Pure Appl. Log. Toshiyasu Arai
2002	J	`jnl`	Epsilon substitution method for theories of jump hierarchies. Arch. Math. Log. Toshiyasu Arai
2002	J	`jnl`	On the Slowly Well Orderedness of epsilon Math. Log. Q. Toshiyasu Arai
2000	J	`jnl`	A Bounded Arithmetic AID for Frege Systems. Ann. Pure Appl. Log. Toshiyasu Arai
2000	J	`jnl`	Extended normal form theorems for logical proofs from axioms. Theor. Comput. Sci. Toshiyasu Arai, Grigori Mints
2000	J	`jnl`	Ordinal Diagrams for PI J. Symb. Log. Toshiyasu Arai
2000	J	`jnl`	Ordinal diagrams for recursively Mahlo universes. Arch. Math. Log. Toshiyasu Arai
1998	J	`jnl`	Consistency proof via pointwise induction. Arch. Math. Log. Toshiyasu Arai
1998	J	`jnl`	Some Results on Cut-Elimination, Provable Well-Orderings, Induction, and Reflection. Ann. Pure Appl. Log. Toshiyasu Arai
1998	J	`jnl`	Variations on a Theme by Weiermann. J. Symb. Log. Toshiyasu Arai
1991	J	`jnl`	A Slow Growing Analogue to Buchholz' Proof. Ann. Pure Appl. Log. Toshiyasu Arai
1990	J	`jnl`	Derivability Conditions on Rosser's Provability Predicates. Notre Dame J. Formal Log. Toshiyasu Arai