An open formalism against incompleteness

DOI10.1305/ndjfl/1038949537zbMath0972.03058OpenAlexW2057099403MaRDI QIDQ5937853

Francesc Tomàs

Publication date: 17 July 2001

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1305/ndjfl/1038949537

zbMATH Keywords

consistencyfirst-order logicomega-ruleopen formalism for arithmeticPeano Arithmetic

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Proof theory. 2nd ed
• Some rapidly growing functions
• Reflecting on incompleteness
• Proof of Recursive Unsolvability of Hilbert's Tenth Problem
• Hilbert's program and the omega-rule
• On the incompleteness theorems
• Hilbert's Tenth Problem is Unsolvable
• Transfinite recursive progressions of axiomatic theories
• The constructive second number class
• Systems of Logic Based on Ordinals^†

This page was built for publication: An open formalism against incompleteness