主な著書・論文 |
(2000年以降のもの)
著書
- 「論理リテラシー」培風館 (2009) ISBN 978-4-563-00383-8
- 「ゲーデルと20世紀の論理学(ロジック) (1) ゲーデルの20世紀」, 東京大学出版会 (2006).
ISBN 4-13-064095-X(田中一之氏,田中尚夫氏ほかと共著).
- 「数学のロジックと集合論」, 培風館 (2003) ISBN 4-563-00337-9 (田中一之氏と共著).
論文
- Resource-bounded randomness and computable Dowd-type generic sets (abstract).
The Bulletion of Symbolic Logic, to appear (with M. Kumabe).
- Probability distributions achieving the equilibrium of an AND-OR tree under directional algorithms.
Lecture Notes in Engineering and Computer Science: Proceedings of The International MultiConference of Engineers and Computer Scientists 2012,
IMECS 2012, 14-16 March, 2012, Hong Kong, pp. 194-199. ISBN978-988-19251-1-4. ISSN 2078-0958 (with Ryota Nakamura).
- Computable Dowd-type generic oracles. In: "Proceedings of the 11th Asian Logic Conference", World Scientific (Sigapore),
2011, pp.128--146. ISBN978-981-4360-53-1 (with M. Kumabe).
- Weak randomness, genericity and Boolean decision trees.In: T. Arai et al. eds.,
"Proceedings of the 10th Asian Logic Conference", World Scientific (Sigapore), 2010, pp.322--344.
ISBN978-981-4293-01-3 (with M. Kumabe).
- Does truth-table of linear norm reduce the one-query tautologies to a random oracle, Archive for Mathematical Logic 47, pp. 159--180 (2008)
(with M.Kumabe and T. Yamazaki).
- Resource bounded immunity and simplicity,Theoretical Computer Science 347, pp. 90-129 (2005) (with T. Yamakami).
- Bounded truth table does not reduce the one-query tautologies to a random oracle, Archive for Mathematical Logic 44, pp. 751--762 (2005).
- Degrees of Dowd-type generic oracles, Information and Computation 176, pp. 66--87 (2002).
- Forcing complexity: minimum sizes of forcing conditions, Notre Dame Journal of Formal Logic 42, pp. 117--120 (2001).
- Complexity of the r-query tautologies in the presence of a generic oracle, Notre Dame Journal of Formal Logic 41, pp. 142--151 (2000).
|