A Generalized Realizability and Intuitionistic Logic

DOI10.1145/3565367OpenAlexW4297999804WikidataQ130808726 ScholiaQ130808726MaRDI QIDQ5886518

Aleksandr Yur'evich Konovalov

Publication date: 5 April 2023

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.08276

zbMATH Keywords

realizabilityintuitionistic logicconstructive semanticsabsolute realizability

Mathematics Subject Classification ID

Logic in computer science (03B70) Computer science (68-XX)

Related Items (1)

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

Cites Work

• On hyperarithmetical realizability
• Arithmetical realizability and basic logic
• Generalized realizability and Markov's principle
• General recursive realizability and basic logic
• Constructivism in mathematics. An introduction. Volume I
• Basic predicate calculus is not sound with respect to the strong variant of strictly primitive recursive realizability
• General recursive realizability and intuitionistic logic
• Generalized realizability for extensions of the language of arithmetic
• Absolute \(L\)-realizability and intuitionistic logic
• Arithmetical realizability and primitive recursive realizability
• ABSOLUTE REALIZABILITY OF PREDICATE FORMULAS
• THE NONARITHMETICITY OF THE CLASS OF REALIZABLE PREDICATE FORMULAS
• Strictly primitive recursive realizability, I
• Provably total functions of Basic Arithmetic
• Minimal readability of intuitionistic arithmetic and elementary analysis
• Generalized Realizability and Basic Logic
• On the interpretation of intuitionistic number theory
• Basic predicate calculus

This page was built for publication: A Generalized Realizability and Intuitionistic Logic