On two questions about feasibly constructive arithmetic

DOI10.1002/MALQ.200310045MaRDI QIDQ4419272zbMATH OpenOpenAlexFDO

Authors Morteza Moniri

Publication date 31 July 2003

Published in MLQ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200310045

zbMATH Keywords

first-order arithmeticKripke modelnegative translationNP-formulapolynomial hierarchypolynomial induction

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Metamathematics of constructive systems (03F50) Intuitionistic mathematics (03F55) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• Functional interpretations of feasibly constructive arithmetic
• scientific article; zbMATH DE number 3941526
• scientific article; zbMATH DE number 176201
• Constructibility in higher order arithmetics
• On arithmetic complexity of some constructive logics
• On arithmetic complexity of certain constructive logics
• On certain questions of nonstandard arithmetic
• On explicit definability in arithmetic
• scientific article; zbMATH DE number 2123378
• scientific article; zbMATH DE number 956480

Cited in

(2)

• A semantic construction of two-ary integers
• Provably recursive functions of constructive and relatively constructive theories

This page was built for publication: On two questions about feasibly constructive arithmetic

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