References in:

Unprovability of consistency statements in fragments of bounded arithmetic

Annals of Pure and Applied Logic 74 (3):221-244 (1995)

You must login to add references.

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). Download Export citation Bookmark 2 citations

Applied ethics	Epistemology	History of Western Philosophy	Meta-ethics	Metaphysics	Normative ethics
Philosophy of biology	Philosophy of language	Philosophy of mind	Philosophy of religion	Science Logic and Mathematics	More ...