Partially generic formulas in arithmetic

DOI10.1305/NDJFL/1093637867MaRDI QIDQ1105594zbMATH OpenOpenAlexFDO

Authors Per Lindström

Publication date 1988

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

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

zbMATH Keywords

interpretabilityPeano Arithmeticpartially conservative sentences

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Recommendations

• Generic incompleteness of formal arithmetic
• Recursively Enumerable Images of Arithmetic Sets
• Generic Gödel's incompleteness theorem
• Complete, Recursively Enumerable Relations in Arithmetic
• A theorem on partial conservativity in arithmetic

Cited in

(1)

• On partial disjunction properties of theories containing Peano arithmetic

This page was built for publication: Partially generic formulas in arithmetic

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