Formal arithmetic in combinatorily complete systems. I
From MaRDI portal
Classical first-order logic (03B10) Combinatory logic and lambda calculus (03B40) Categoricity and completeness of theories (03C35) Cut-elimination and normal-form theorems (03F05) First-order arithmetic and fragments (03F30) Proof theory and constructive mathematics (03F99) Connections of number theory and logic (11U99)
This page was built for publication: Formal arithmetic in combinatorily complete systems. I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1260022)