scientific article

zbMath0665.03011MaRDI QIDQ3816054

V. A. Vardanyan

Publication date: 1988

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

predicate provability logicpairs of theorieslower and upper bounds of arithmetical complexity

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Structure of proofs (03F07)

Related Items (3)

AN ESCAPE FROM VARDANYAN’S THEOREM ⋮ On arithmetic complexity of certain constructive logics ⋮ Arithmetic complexity of the predicate logics of certain complete arithmetic theories

This page was built for publication: