Nonconstructive computational mathematics

DOI10.1023/A:1005888712422zbMath0922.03076OpenAlexW1594204914MaRDI QIDQ1272604

Kenneth Kunen

Publication date: 18 October 1999

Published in: Journal of Automated Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1005888712422

zbMATH Keywords

surveyprimitive recursive arithmeticBoyer-Moore theorem prover NQTHMminimum operatorproof-theoretic strength of \(\text{PRA}^*\)

Mathematics Subject Classification ID

Related Items (1)

A formalised theorem in the partition calculus

Uses Software

• NQTHM

This page was built for publication: Nonconstructive computational mathematics