SOME VARIANTS OF THE NOTION OF REALIZABILITY FOR PREDICATE FORMULAS

DOI10.1070/IM1978V012N03ABEH002005zbMATH Open0414.03038OpenAlexW2066766344MaRDI QIDQ3048831FDOQ3048831

Authors: 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)

Cited In (9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3048831)