Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability
From MaRDI portal
Publication:2113424
DOI10.1134/S000143462201028XOpenAlexW4213435112WikidataQ114008850 ScholiaQ114008850MaRDI QIDQ2113424FDOQ2113424
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
Recommendations
- THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY
- The nonarithmeticity of the predicate logic of primitive recursive realizability
- scientific article; zbMATH DE number 2019914
- Strictly primitive recursive realizability, I
- A Gentzen-style axiomatization for basic predicate calculus
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule
- scientific article; zbMATH DE number 3557757
- General recursive realizability and basic logic
- On the strong semantical completeness of the intuitionistic predicate calculus
- Nonaxiomatizability of predicate logics of proofs
realizabilityconstructive semanticsbasic predicate calculus BQCstrictly primitive recursive realizability
Cites Work
Cited In (2)
This page was built for publication: Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2113424)