#### Filter Results:

- Full text PDF available (18)

#### Publication Year

1967

2015

- This year (0)
- Last 5 years (3)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

We speculate on logical aspects of the so-called three wise men puzzle with proof-theoretic methods. We propose and study the following. (1) Logical ability of each player of a puzzle is equivalent to a logical system KL, which is based on classical propositional calculus augmented with inferences of knowledge operators. (2) Enriched pieces of knowledge of… (More)

- Mariko Yasugi, Takakazu Mori, Yoshiki Tsujii
- Theor. Comput. Sci.
- 1999

We consider an abstract metric space with a computuhility structure and an e$%ctive separating .wt. In this article, we also introduce an @stiffly a-compuct spuce. The computability of real-valued functions on such a space is defined. It is shown that some of typical propositions in a metric space, namely Baire category theorem, Tietze’s extension theorem… (More)

- Yoshiki Tsujii, Mariko Yasugi, Takakazu Mori
- CCA
- 2000

- Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi
- CCA
- 2005

In this article, we discuss the Fine computability and the effective Fine convergence for functions on [0, 1) with respect to the Fine metric as the beginning of the effective Walsh-Fourier analysis. First we treat classically the Fine continuity and the Fine convergence. Next, we prove that Fine computability does not depend on the choice of an effective… (More)

- Mariko Yasugi, Susumu Hayashi
- Logic, Language and Computation
- 1994

- Mariko Yasugi, Yoshiki Tsujii, Takakazu Mori
- J. UCS
- 2005

We consider real sequences in I = [0, 1) and real functions on I . It is first shown that, as for real sequences from I , R-computability (computability with respect to the Euclidean topology) implies “weak Fine-computability.” Using this result, we show that “Fine-sequential computability” and “L∗-sequential computability” are equivalent for effectively… (More)

- Takakazu Mori, Yoshiki Tsujii, Mariko Yasugi
- DMTCS
- 1996

- Mariko Yasugi, Masako Washihara
- Words, Languages & Combinatorics
- 2000

We will speculate on some computational properties of the system of Rademacher functions f n g. The n-th Rademacher function n is a step function on the interval [0; 1), jumping at nitely many dyadic rationals of size 1 2 n and assuming values f1; 1g alternatingly.

- Takakazu Mori, Mariko Yasugi, Yoshiki Tsujii
- Math. Log. Q.
- 2008

- Mariko Yasugi, Takakazu Mori, Yoshiki Tsujii
- CCA
- 2005