scientific article; zbMATH DE number 3310055
From MaRDI portal
Publication:5590784
Cited in
(8)- Bounded arithmetic, proof complexity and two papers of Parikh
- Hypercomputation by definition
- $$\boldsymbol{\forall }$$ and $$\boldsymbol{\omega }$$
- Strict finitism, feasibility, and the sorites
- Applying, extending, and specializing pseudorecursiveness
- Strict finitism and feasibility
- Consistent ultrafinitist logic
- Wright's first-order logic of strict finitism
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5590784)