An arithmetic interpretation of intuitionistic verification

DOI10.1093/LOGCOM/EXAA016OpenAlexW3008187752WikidataQ126398985 ScholiaQ126398985MaRDI QIDQ5108030

Tudor Protopopescu

Publication date: 29 April 2020

Published in: Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1093/logcom/exaa016

zbMATH Keywords

verificationlogic of proofsBHK semanticsarithmetic interpretationintuitionistic epistemic logicintuitionistic knowledge

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Related Items (8)

Characterizations of interpretability in bounded arithmetic ⋮ Topological models of epistemic set theory ⋮ Intuitionistic weak arithmetic ⋮ Unnamed Item ⋮ A generalization of a conservativity theorem for classical versus intuitionistic arithmetic ⋮ Unnamed Item ⋮ Using an induction prover for verifying arithmetic circuits ⋮ LEMA

This page was built for publication: An arithmetic interpretation of intuitionistic verification