Aleksandr Yu. Konovalov

dblp:303/8284 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2023
0000-0002-8845-532XORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 2 · 2 first-author · 2 since 2021
YearPublicationVenuePosition
2023 A Generalized Realizability and Intuitionistic Logic
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.
Aleksandr Yu. Konovalov
ACM Trans. Comput. Log.1
2021 Generalized Realizability and Basic Logic
abstract
Let V be a set of number-theoretical functions. We define a notion of absolute V -realizability for predicate formulas and sequents 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 Basic Predicate Calculus is sound with respect to the semantics of absolute V -realizability if V satisfies some natural conditions.
Aleksandr Yu. Konovalov
ACM Trans. Comput. Log.1