Abstract: We introduce a class of First Order axiom systems which can simultaneously verify their own consistency and prove more Π1 theorems than Peano Arithmetic. Despite these strengths, our axiom systems do not violate Godel's Incompleteness Theorem because they treat multiplication as a partial function.
Publication Year: 1993
Publication Date: 1993-01-01
Language: en
Type: book-chapter
Indexed In: ['crossref']
Access and Citation
Cited By Count: 16
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot