Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability

DOI10.1134/s0001434623110585MaRDI QIDQ6194302

Aleksandr Yur'evich Konovalov

Publication date: 19 March 2024

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

realizabilitystrictly primitive recursive realizabilityconstructive semanticsbasis predicate logic BQC

Mathematics Subject Classification ID

General logic (03Bxx) Proof theory and constructive mathematics (03Fxx) Model theory (03Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• On hyperarithmetical realizability
• Arithmetical realizability and basic logic
• General recursive realizability and basic logic
• A propositional logic with explicit fixed points
• Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability
• General recursive realizability and intuitionistic logic
• Absolute \(L\)-realizability and intuitionistic logic
• Enumeration and the Grzegorczyk Hierarchy
• Strictly primitive recursive realizability, I
• Provably total functions of Basic Arithmetic
• Generalized Realizability and Basic Logic
• THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY
• On the interpretation of intuitionistic number theory
• A Generalized Realizability and Intuitionistic Logic
• Basic predicate calculus

This page was built for publication: Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability