[TYPES] a question

Vladimir Voevodsky vladimir at ias.edu
Thu Jul 19 10:43:10 EDT 2012


Hello,

does any one know if the system of natural arithmetic with equality, addition, multiplication, exponentiation (or without exponentiation), "forall" quantifier, implication and conjunction is decidable? There is no existential quantifier and no negation.

Thanks!
Vladimir.




More information about the Types-list mailing list