A combinatorial result related to the consistency of New Foundations

Annals of Pure and Applied Logic 162 (5):373-383 (2011)
  Copy   BIBTEX

Abstract

We prove a combinatorial result for models of the 4-fragment of the Simple Theory of Types , TST4. The result says that if is a standard transitive and rich model of TST4, then satisfies the 0,0,n-property, for all n≥2. This property has arisen in the context of the consistency problem of the theory New Foundations . The result is a weak form of the combinatorial condition that was shown in Tzouvaras [5] to be equivalent to the consistency of NF. Such weak versions were introduced in Tzouvaras [6] in order to relax the intractability of the original condition. The result strengthens one of the main theorems of Tzouvaras [5, Theorem 3.6] which is just equivalent to the 0,0,2-property

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,932

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

Analytics

Added to PP
2013-10-27

Downloads
27 (#577,411)

6 months
7 (#591,670)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Athanassios Tzouvaras
Aristotle University of Thessaloniki (PhD)

Citations of this work

No citations found.

Add more citations

References found in this work

Typical Ambiguity.Ernst P. Specker - 1962 - In Ernest Nagel (ed.), Logic, methodology, and philosophy of science. Stanford, Calif.,: Stanford University Press. pp. 116--23.
A Reduction of the NF Consistency Problem.Athanassios Tzouvaras - 2007 - Journal of Symbolic Logic 72 (1):285 - 304.

Add more references