Hostname: page-component-7b7567c8c-tnzcf Total loading time: 0 Render date: 2026-11-15T08:40:15.153Z Has data issue: false hasContentIssue false

Uniform inseparability in explicit mathematics

Published online by Cambridge University Press:  12 March 2014

Andrea Cantini
Affiliation:
Department of Philosophy, Università Degli Studi di Firenze, Via Bolognese 52, 1-50139 Firenze, Italy E-mail: cantini@mailserver.idg.fi.cnr.it
Pierluigi Minari
Affiliation:
Department of Philosophy, Università Degli Studi di Firenze, Via Bolognese 52, 1-50139 Firenze, Italy E-mail: minari@mphilos.unifi.it

Abstract

We deal with ontological problems concerning basic systems of explicit mathematics, as formalized in Jäger's language of types and names. We prove a generalized inseparability lemma, which implies a form of Rice's theorem for types and a refutation of the strong power type axiom POW+. Next, we show that POW+ can already be refuted on the basis of a weak uniform comprehension without complementation, and we present suitable optimal refinements of the remaining results within the weaker theory.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

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