On the concept of relatively uniform realizability of propositional formulas

zbMath0802.03033MaRDI QIDQ1204621

Valery Plisko

Publication date: 11 March 1993

Published in: Moscow University Mathematics Bulletin (Search for Journal in Brave)

zbMATH Keywords

algorithmrealizabilitypartial recursive functionpropositional formulaclosed arithmetical formula

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Classical propositional logic (03B05) Recursive functions and relations, subrecursive hierarchies (03D20)

This page was built for publication: On the concept of relatively uniform realizability of propositional formulas