On arithmetic complexity of certain constructive logics

DOI10.1007/BF01247653zbMath0787.03055MaRDI QIDQ1206242

Valery Plisko

Publication date: 1 April 1993

Published in: Mathematical Notes (Search for Journal in Brave)

zbMATH Keywords

complexitycompletenessconstructive logicsconstructive arithmeticintuitionistic deducibility rules

Mathematics Subject Classification ID

Metamathematics of constructive systems (03F50)

Related Items (2)

Rules and arithmetics ⋮ No escape from Vardanyan's theorem

Cites Work

• SOME VARIANTS OF THE NOTION OF REALIZABILITY FOR PREDICATE FORMULAS
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On arithmetic complexity of certain constructive logics