A Reduction of the NF consistency Problem

DOI10.2178/JSL/1174668396MaRDI QIDQ3426575zbMATH OpenOpenAlexFDO

Authors Athanassios Tzouvaras

Publication date 12 March 2007

Published in Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.693.9989

zbMATH Keywords

consistencyforcingNew Foundationstheory of simple typestype-shifting automorphism

Mathematics Subject Classification ID

Consistency and independence results (03E35) Nonclassical and second-order set theories (03E70)

Recommendations

• Extensional quotients for type theory and the consistency problem for NF
• Automorphisms of models of set theory and extensions of NFU
• A combinatorial result related to the consistency of New Foundations
• Combinatorics related to NF consistency
• Automorphisms moving all non-algebraic points and an application to NF

Cited in

(7)

• A quasi-lower bound on the consistency strength of PFA
• ON THE REDUCTION OF TYPE THEORY
• Increasing sentences in simple type theory
• Decreasing sentences in simple type theory
• A combinatorial result related to the consistency of New Foundations
• Combinatorics related to NF consistency
• There is a Forster term model of simple type theory

This page was built for publication: A Reduction of the NF consistency Problem

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