On arithmetic complexity of certain constructive logics

DOI10.1007/BF01247653MaRDI QIDQ1206242zbMATH OpenFDO

Authors Valery Plisko

Publication date 1 April 1993

Published in Mathematical Notes (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01247653

zbMATH Keywords

completenesscomplexityconstructive arithmeticconstructive logicsintuitionistic deducibility rules

Mathematics Subject Classification ID

Metamathematics of constructive systems (03F50)

Review text

See the review in Zbl 0770.03019.

Cites work

• scientific article; zbMATH DE number 4087630 (Why is no real title available?)
• scientific article; zbMATH DE number 3685485 (Why is no real title available?)
• scientific article; zbMATH DE number 3073037 (Why is no real title available?)
• SOME VARIANTS OF THE NOTION OF REALIZABILITY FOR PREDICATE FORMULAS

Cited in

(10)

• Arithmetic complexity of first-order definable subsets of recursive Boolean algebras
• No escape from Vardanyan's theorem
• A Function Elimination Method for Checking Satisfiability of Arithmetical Logics
• scientific article; zbMATH DE number 3931010 (Why is no real title available?)
• scientific article; zbMATH DE number 4010488 (Why is no real title available?)
• On two questions about feasibly constructive arithmetic
• Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND
• scientific article; zbMATH DE number 7155168 (Why is no real title available?)
• scientific article; zbMATH DE number 5267925 (Why is no real title available?)
• Rules and arithmetics

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

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