Switch to: References

Citations of:

Delineating classes of computational complexity via second order theories with weak set existence principles. I

Aleksandar Ignjatović

Journal of Symbolic Logic 60 (1):103-121 (1995)

Add citations

You must login to add citations.

Delineating classes of computational complexity via second order theories with weak set existence principles. I.Aleksandar Ignjatović - 1995 - Journal of Symbolic Logic 60 (1):103-121.details Aleksandar Ignjatović. Delineating Classes of Computational Complexity via Second Order Theories with Weak Set Existence Principles (I). Computational Complexity in Philosophy of Computing and Information Logic and Philosophy of Logic Direct download (13 more) Export citation Bookmark 2 citations
Unprovability of consistency statements in fragments of bounded arithmetic.Samuel R. Buss & Aleksandar Ignjatović - 1995 - Annals of Pure and Applied Logic 74 (3):221-244.details Samuel R. Buss and Aleksandar Ignjatović. Unprovability of Consistency Statements in Fragments of Bounded Arithmetic. Logic and Philosophy of Logic Logic and Philosophy of Logic, Miscellaneous in Logic and Philosophy of Logic Proof Theory in Logic and Philosophy of Logic Direct download (9 more) Export citation Bookmark 8 citations

1