Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability

DOI10.1134/S000143462201028XOpenAlexW4213435112WikidataQ114008850 ScholiaQ114008850MaRDI QIDQ2113424

Aleksandr Yur'evich Konovalov

Publication date: 14 March 2022

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

Full work available at URL: https://doi.org/10.1134/s000143462201028x

zbMATH Keywords

realizabilitystrictly primitive recursive realizabilityconstructive semanticsbasic predicate calculus BQC

Mathematics Subject Classification ID

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

Related Items (2)

A Generalized Realizability and Intuitionistic Logic ⋮ Basic predicate calculus is sound with respect to a modified version of strictly primitive recursive realizability

Cites Work

• Unnamed Item
• A propositional logic with explicit fixed points
• Enumeration and the Grzegorczyk Hierarchy
• Strictly primitive recursive realizability, I
• Provably total functions of Basic Arithmetic
• On the interpretation of intuitionistic number theory
• Basic predicate calculus

This page was built for publication: Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability