Completeness in Partial Type Theory

Investor logo
Authors

RACLAVSKÝ Jiří KUCHYŇKA Petr

Year of publication 2021
Type Appeared in Conference without Proceedings
MU Faculty or unit

Faculty of Arts

Citation
Description Higher-order logic (HOL), especially simple type theory (STT), are expressive systems of quantification over numerous domains. The expressive power causes incompleteness in standard models, but Henkin proved the completeness of STT w.r.t. to general models. We adjust his procedure and provide a completeness proof for natural deduction system for partial TT called TT*, which is systematically equipped with both total and partial functions, and even with special `evaluation terms' (the system thus treats even a hierarchy of functions-as-computations).
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.