1 problem

0 votes0 replies0 views
Formalizability of nontrivial syntax-based mathematical algorithms in simple type theory with undefinedness
The logic ${\cal Q}^{\rm uqe}_{0}$ is a simple type theory with undefinedness, quotation, and evaluation. A syntax-based mathematical algorithm is a nontrivial mathematical algorit…
Conjectureopenautomated-reasoning formal-logic type-theoryarXiv posted 2 days ago

Formalizability of nontrivial syntax-based mathematical algorithms in simple type theory with undefinedness