activity
20062023
most citedInductive-data-type Systems

65 citations · 67 across the 5 of their papers we have counts for

collaborators

5 papers

cs.CL2023★ 2 cited

Evaluating Large Language Models with NeuBAROCO: Syllogistic Reasoning Ability and Human-like Biases

Risako Ando, Takanobu Morishita, Hirohiko Abe +2

This paper investigates whether current large language models exhibit biases in logical reasoning, similar to humans. Specifically, we focus on syllogistic reasoning, a well-studie…

cs.LO2019

On Quasi Ordinal Diagram Systems

Mitsuhiro Okada, Yuta Takahashi

The purposes of this note are the following two; we first generalize Okada-Takeuti's well quasi ordinal diagram theory, utilizing the recent result of Dershowitz-Tzameret's version…

math.LO2018

A Note on Switching Conditions for the Generalized Logical Connectives in Multiplicative Linear Logic

Yuki Nishimuta, Mitsuhiro Okada

Danos and Regnier (1989) introduced the par-switching condition for multiplicative proof-structures and simplified the sequentialization theorem of Girard (1987) by means of par-sw…

cs.LO2006★ 65 cited

Inductive-data-type Systems

Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada

In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system an…

cs.LO2006

The Calculus of Algebraic Constructions

Frédéric Blanqui, Jean-Pierre Jouannaud, Mitsuhiro Okada

This paper is concerned with the foundations of the Calculus of Algebraic Constructions (CAC), an extension of the Calculus of Constructions by inductive data types. CAC generalize…