THE NONARITHMETICITY OF THE CLASS OF REALIZABLE PREDICATE FORMULAS
From MaRDI portal
Publication:4161322
DOI10.1070/IM1977v011n03ABEH001731zbMath0382.03043OpenAlexW2078153623MaRDI QIDQ4161322
Publication date: 1977
Published in: Mathematics of the USSR-Izvestiya (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1070/im1977v011n03abeh001731
First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15) Computability and recursion theory (03D99) Subsystems of classical logic (including intuitionistic logic) (03B20) Intuitionistic mathematics (03F55) Connections of number theory and logic (11U99)
Related Items
A Generalized Realizability and Intuitionistic Logic ⋮ Vaught's Theorem on Axiomatizability by a Scheme ⋮ THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY ⋮ Rules and arithmetics ⋮ No escape from Vardanyan's theorem ⋮ Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic ⋮ A survey of predicate realizability logic ⋮ Modified realizability and predicate logic ⋮ Predicate Logics of Constructive Arithmetical Theories
