On arithmetic complexity of some constructive logics
From MaRDI portal
Recommendations
Cited in
(13)- Comparing Constructive Arithmetical Theories Based on NP-PIND and coNP-PIND
- scientific article; zbMATH DE number 1567841 (Why is no real title available?)
- Rules and arithmetics
- scientific article; zbMATH DE number 7155168 (Why is no real title available?)
- scientific article; zbMATH DE number 4010488 (Why is no real title available?)
- Arithmetic complexity of first-order definable subsets of recursive Boolean algebras
- Computational complexity of logical theories of one successor and another unary function
- A survey of predicate realizability logic
- On two questions about feasibly constructive arithmetic
- Predicate logics of constructive mathematical theories
- scientific article; zbMATH DE number 5267925 (Why is no real title available?)
- Predicate logics of expressively strong theories
- Arithmetic complexity of the predicate logics of certain complete arithmetic theories
This page was built for publication: On arithmetic complexity of some constructive logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3362716)
