Ele tá dizendo que PA é inconsistente????? On Mon, Mar 5, 2012 at 8:28 AM, Joao Marcos <[email protected]> wrote:
> > ------------------------------------------------------------------------------ > \\ > arXiv:1203.0494 > Date: Fri, 2 Mar 2012 15:28:11 GMT (7kb) > > Title: Inconsistency of the Zermelo-Fraenkel set theory with the axiom of > choice and its effects on the computational complexity > Authors: Minseong Kim > Categories: cs.LO cs.CC > Comments: 9 pages > \\ > This paper exposes a contradiction in the Zermelo-Fraenkel set theory with > the axiom of choice (ZFC). While Godel's incompleteness theorems state > that a > consistent system cannot prove its consistency, they do not eliminate > proofs > using a stronger system or methods that are outside the scope of the > system. > The paper shows that the cardinalities of infinite sets are uncontrollable > and > contradictory. The paper then states that Peano arithmetic, or first-order > arithmetic, is inconsistent if all of the axioms and axiom schema assumed > in > the ZFC system are taken as being true, showing that ZFC is inconsistent. > The > paper then exposes some consequences that are in the scope of the > computational > complexity theory. > \\ ( http://arxiv.org/abs/1203.0494 , 7kb) > > %-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%-%- > > ------------------------------------------------------------------------------ > _______________________________________________ > Logica-l mailing list > [email protected] > http://www.dimap.ufrn.br/cgi-bin/mailman/listinfo/logica-l > -- fad ahhata alati, awienta Wilushati _______________________________________________ Logica-l mailing list [email protected] http://www.dimap.ufrn.br/cgi-bin/mailman/listinfo/logica-l
