z-logo
open-access-imgOpen Access
Formally Verifying Peano Arithmetic
Author(s) -
Morgan Sinclaire
Publication year - 2019
Language(s) - Uncategorized
Resource type - Dissertations/theses
DOI - 10.18122/td/1546/boisestate
Subject(s) - peano axioms , second order arithmetic , gödel's incompleteness theorems , mathematics , primitive recursive function , arithmetic , arithmetic function , consistency (knowledge bases) , first order logic , gödel's completeness theorem , mathematical logic , algebra over a field , calculus (dental) , discrete mathematics , computer science , pure mathematics , algorithm , gödel , artificial intelligence , medicine , dentistry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here