The problem of Uniqueness and Explicit Definability of Fixed Points for Interpretability Logic is considered. It turns out that Uniqueness is an immediate corollary of a theorem of Smoryfiski.
Some independence results in interpretability logic
✍ Scribed by Vítězslav Švejdar
- Publisher
- Springer Netherlands
- Year
- 1991
- Tongue
- English
- Weight
- 499 KB
- Volume
- 50
- Category
- Article
- ISSN
- 0039-3215
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
## Abstract In distinction from the well‐known double‐negation embeddings of the classical logic we consider some variants of single‐negation embeddings and describe some classes of superintuitionistic first‐order predicate logics in which the classical first‐order calculus is interpretable in such
We present a goal-independent abstract interpretation framework for constraint logic programs, and prove the su ciency of a set of conditions for abstract domains to ensure that the analysis will never lose precision. Along the way, we formally deÿne constraint logic programming systems, give a form