SOME VARIANTS OF THE NOTION OF REALIZABILITY FOR PREDICATE FORMULAS

DOI10.1070/IM1978v012n03ABEH002005zbMath0414.03038OpenAlexW2066766344MaRDI QIDQ3048831

Valery Plisko

Publication date: 1978

Published in: Mathematics of the USSR-Izvestiya (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im1978v012n03abeh002005

zbMATH Keywords

semanticsintuitionistic logicrealizable arithmetic formularealization of predicate formulas

Mathematics Subject Classification ID

Classical first-order logic (03B10) Intuitionistic mathematics (03F55)

Related Items (9)

On arithmetic complexity of certain constructive logics ⋮ Rules and arithmetics ⋮ No escape from Vardanyan's theorem ⋮ Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic ⋮ Arithmetic complexity of the predicate logics of certain complete arithmetic theories ⋮ A survey of predicate realizability logic ⋮ A semantical proof of De Jongh's theorem ⋮ Predicate Logics of Constructive Arithmetical Theories ⋮ Predicate logics of expressively strong theories

This page was built for publication: SOME VARIANTS OF THE NOTION OF REALIZABILITY FOR PREDICATE FORMULAS