4 citations · 11 across the 17 of their papers we have counts for
4 papers · 1 filter
Bluebirds and mockingbirds cannot produce a fixed-point combinator
Takuma Imamura
Let be the bluebird combinator with reduction rule , let be the mockingbird combinator with reduction rule , and let be th…
Hallucination, abstention, and computable inseparability
Takuma Imamura
The impossibility of eliminating hallucination, understood here as incorrect definite answers, in sufficiently expressive yes-or-no formal domains is an immediate consequence of cl…
Hypersequent Calculi for Intermediate Predicate Logics
Takuma Imamura, Shuya Matsumoto, Shin Quawai
We report on the current status of our on-going project to develop well-behaved hypersequent calculi for intermediate predicate logics, such as the linearity axiom $\mathbf{LIN}\co…
Game arguments in some existence theorems of Friedberg numberings
Takuma Imamura
We provide game-theoretic proofs of some well-known existence theorems of Friedberg numberings for the class of all partial computable functions, including (1) the existence of two…