
arXiv: 2205.08276
Let V be a set of number-theoretical functions. We define a notion of V -realizability for predicate formulas in such a way that the indices of functions in V are used for interpreting the implication and the universal quantifier. In this article, we prove that Intuitionistic Predicate Calculus is sound with respect to the semantics of V -realizability if and only if some natural conditions for V hold.
Logic in computer science, realizability, constructive semantics, absolute realizability, FOS: Mathematics, Mathematics - Logic, intuitionistic logic, Logic (math.LO), Computer science
Logic in computer science, realizability, constructive semantics, absolute realizability, FOS: Mathematics, Mathematics - Logic, intuitionistic logic, Logic (math.LO), Computer science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
