Hostname: page-component-7b7567c8c-fvjsw Total loading time: 0 Render date: 2026-11-15T05:10:42.907Z Has data issue: false hasContentIssue false

Δ3O-determinacy, comprehension and induction

Published online by Cambridge University Press:  12 March 2014

Medyahya Ould Medsalem*
Affiliation:
Mathematical Institute, Tohoku University, Sendai, 980-8578, Japan
Kazuyuki Tanaka
Affiliation:
Mathematical Institute, Tohoku University, Sendai, 980-8578, Japan, E-mail: tanaka@math.tohoku.ac.jp
*
Current address: University of Paris-XI, Orsay, LRI, Bat.490, 91405 Orsay Cedex, France, E-mail: dah@lri.fr

Abstract

We show that each of and proves -Det and that neither nor can be dropped. We also show that neither nor proves -Det. Moreover, we prove that none of and is provable in

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2007

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable