A combinatorial result related to the consistency of New Foundations
نویسنده
چکیده
We prove a combinatorial result for models of the 4-fragment of the Simple Theory of Types (TST), TST4. The result says that if A = 〈A0, A1, A2, A3〉 is a standard transitive and rich model of TST4, then A 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 (NF). The result is a weak form of the combinatorial condition (existence of ω-extendible coherent triples) that was shown in [5] to be equivalent to the consistency of NF. Such weak versions were introduced in [6] in order to relax the intractability of the original condition. The result strengthens one of the main theorems of [5, Theorem 3.6], which is equivalent just to the 〈0, 0, 2〉-property.
منابع مشابه
A Deterministic Multiple Key Space Scheme for Wireless Sensor Networks via Combinatorial Designs
The establishing of a pairwise key between two nodes for encryption in a wireless sensor network is a challenging issue. To do this, we propose a new deterministic key pre-distribution scheme which has modified the multiple key space scheme (MKSS). In the MKSS, the authors define two random parameters to make better resilience than existing schemes. Instead of a random selection of these parame...
متن کاملOn the Properties of Balancing and Lucas-Balancing $p$-Numbers
The main goal of this paper is to develop a new generalization of balancing and Lucas-balancing sequences namely balancing and Lucas-balancing $p$-numbers and derive several identities related to them. Some combinatorial forms of these numbers are also presented.
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملExtensional Quotients for Type Theory and the Consistency Problem for NF
Quine’s “New Foundations” (NF) was first presented in Quine [1937] and later on in Quine [1963]. Ernst Specker [1958, 1962], building upon a previous result of Ehrenfeucht and Mostowski [1956], showed that NF is consistent if and only if there is a model of the Theory of Negative (and positive) Types (TNT) with full extensionality that admits of a “shifting automorphism,” but the existence of a...
متن کاملAssessment of "drug-likeness" of a small library of natural products using chemoinformatics
Even though natural products has an excellent record as a source for new drugs, the advent of ultrahigh-throughput screening and large-scale combinatorial synthetic methods, has caused a decline in the use of natural products research in the pharmaceutical industry. This is due to the efficiency in generating and screening a high number of synthetic combinatorial compounds; whereas traditional ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Ann. Pure Appl. Logic
دوره 162 شماره
صفحات -
تاریخ انتشار 2011