{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:17:57Z","timestamp":1725664677164},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540630456"},{"type":"electronic","value":"9783540690658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63045-7_19","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:59:47Z","timestamp":1330279187000},"page":"178-188","source":"Crossref","is-referenced-by-count":1,"title":["On linear ordering of strongly extensional finitely-branching graphs and non-well-founded sets"],"prefix":"10.1007","author":[{"given":"Alexei","family":"Lisitsa","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Sazonov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"19_CR1","unstructured":"Aczel, P.: Non-Well-Founded Sets. CSLI Lecture Notes, No. 14, 1988"},{"key":"19_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible Sets and Structures","author":"J.K. Barwise","year":"1975","unstructured":"Barwise, J.K.: Admissible Sets and Structures. Springer, Berlin, 1975"},{"key":"19_CR3","unstructured":"Barwise, J.K., Moss, L.: Vicious Circles: on the mathematics of circular phenomena. CSLI Lecture Notes, 1996"},{"issue":"No.2","key":"19_CR4","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1006\/inco.1995.1084","volume":"119","author":"A. Dawar","year":"1995","unstructured":"Dawar, A., Lindell, S., Weinstein S.: Infinitary Logic and Inductive Definability over Finite Structures. Information and Computation, 119, No. 2 (1995) 160\u2013175","journal-title":"Information and Computation"},{"key":"19_CR5","unstructured":"Fernando, T.: 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":"19_CR6","unstructured":"Fernando, R.T.P.: On Substitutional Recursion over Non-Well-Founded Sets. LICS'89 (1989) 273\u2013282"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Gurevich, Y.: Algebras of feasible functions. Proc. 24th IEEE Conf. on Foundations of Computer Science (1983) 210\u2013214","DOI":"10.1109\/SFCS.1983.5"},{"key":"19_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","volume":"32","author":"Y. Gurevich","year":"1986","unstructured":"Gurevich, Y., Shelah, S.: Fixed-point extensions of first-order logic. Annals of Pure and Applied Logic 32 (1986) 265\u2013280","journal-title":"Annals of Pure and Applied Logic"},{"key":"19_CR9","first-page":"111","volume":"51","author":"I. Hodkinson","year":"1993","unstructured":"Hodkinson, I.: Finite variable logics. Bulletin of the EATCS, 51 (1993) 111\u2013140","journal-title":"Bulletin of the EATCS"},{"key":"19_CR10","unstructured":"Immerman, N.: Relational queries computable in polynomial time. Proccedings of 14th ACM Symposium on Theory of Computation, (1982) 147\u2013152"},{"key":"19_CR11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N. Immerman","year":"1986","unstructured":"Immerman, N.: Relational queries computable in polynomial time. Information and Control 68 (1986) 86\u2013104","journal-title":"Information and Control"},{"key":"19_CR12","unstructured":"Livchak, A.B.: Languages of polynomial queries. Raschet i optimizacija teplotehnicheskih ob'ektov s pomosh'ju EVM, Sverdlovsk, 1982, p. 41 (in Russian)"},{"key":"19_CR13","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/0890-5401(91)90051-3","volume":"93","author":"M. Mislove","year":"1991","unstructured":"Mislove, M., Moss L., Oles, F.: Non-Well-Founded Sets Modeled as Ideal Fixed Points. Information and Computation, bf 93 (1991) 16\u201354","journal-title":"Information and Computation"},{"key":"19_CR14","volume-title":"Elementary Induction on Abstract Structures","author":"Y.N. Moschovakis","year":"1974","unstructured":"Moschovakis, Y.N.: Elementary Induction on Abstract Structures. Amsterdam, North-Holland, 1974."},{"issue":"N7","key":"19_CR15","first-page":"319","volume":"16","author":"V. Sazonov","year":"1980","unstructured":"Sazonov, V.Yu.: Polynomial computability and recursivity in finite domains. Elektronische Informationsverarbeitung und Kybernetik. 16, N7 (1980) 319\u2013323","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"19_CR16","first-page":"110","volume":"122","author":"V. Sazonov","year":"1987","unstructured":"Sazonov, V.Yu.: Bounded set theory, polynomial computability and \u03b4-programming. Application aspects of mathematical logic. Computing systems 122 (1987) 110\u2013132 (In Russian) Cf. also a short English version of this paper in: Lect. Not. Comput. Sci. 278 Springer (1987) 391\u2013397","journal-title":"Computing systems"},{"issue":"No.3","key":"19_CR17","first-page":"1141","volume":"56","author":"V. Sazonov","year":"1991","unstructured":"Sazonov, V.Yu.: Bounded set theory and inductive definability. Abstracts of Logic Colloquium'90. JSL 56 No.3 (1991) 1141\u20131142","journal-title":"JSL"},{"key":"19_CR18","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/0304-3975(93)90345-T","volume":"119","author":"V.Yu. Sazonov","year":"1993","unstructured":"Sazonov, V.Yu.: Hereditarily-finite sets, data bases and polynomial-time computability. TCS 119 Elsevier (1993) 187\u2013214","journal-title":"TCS"},{"key":"19_CR19","first-page":"527","volume-title":"Lecture Notes in Computer Science 933","author":"V. Sazonov","year":"1995","unstructured":"Sazonov, V.Yu.: A bounded set theory with anti-foundation axiom and inductive definability. Computer Science Logic, 8th Workshop, CSL'94 Kazimierz, Poland, September 1994, Selected Papers. Lecture Notes in Computer Science 933 Springer (1995) 527\u2013541."},{"key":"19_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-94-017-0487-8_5","volume-title":"Logic and Scientific Methods","author":"V. Sazonov","year":"1997","unstructured":"Sazonov, V.Yu.: On Bounded Set Theory (Invited talk). M.L. Dalla Chiara, et al. (eds.), Logic and Scientific Methods, Volume One of the Tenth International Congress of Logic, Methodology and Philosophy of Sciences, Florence, August 1995, Kluwer Academic Publishers, Dordrecht, 1997, 85\u2013103."},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science 893","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/3-540-58907-4_11","volume-title":"Proceedings","author":"V. Sazonov","year":"1995","unstructured":"Sazonov, V.Yu., Lisitsa, A.P.: \u03b4-languages for sets and sub-PTIME graph transformers. Database Theory \u2014 ICDT'95, 5th International Conference, Prague, Czech Republic, January 1995, Proceedings. Lecture Notes in Computer Science 893 Springer (1995) 125\u2013138"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Lisitsa, A.P., Sazonov, V.Yu.: \u03b4-languages for sets and LOGSPACE-computable graph transformers, Theoretical Computer Science, tentatively in Vol. 175, 1997","DOI":"10.1016\/S0304-3975(96)00174-0"},{"key":"19_CR23","unstructured":"Vardi, M.: Complexity of relational query languages. Proceedings of 14th Symposium on Theory of Computation (1982) 137\u2013146"}],"container-title":["Lecture Notes in Computer Science","Logical Foundations of Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63045-7_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:15:13Z","timestamp":1605629713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63045-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540630456","9783540690658"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-63045-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}