{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T12:07:54Z","timestamp":1769602074633,"version":"3.49.0"},"reference-count":39,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":5099,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1999,8]]},"DOI":"10.1016\/s0304-3975(98)00312-0","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"173-213","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":18,"title":["Linear ordering on graphs, anti-founded sets and polynomial time computability"],"prefix":"10.1016","volume":"224","author":[{"given":"Alexei","family":"Lisitsa","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Sazonov","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(98)00312-0_BIB1","series-title":"Proc. 23th ACM Symp. on the Theory of Computing","first-page":"209","article-title":"Generic computations and its complexity","author":"Abiteboul","year":"1991"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB2","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1006\/jcss.1995.1025","article-title":"Computing with first-order logic","volume":"50","author":"Abiteboul","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(98)00312-0_BIB3","series-title":"Database Theory \u2014 ICDT'97, 6th Internat. Conf.","first-page":"262","article-title":"Queries and computation on the web","volume":"vol. 1186","author":"Abiteboul","year":"1997"},{"issue":"No. 14","key":"10.1016\/S0304-3975(98)00312-0_BIB4","article-title":"Non-Well-Founded Sets","author":"Aczel","year":"1988","journal-title":"CSLI Lecture Notes"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB5","series-title":"Admissible Sets and Structures","author":"Barwise","year":"1975"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB6","article-title":"Vicious Circles: On the Mathematics of Circular Phenomena","author":"Barwise","year":"1996","journal-title":"CSLI Lecture Notes"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB7","unstructured":"J. Van Benthem, A. Montanari, G. D'Agostino, A. Policriti, Modal deduction in second-order logic and set theory \u2014 II, ILLC Research Report ML-1996-08."},{"key":"10.1016\/S0304-3975(98)00312-0_BIB8","series-title":"Proc. SIGMOD","article-title":"A query language and optimization techniques for unstructured data","author":"Buneman","year":"1996"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB9","unstructured":"A. Cobham, The intrinsic computational difficulty of function, in: Y. Bar-Hillel (Ed.), Logic, Methodology and Philosophy of Science II, North-Holland, Jerusalem, pp. 24\u201330."},{"key":"10.1016\/S0304-3975(98)00312-0_BIB10","series-title":"CSL'87","first-page":"56","article-title":"Is SETL a suitable language for parallel programming? \u2014 a theoretical approach","volume":"vol. 329","author":"Dahlhaus","year":"1987"},{"issue":"2","key":"10.1016\/S0304-3975(98)00312-0_BIB11","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1006\/inco.1995.1084","article-title":"Infinitary logic and inductive definability over finite structures","volume":"119","author":"Dawar","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00312-0_BIB12","unstructured":"T. Fernando, A primitive recursive set theory and AFA: on logical complexity of the largest bisimulation, Report CS-R9213 ISSN 0169-118XCWI P.O.Box 4079, 1009 AB Amsterdam, Netherlands."},{"key":"10.1016\/S0304-3975(98)00312-0_BIB13","series-title":"LICS'89","first-page":"273","article-title":"On substitutional recursion over non-well-founded sets","author":"Fernando","year":"1989"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB14","series-title":"Proc. 24th IEEE Conf. on Foundations of Computer Science","first-page":"210","article-title":"Algebras of feasible functions","author":"Gurevich","year":"1983"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB15","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","article-title":"Fixed-point extensions of first-order logic","volume":"32","author":"Gurevich","year":"1986","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB16","first-page":"111","article-title":"Finite variable logics","volume":"51","author":"Hodkinson","year":"1993","journal-title":"Bull. EATCS"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB17","series-title":"Proc. 14th ACM Symp. on Theory of Computation","first-page":"147","article-title":"Relational queries computable in polynomial time","author":"Immerman","year":"1982"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB18","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. Control"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB19","series-title":"Technical Report MS-CIS-95-20","article-title":"Observational properties of databases with object identity","author":"Kosky","year":"1995"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB20","series-title":"Set Theory","author":"Kuratovski","year":"1967"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB21","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0304-3975(96)00174-0","article-title":"\u0394-languages for sets and LOGSPACE-computable graph transformers","volume":"175","author":"Lisitsa","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(98)00312-0_BIB22","series-title":"Logical Foundations of Computer Science, 4th Internat. Symp., LFCS'97","first-page":"178","article-title":"On linear Ordering of Strongly Extensional Finitely-Branching Graphs and Non-well-founded Sets","volume":"vol. 1234","author":"Lisitsa","year":"1997"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB23","series-title":"Computational Logic and Proof Theory, 5th Kurt G\u00f6del Colloquium, KGC'97","first-page":"172","article-title":"Bounded hyperset theory and web-like data bases","volume":"vol. 1289","author":"Lisitsa","year":"1997"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB24","series-title":"Raschet i optimizacija teplotehnicheskih ob'ektov s pomosh'ju EVM","first-page":"41","article-title":"Languages of polynomial queries","author":"Livchak","year":"1982"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB25","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/0890-5401(91)90051-3","article-title":"Non-well-founded sets modeled as ideal fixed points","volume":"93","author":"Mislove","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(98)00312-0_BIB26","series-title":"Elementary Induction on Abstract Structures","author":"Moschovakis","year":"1974"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB27","series-title":"Logical Foundations of Computer Science, 4th Internat. Symp., LFCS'97","first-page":"294","article-title":"Capturing bisimulation-invariant PTIME","volume":"vol. 1234","author":"Otto","year":"1997"},{"issue":"7","key":"10.1016\/S0304-3975(98)00312-0_BIB28","first-page":"319","article-title":"Polynomial computability and recursivity in finite domains","volume":"16","author":"Sazonov","year":"1980","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"issue":"2","key":"10.1016\/S0304-3975(98)00312-0_BIB29_1","first-page":"1","article-title":"Collection principle and existential quantifier","volume":"142","author":"Sazonov","year":"1989","journal-title":"Amer. Math. Soc. Transl."},{"key":"10.1016\/S0304-3975(98)00312-0_BIB29_2","first-page":"30","article-title":"Logiko-matematicheskie problemy MOZ","author":"Sazonov","year":"1985","journal-title":"Vychislitel'nye sistemy N107"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB30","series-title":"All-Union Conf. on Applied Logic","first-page":"188","article-title":"Bounded set theory and polynomial computability","author":"Sazonov","year":"1985"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB31_1","series-title":"Application Aspects of Mathematical Logic","first-page":"110","article-title":"Bounded set theory, polynomial computability and \u0394-programming","volume":"vol. 122","author":"Sazonov","year":"1987"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB31_2","first-page":"391","volume":"vol. 278","author":"Sazonov","year":"1987"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB32","series-title":"Abstracts of Logic Colloquium'90","first-page":"1141","article-title":"Bounded set theory and inductive definability","volume":"56","author":"Sazonov","year":"1991"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB33","series-title":"TCS 119","first-page":"187","article-title":"Hereditarily-finite sets, data bases and polynomial-time computability","author":"Sazonov","year":"1993"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB34","series-title":"Computer Science Logic, 8th Workshop, CSL'94","first-page":"527","article-title":"A bounded set theory with anti-foundation axiom and inductive definability","volume":"vol. 933","author":"Sazonov","year":"1995"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB35","series-title":"Logic and Scientific Methods, 10th Internat. Congress of Logic","first-page":"85","article-title":"On bounded set theory (invited talk)","volume":"vol. 1","author":"Sazonov","year":"1997"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB36","series-title":"Database Theory \u2014 ICDT'95, 5th Internat. Conf.","first-page":"125","article-title":"\u0394-languages for sets and sub-PTIME graph transformers","volume":"vol. 893","author":"Sazonov","year":"1995"},{"key":"10.1016\/S0304-3975(98)00312-0_BIB37","series-title":"Proc. 14th Symp. on Theory of Computation","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003120?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397598003120?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:51:52Z","timestamp":1759625512000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397598003120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["S0304397598003120"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(98)00312-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Linear ordering on graphs, anti-founded sets and polynomial time computability","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(98)00312-0","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1999 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}