4 citations · 11 across the 17 of their papers we have counts for
18 papers
Attestable Audit: Property-Based Attestation for Proprietary Workloads without Artifact Disclosure
Takuma Imamura
Trusted Execution Environments (TEEs) prove the integrity of code and data to a remote peer through remote attestation: the TEE issues an attestation report by signing, with a hard…
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…
Bootstrapping Mutual Attestation with Kleene's Second Recursion Theorem
Takuma Imamura
Remote attestation is a procedure by which a system (such as a Trusted Execution Environment) proves its own configuration to a remote peer. Here, the configuration includes the me…
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…
Sequential ends and nonstandard infinite boundaries of coarse spaces
Takuma Imamura
This paper is an addendum to the author's previous paper [#Im20a]. Miller et al. [#MSM10] introduced a functor , where i…
Another view of the coarse invariant
Takuma Imamura
Miller, Stibich and Moore (2010) developed a set-valued coarse invariant of pointed metric spaces. DeLyser, LaBuz and Tobash (2013) provided a different way to…
Nonstandard methods in large-scale topology II
Takuma Imamura
This paper is a sequel of Imamura (2019) (arXiv:1711.01609) where we set up a framework of nonstandard large-scale topology. In the present paper, we apply our framework to various…
Asymmetric completions of partial metric spaces
Takuma Imamura
Ge and Lin (2015) proved the existence and the uniqueness of p-Cauchy completions of partial metric spaces under symmetric denseness. They asked if every (non-empty) partial metric…
Fehrele's principle in nonstandard topology
Takuma Imamura
In nonstandard analysis, Fehrele's principle is a beautiful criterion for a set to be internal, stating that every galactic halic set is internal. In this note, we use this princip…
A nonstandard construction of direct limit group actions
Takuma Imamura
Manevitz and Weinberger (1996) proved that the existence of effective -Lipschitz -actions implies the existence of effective -Lipschitz $\mathbb{Q}/\m…
On the extreme power of nonstandard programming languages
Takuma Imamura
Suenaga and Hasuo introduced a nonstandard programming language which models hybrid systems. We demonstrate why is not suitable for mo…
On the definition of neutrosophic logic
Takuma Imamura
Smarandache (2003) introduced a new set-valued fuzzy logic called (nonstandard) neutrosophic logic by using Robinson's nonstandard analysis. However, its definition involved many e…
A nonstandard invariant of coarse spaces
Takuma Imamura
We construct a set-valued invariant of pointed coarse spaces by using nonstandard analysis. The invariance under coarse equivalence is establ…
Nonstandard methods in large-scale topology
Takuma Imamura
We develop some nonstandard techniques for bornological and coarse spaces. We first generalise the notion of bornology to prebornology, which better fits to coarse spaces. We then…
Relationship among various Vietoris-type and microsimplicial homology theories
Takuma Imamura
In this paper, we clarify the relationship among the Vietoris-type homology theories and the microsimplicial homology theories, where the latter are nonstandard homology theories d…
Nonstandard homology theory for uniform spaces
Takuma Imamura
We introduce a new homology theory of uniform spaces, provisionally called -homology theory. Our homology theory is based on hyperfinite chains of microsimplices. This idea is d…
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…