scientific article; zbMATH DE number 14544

MaRDI QIDQ3977029zbMATH OpenFDO

Authors Ermanno Bencivenga

Publication date 25 June 1992

zbMATH Keywords

axiomatisabilitycompletenessconsistencyfree arithmetictheory FQ

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30)

Review text

The rules of the theory \(FQ\) are \(MP\) and \(R1\). The axiom-schemata of \(FQ\) are (A0)-(A11) in the author's earlier paper in Notre Dame J. Formal Logic 25, 224-226 (1984; Zbl 0545.03034), plus (A12) \((t=i\vee t<i)\supset\exists x(x=t)\), (A13) \(t<i\supset(t=0\vee\cdots\vee t=i-1)\), (A14) \(t<i\vee t=i\vee i<t\). The author proves the following: Theorem. There is no consistent, complete, axiomatizable extension of \(FQ\).

Recommendations

• Semantic Completeness of Free-Variable Theories
• Finitary consistency of a free arithmetic
• A Free-Variable Theory of Primitive Recursive Arithmetic
• Towards metamathematics of weak arithmetics over fuzzy logic
• An open formalism against incompleteness

Cited in

(3)

• Semantic Completeness of Free-Variable Theories
• scientific article; zbMATH DE number 4059394 (Why is no real title available?)
• Finitary consistency of a free arithmetic

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977029)