Independent Recursive Axiomatizability in Arithmetic

DOI10.2307/2037497MaRDI QIDQ5579483zbMATH OpenOpenAlexFDO

Authors

Publication date 1969

Full work available at URL https://doi.org/10.2307/2037497

zbMATH Keywords

algebraic logic

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites work

• Grundzüge der Systemenkalküls I
• scientific article; zbMATH DE number 3230232 (Why is no real title available?)
• scientific article; zbMATH DE number 3319513 (Why is no real title available?)
• Models of axiomatic systems
• On axiomatizability within a system
• Undecidable theories

Cited in

(6)

• Independence of the equational axioms for iteration theories
• Independent axiomatizability of sets of sentences
• An induction principle for consequence in arithmetic universes
• Undecidability of the elementary theory of the semilattice of GLP-words
• Arithmetical independence results using higher recursion theory
• A system of completely independent axioms for the sequence of natural numbers

This page was built for publication: Independent Recursive Axiomatizability in Arithmetic

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