Restricted polynomial induction versus parameter free ordinary induction

DOI10.4064/fm887-10-2021OpenAlexW4205174085MaRDI QIDQ5066172

Zofia Adamowicz

Publication date: 29 March 2022

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4064/fm887-10-2021

zbMATH Keywords

consistencyinductionend extensionconservativity

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Gödel numberings and issues of incompleteness (03F40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Diophantine induction
• Hilbert's tenth problem for weak theories of arithmetic
• On induction-free provability
• Well-behaved principles alternative to bounded induction
• Induction rules in bounded arithmetic
• END-EXTENSIONS OF MODELS OF WEAK ARITHMETIC FROM COMPLEXITY-THEORETIC CONTAINMENTS
• Lower and upper bounds for the provability of Herbrand consistency in weak arithmetics
• On parameter free induction schemas
• Restricted polynomial induction versus ordinary induction
• On the Herbrand notion of consistency for finitely axiomatizable fragments of bounded arithmetic theories

This page was built for publication: Restricted polynomial induction versus parameter free ordinary induction