Quantifier-free and one-quantifier systems

DOI10.1007/BF01117472zbMath0252.02027OpenAlexW2014082347MaRDI QIDQ2557247

Grigori 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)

Related Items (6)

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

Cites Work

• Reflection Principles and their Use for Establishing the Complexity of Axiomatic Systems
• Unnamed Item
• Unnamed Item

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