THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY

DOI10.1017/S1755020321000174OpenAlexW3156705080MaRDI QIDQ5099782

No author found.

Publication date: 26 August 2022

Published in: The Review of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s1755020321000174

zbMATH Keywords

realizabilitypredicate logicprimitive recursive functionsconstructive semanticsnonarithmeticity

Mathematics Subject Classification ID

Metamathematics of constructive systems (03F50)

Related Items (1)

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Extension of an effectively generated class of functions by enumeration
• On Primitive Recursive Realizabilities
• Enumeration and the Grzegorczyk Hierarchy
• THE NONARITHMETICITY OF THE CLASS OF REALIZABLE PREDICATE FORMULAS
• Strictly primitive recursive realizability, I
• Provably total functions of Basic Arithmetic
• On the interpretation of intuitionistic number theory

This page was built for publication: THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY