Affiliation:
1. Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, Russian Federation
Abstract
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.
Funder
Russian Foundation for Basic Research
Interdisciplinary Scientific and Educational School of Moscow University
Publisher
Association for Computing Machinery (ACM)
Subject
Computational Mathematics,Logic,General Computer Science,Theoretical Computer Science
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献