Generalized Realizability and Basic Logic
From MaRDI portal
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 paper we prove that Basic Logic is sound with respect to the semantics of absolute V-realizability if V satisfies some natural conditions.
Recommendations
Cited in
(11)- Generalized realizability for extensions of the language of arithmetic
- The logic of generalized truth values and the logic of bilattices
- scientific article; zbMATH DE number 5851813 (Why is no real title available?)
- ABSOLUTE REALIZABILITY OF PREDICATE FORMULAS
- scientific article; zbMATH DE number 3557757 (Why is no real title available?)
- scientific article; zbMATH DE number 3216186 (Why is no real title available?)
- A Generalized Realizability and Intuitionistic Logic
- Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability
- Generalized realizability and Markov's principle
- General recursive realizability and basic logic
- Well-foundedness in realizability
This page was built for publication: Generalized Realizability and Basic Logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5056354)