A Reduction of the NF Consistency Problem

Journal of Symbolic Logic 72 (1):285 - 304 (2007)
  Copy   BIBTEX


We give a necessary and sufficient condition in order that a type-shifting automorphism be constructed on a model of the Theory of Simple Types (TST) by forcing. Namely it is proved that, if for every n ≥ 1 there is a model of TST in the ground model M of ZFC that contains an n-extendible coherent pair, then there is a generic extension M[G] of M that contains a model of TST with a type-shifting automorphism, and hence M[G] contains a model of NF. The converse holds trivially. It is also proved that there exist models of TST containing l-extendible coherent pairs



    Upload a copy of this work     Papers currently archived: 92,283

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Problem reduction: Some thoughts.Thomas Nickles - 2005 - Poznan Studies in the Philosophy of the Sciences and the Humanities 84 (1):107-133.
The consistency strength of an infinitary Ramsey property.George Kafkoulis - 1994 - Journal of Symbolic Logic 59 (4):1158-1195.
Does functional reduction need bridge laws? A response to Marras.Kevin Morris - 2009 - British Journal for the Philosophy of Science 60 (3):647-657.
Theory Reduction by Means of Functional Sub‐types.Michael Esfeld & Christian Sachse - 2007 - International Studies in the Philosophy of Science 21 (1):1 – 17.
The Formal Structure of Genetics and the Reduction Problem.A. Lindenmayer & N. Simon - 1980 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1980:160 - 170.
Reduction and genetics.David L. Hull - 1981 - Journal of Medicine and Philosophy 6 (2):125-144.


Added to PP

42 (#381,199)

6 months
6 (#530,055)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Athanassios Tzouvaras
Aristotle University of Thessaloniki (PhD)

Citations of this work

Decreasing sentences in Simple Type Theory.Panagiotis Rouvelas - 2017 - Mathematical Logic Quarterly 63 (5):342-363.
Increasing sentences in Simple Type Theory.Panagiotis Rouvelas - 2017 - Annals of Pure and Applied Logic 168 (10):1902-1926.

Add more citations

References found in this work

No references found.

Add more references