scientific article; zbMATH DE number 1567841

MaRDI QIDQ4761670zbMATH OpenFDO

Authors Valery Plisko

Publication date 21 February 2001

Full work available at URL http://mech.math.msu.su/~fpm/eng/99/991/99113h.htm

zbMATH Keywords

arithmetic hierarchyarithmetic theoryconstructive logicpartial truth definition

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Intuitionistic mathematics (03F55)

Recommendations

• Arithmetic complexity of the predicate logics of certain complete arithmetic theories
• Predicate Logics of Constructive Arithmetical Theories
• On arithmetic complexity of some constructive logics
• scientific article; zbMATH DE number 4010488
• scientific article; zbMATH DE number 4087630

Cited in

(15)

• Nonaxiomatizability of predicate logics of proofs
• On strictly arithmetical completeness in logics of programs
• A survey of predicate realizability logic
• Challenges to predicative foundations of arithmetic
• scientific article; zbMATH DE number 4174914 (Why is no real title available?)
• On arithmetic complexity of some constructive logics
• Predicate Logics of Constructive Arithmetical Theories
• Transfinite sequences of constructive predicate logics
• scientific article; zbMATH DE number 4010488 (Why is no real title available?)
• scientific article; zbMATH DE number 1099367 (Why is no real title available?)
• Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND
• scientific article; zbMATH DE number 7155168 (Why is no real title available?)
• Predicate logics of constructive mathematical theories
• Arithmetic complexity of the predicate logics of certain complete arithmetic theories
• Computational complexity of logical theories of one successor and another unary function

This page was built for publication:

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