{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T06:05:38Z","timestamp":1747548338765,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540600176"},{"type":"electronic","value":"9783540494041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/bfb0022280","type":"book-chapter","created":{"date-parts":[[2005,11,22]],"date-time":"2005-11-22T06:12:29Z","timestamp":1132639949000},"page":"527-541","source":"Crossref","is-referenced-by-count":4,"title":["A bounded set theory with Anti-Foundation Axiom and inductive definability"],"prefix":"10.1007","author":[{"given":"Vladimir Yu.","family":"Sazonov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"key":"38_CR1","unstructured":"P.Aczel, Non-well-founded sets, CSLI LN N14, Stanford, 1988."},{"key":"38_CR2","volume-title":"Handbook of Math. Logic","author":"P. Aczel","year":"1977","unstructured":"P.Aczel, Introduction to the theory of inductive definitions, in: Handbook of Math. Logic, J.Barwise ed., North-Holland, Amsterdam, 1977."},{"key":"38_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-11035-5","volume-title":"Admissible sets and structures","author":"J. Barwise","year":"1975","unstructured":"J.Barwise, Admissible sets and structures. Berlin, Springer, 1975"},{"key":"38_CR4","unstructured":"G.J\u00e4ger. Theories for admissible sets. A unifying approach to proof theory, Studies in Proof Theory, Lecture Notes 2, Bibliopolis, 1986."},{"key":"38_CR5","first-page":"303","volume-title":"Intuitionism and Proof Theory","author":"S. Feferman","year":"1970","unstructured":"S.Feferman, Formal theories for transfinite iterations of generalized inductive definitions and some subsystems of analysis, In: Intuitionism and Proof Theory, eds. A.Kino, et al., Amsterdam, North-Holland, 1970, 303\u2013326."},{"key":"38_CR6","unstructured":"T.Fernando, A Primitive recursive set theory and AFA: on the logical complexity of the largest bisimulation, Report CS-R9213 ISSN 0169-118XCWI P.O.Box 4079, 1009 AB Amsterdam. The Netherlands."},{"key":"38_CR7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1090\/pspum\/013.2\/0376348","volume":"13","author":"R.O. Gandy","year":"1974","unstructured":"R.O.Gandy, Set-theoretic functions for elementary syntax, in: Proc. in Pure Math., Vol 13, Part II (1974) 103\u2013126.","journal-title":"Proc. in Pure Math."},{"key":"38_CR8","doi-asserted-by":"crossref","unstructured":"Y.Gurevich, Algebras of feasible functions, in: FOCS'83 (1983) 210\u2013214.","DOI":"10.1109\/SFCS.1983.5"},{"key":"38_CR9","first-page":"175","volume-title":"LNM 1104","author":"Y. Gurevich","year":"1984","unstructured":"Y.Gurevich, Towards logic tailored for computational complexity, in: LNM 1104, Springer, Berlin (1984) 175\u2013216."},{"key":"38_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0168-0072(86)90055-2","volume":"32","author":"Y. Gurevich","year":"1986","unstructured":"Y.Gurevich and S.Shelah, Fixed point extensions of first-order logic, Ann. Pure Appl. Logic 32 (1986) 265\u2013280.","journal-title":"Ann. Pure Appl. Logic"},{"key":"38_CR11","doi-asserted-by":"crossref","unstructured":"N.Immerman, Relational queries computable in polynomial time, in: 14th. STOC (1982) 147\u2013152; cf. Inform. and Control 68 (1986) 86\u2013104.","DOI":"10.1016\/S0019-9958(86)80029-8"},{"key":"38_CR12","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0003-4843(72)90001-0","volume":"4","author":"R.B. Jensen","year":"1972","unstructured":"R.B. Jensen, The fine structure of the constructible hierarchy, Ann.Math. Logic 4 (1972) 229\u2013308.","journal-title":"Ann.Math. Logic"},{"key":"38_CR13","unstructured":"A.B.Livchak, Languages of polynomial queries, in: Raschet i optimizacija teplotehnicheskih ob'ektov s pomosh'ju EVM, Sverdlovsk, 1982, 41 (in Russian)."},{"key":"38_CR14","volume-title":"Elementary Induction on Abstract Structures","author":"Y.N. Moschovakis","year":"1974","unstructured":"Y.N. Moschovakis, Elementary Induction on Abstract Structures, Amsterdam, North-Holland, 1974."},{"key":"38_CR15","volume-title":"Introduction to Mathematical Logic","author":"E. Mendelson","year":"1964","unstructured":"E.Mendelson Introduction to Mathematical Logic, D. Van Nostrand, Princeton, 1964."},{"issue":"N7","key":"38_CR16","first-page":"319","volume":"16","author":"V. Sazonov","year":"1980","unstructured":"V.Yu.Sazonov, Polynomial computability and recursivity in finite domains. EIK, 16, N7 (1980) 319\u2013323.","journal-title":"EIK"},{"key":"38_CR17","unstructured":"V.Yu.Sazonov, Bounded set theory and polynomial computability. Conf. on Applied Logic, Novosibirsk, 1985, 188\u2013191. (In Russian)"},{"key":"38_CR18","first-page":"30","volume":"107","author":"V. Sazonov","year":"1985","unstructured":"V.Yu.Sazonov, Collection principle and existetial quantifier. (In Russian) Vychislitel'nye sistemy 107 (1985) Novosibirsk, 30\u201339.) (Cf. English translation in AMS Transi. (2) 142 (1989) 1\u20138.)","journal-title":"Vychislitel'nye sistemy"},{"key":"38_CR19","first-page":"110","volume":"122","author":"V. Sazonov","year":"1987","unstructured":"V.Yu.Sazonov, Bounded set theory, polynomial computability and \u0394-programming, Vychislitel'nye sistemy 122 (1987) Novosibirsk, 110\u2013132 (in Russian). Cf. also LNCS 278 (1987) 391\u2013397 (in English).","journal-title":"Vychislitel'nye sistemy"},{"issue":"Nu.3","key":"38_CR20","first-page":"1141","volume":"56","author":"V. Sazonov","year":"1991","unstructured":"V.Yu.Sazonov, Bounded Set Theory and Inductive Definability, Logic Colloquium'90, JSL, 56, Nu.3 (1991) 1141\u20131142.","journal-title":"Logic Colloquium'90, JSL"},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"V.Yu.Sazonov, Hereditarily-finite sets, data bases and polynomial-time computability, TCS 119 (1993) 187\u2013214, Elsevier.","DOI":"10.1016\/0304-3975(93)90345-T"},{"key":"38_CR22","doi-asserted-by":"crossref","unstructured":"M.Y.Vardi, The complexity of relational query languages, STOC'82, 137\u2013146.","DOI":"10.1145\/800070.802186"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0022280","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:56:42Z","timestamp":1736107002000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022280"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540600176","9783540494041"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/bfb0022280","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}