arXiv (All)
open access
Incompleteness of boundedly axiomatizable theories
Our main result (Theorem A) shows the incompleteness of any consistent sequential theory T formulated in a finite language such that T is axiomatized by a collection of sentences of bounded quantifier-alternation-depth. Our proof employs an appropriate reduction mechanism to rule out the possibility
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Categorical Framework for Typed Extensional and Intensional Models in Formal Semantics#1157236
- On Rosser theories#99986
- A simple theory containing its own truth predicate#767216
- Axiomatic Theories of Partial Ground I: The Base Theory#745956
- Translating Metainferences Into Formulae: Satisfaction Operators and Sequent Calculi#763714
Record · ID 986080
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive