Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-16T07:15:46.148Z Has data issue: false hasContentIssue false

Monotone inductive definitions in explicit mathematics

Published online by Cambridge University Press:  12 March 2014

Michael Rathjen*
Affiliation:
Department of Mathematics, Stanford University, Stanford, California 94305, E-mail: rathjen@math.stanford.edu

Abstract

The context for this paper is Feferman's theory of explicit mathematics, T0. We address a problem that was posed in [6]. Let MID be the principle stating that any monotone operation on classifications has a least fixed point. The main objective of this paper is to show that T0 + MID, when based on classical logic, also proves the existence of non-monotone inductive definitions that arise from arbitrary extensional operations on classifications. From the latter we deduce that MID, when adjoined to classical T0, leads to a much stronger theory than T0.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1996

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