Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability
From MaRDI portal
Publication:2113424
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
Cites work
- scientific article; zbMATH DE number 3083488 (Why is no real title available?)
- A propositional logic with explicit fixed points
- Basic predicate calculus
- Enumeration and the Grzegorczyk Hierarchy
- On the interpretation of intuitionistic number theory
- Provably total functions of Basic Arithmetic
- Strictly primitive recursive realizability, I
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)