{"id":"https://openalex.org/W2155681304","doi":"https://doi.org/10.2307/2275511","title":"Delineating classes of computational complexity via second order theories with weak set existence principles. I","display_name":"Delineating classes of computational complexity via second order theories with weak set existence principles. I","publication_year":1995,"publication_date":"1995-03-01","ids":{"openalex":"https://openalex.org/W2155681304","doi":"https://doi.org/10.2307/2275511","mag":"2155681304"},"language":"en","primary_location":{"id":"doi:10.2307/2275511","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2275511","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5053935948","display_name":"Aleksandar Ignjatovi\u0107","orcid":"https://orcid.org/0000-0002-1723-7886"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aleksandar Ignjatovi\u0107","raw_affiliation_strings":["Department of Philosophy, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213, E-mail:","Carnegie Mellon University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Philosophy, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213, E-mail:","institution_ids":["https://openalex.org/I74973139"]},{"raw_affiliation_string":"Carnegie Mellon University","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5053935948"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":0.5272,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69040429,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"60","issue":"1","first_page":"103","last_page":"121"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9925000071525574,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9821000099182129,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11151","display_name":"Advanced Topology and Set Theory","score":0.9397000074386597,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7375618815422058},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6422234773635864},{"id":"https://openalex.org/keywords/axiom","display_name":"Axiom","score":0.6419696807861328},{"id":"https://openalex.org/keywords/interpretability","display_name":"Interpretability","score":0.5487781167030334},{"id":"https://openalex.org/keywords/ph","display_name":"PH","score":0.5330554246902466},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.52799391746521},{"id":"https://openalex.org/keywords/polynomial-hierarchy","display_name":"Polynomial hierarchy","score":0.5239391922950745},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.506433367729187},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.49933648109436035},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4807848334312439},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.4617045521736145},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.46118977665901184},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4479654133319855},{"id":"https://openalex.org/keywords/second-order-arithmetic","display_name":"Second-order arithmetic","score":0.44649967551231384},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.4327487349510193},{"id":"https://openalex.org/keywords/second-order-logic","display_name":"Second-order logic","score":0.42814281582832336},{"id":"https://openalex.org/keywords/reverse-mathematics","display_name":"Reverse mathematics","score":0.42471325397491455},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.36112844944000244},{"id":"https://openalex.org/keywords/quantum-complexity-theory","display_name":"Quantum complexity theory","score":0.3292122781276703},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.31935372948646545},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3121359348297119},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23754793405532837},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.1950508952140808},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1779492199420929},{"id":"https://openalex.org/keywords/peano-axioms","display_name":"Peano axioms","score":0.13529545068740845},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.09242311120033264},{"id":"https://openalex.org/keywords/higher-order-logic","display_name":"Higher-order logic","score":0.07704132795333862},{"id":"https://openalex.org/keywords/description-logic","display_name":"Description logic","score":0.07656583189964294}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7375618815422058},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6422234773635864},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.6419696807861328},{"id":"https://openalex.org/C2781067378","wikidata":"https://www.wikidata.org/wiki/Q17027399","display_name":"Interpretability","level":2,"score":0.5487781167030334},{"id":"https://openalex.org/C122806257","wikidata":"https://www.wikidata.org/wiki/Q1063380","display_name":"PH","level":5,"score":0.5330554246902466},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.52799391746521},{"id":"https://openalex.org/C2776013622","wikidata":"https://www.wikidata.org/wiki/Q2103021","display_name":"Polynomial hierarchy","level":3,"score":0.5239391922950745},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.506433367729187},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.49933648109436035},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4807848334312439},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.4617045521736145},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.46118977665901184},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4479654133319855},{"id":"https://openalex.org/C65148605","wikidata":"https://www.wikidata.org/wiki/Q7442973","display_name":"Second-order arithmetic","level":3,"score":0.44649967551231384},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.4327487349510193},{"id":"https://openalex.org/C144791301","wikidata":"https://www.wikidata.org/wiki/Q1548746","display_name":"Second-order logic","level":4,"score":0.42814281582832336},{"id":"https://openalex.org/C127753061","wikidata":"https://www.wikidata.org/wiki/Q2005236","display_name":"Reverse mathematics","level":3,"score":0.42471325397491455},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.36112844944000244},{"id":"https://openalex.org/C92043244","wikidata":"https://www.wikidata.org/wiki/Q7269023","display_name":"Quantum complexity theory","level":4,"score":0.3292122781276703},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31935372948646545},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3121359348297119},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23754793405532837},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.1950508952140808},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1779492199420929},{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.13529545068740845},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.09242311120033264},{"id":"https://openalex.org/C169896238","wikidata":"https://www.wikidata.org/wiki/Q1644136","display_name":"Higher-order logic","level":3,"score":0.07704132795333862},{"id":"https://openalex.org/C102993220","wikidata":"https://www.wikidata.org/wiki/Q387196","display_name":"Description logic","level":2,"score":0.07656583189964294},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.2307/2275511","is_oa":false,"landing_page_url":"https://doi.org/10.2307/2275511","pdf_url":null,"source":{"id":"https://openalex.org/S177675236","display_name":"Journal of Symbolic Logic","issn_l":"0022-4812","issn":["0022-4812","1943-5886"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Symbolic Logic","raw_type":"journal-article"},{"id":"pmh:doi:10.1184/r1/6491360","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Journal contribution"},{"id":"pmh:oai:CULeuclid:euclid.jsl/1183744680","is_oa":false,"landing_page_url":"http://projecteuclid.org/euclid.jsl/1183744680","pdf_url":null,"source":{"id":"https://openalex.org/S4306400787","display_name":"Project Euclid (Cornell University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W77620528","https://openalex.org/W1026831770","https://openalex.org/W1572451808","https://openalex.org/W2069301430","https://openalex.org/W2071977753","https://openalex.org/W2091961944","https://openalex.org/W2913066057","https://openalex.org/W4243693638","https://openalex.org/W4251260938"],"related_works":["https://openalex.org/W2047754121","https://openalex.org/W342214647","https://openalex.org/W2374430960","https://openalex.org/W4294266235","https://openalex.org/W2327776271","https://openalex.org/W2072410898","https://openalex.org/W2029183607","https://openalex.org/W2035152936","https://openalex.org/W2041069649","https://openalex.org/W2155681304"],"abstract_inverted_index":{"Abstract":[0],"In":[1],"this":[2],"paper":[3],"we":[4],"characterize":[5],"the":[6,12,55,78,82,96],"well-known":[7],"computational":[8],"complexity":[9,80],"classes":[10,17],"of":[11,18,24,28,57,81,98],"polynomial":[13],"time":[14],"hierarchy":[15],"as":[16],"provably":[19],"recursive":[20],"functions":[21],"(with":[22],"graphs":[23],"suitable":[25],"bounded":[26,58,79,99],"complexity)":[27],"some":[29],"second":[30],"order":[31],"theories":[32,53,56,97],"with":[33],"weak":[34],"comprehension":[35],"axiom":[36],"schemas":[37,42],"but":[38],"without":[39,76],"any":[40],"induction":[41,75,83],"(Theorem":[43,101],"6).":[44],"We":[45],"also":[46,88],"find":[47],"a":[48,67],"natural":[49],"relationship":[50],"between":[51],"our":[52],"and":[54,62],"arithmetic":[59,100],"(Lemmas":[60],"4":[61],"5).":[63],"Our":[64],"proofs":[65],"use":[66],"technique":[68,86],"which":[69],"enables":[70],"us":[71],"to":[72,90],"\u201cspeed":[73],"up\u201d":[74],"increasing":[77],"formulas.":[84],"This":[85],"is":[87],"used":[89],"obtain":[91],"an":[92],"interpretability":[93],"result":[94],"for":[95],"4).":[102]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}