A counterexample to polynomially bounded realizability of basic arithmetic

DOI10.1215/00294527-2019-0013OpenAlexW2955679399WikidataQ124819451 ScholiaQ124819451MaRDI QIDQ2330507

Mohsen Shahriari, Mohammad Ardeshir, Erfan Khaniki

Publication date: 22 October 2019

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

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1562205626

zbMATH Keywords

basic arithmeticpolynomially bounded realizabilityprimitive recursive realizability

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50)

Cites Work

• Polynomially bounded recursive realizability
• Newman's Short Proof of the Prime Number Theorem
• Provably total functions of Basic Arithmetic
• An Introduction to Basic Arithmetic
• Basic predicate calculus

This page was built for publication: A counterexample to polynomially bounded realizability of basic arithmetic