A combinatorial result related to the consistency of New Foundations

DOI10.1016/J.APAL.2010.11.003MaRDI QIDQ638501zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 53037 (Why is no real title available?)
• scientific article; zbMATH DE number 3250586 (Why is no real title available?)
• scientific article; zbMATH DE number 3328993 (Why is no real title available?)
• A Reduction of the NF consistency Problem
• Combinatorics related to NF consistency

Cited in

(3)

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

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)