A combinatorial result related to the consistency of New Foundations

DOI10.1016/J.APAL.2010.11.003zbMATH Open1235.03078OpenAlexW1973374301MaRDI QIDQ638501FDOQ638501

Authors: Athanassios Tzouvaras 

Publication date: 12 September 2011

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apal.2010.11.003

Recommendations

• Combinatorics related to NF consistency
• The definability strength of combinatorial principles
• FOUNDATIONS OF A NEW AXIOMATIC SET THEORY
• scientific article; zbMATH DE number 1822257
• A Combinatorial Generalization of a Putnam Problem
• A combinatorial version of the Svenonius theorem on definability
• A CONCEPTUAL PROOF OF A BASIC RESULT IN THE COMBINATORIAL APPROACH TO FREENESS
• Number theoretic results related to the axioms of choice for finite sets
• Some exact equiconsistency results in set theory
• scientific article; zbMATH DE number 3316901

zbMATH Keywords

coherent triple of partitionsextendibility of coherent tripleNew Foundationssimple theory of types

Mathematics Subject Classification ID

Other combinatorial set theory (03E05) Other aspects of forcing and Boolean-valued models (03E40) Nonclassical and second-order set theories (03E70)

Cites Work

• Title not available (Why is that?)
• A Reduction of the NF consistency Problem
• Combinatorics related to NF consistency
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (3)

• Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic
• A Reduction of the NF consistency Problem
• Combinatorics related to NF consistency

This page was built for publication: A combinatorial result related to the consistency of New Foundations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q638501)