Quantifier-free and one-quantifier systems

DOI10.1007/BF01117472MaRDI QIDQ2557247zbMATH OpenOpenAlexFDO

Authors G. E. Mints

Publication date 1973

Published in Journal of Soviet Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01117472

Mathematics Subject Classification ID

Computability and recursion theory (03D99) Proof theory and constructive mathematics (03F99)

Cites work

• scientific article; zbMATH DE number 3336816 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems

Cited in

(6)

• Herbrand analyses
• Unfolding finitist arithmetic
• A simple proof of Parsons' theorem
• Consistency statements and iterations of computable functions in \(\mathrm{I}\Sigma_1\) and PRA
• Fragments of arithmetic
• Primitive recursive selection functions for existential assertions over abstract algebras

This page was built for publication: Quantifier-free and one-quantifier systems

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