A bounded set theory with Anti-Foundation Axiom and inductive definability

  • Vladimir Yu. Sazonov
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 933)


Proof Theory Predicate Variable Pointed Graph Inductive Definition Foundation Axiom 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Acz88]
    P.Aczel, Non-well-founded sets, CSLI LN N14, Stanford, 1988.Google Scholar
  2. [Acz77]
    P.Aczel, Introduction to the theory of inductive definitions, in: Handbook of Math. Logic, J.Barwise ed., North-Holland, Amsterdam, 1977.Google Scholar
  3. [Bar75]
    J.Barwise, Admissible sets and structures. Berlin, Springer, 1975Google Scholar
  4. [Jäg86]
    G.Jäger. Theories for admissible sets. A unifying approach to proof theory, Studies in Proof Theory, Lecture Notes 2, Bibliopolis, 1986.Google Scholar
  5. [Fef70]
    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–326.Google Scholar
  6. [Fer]
    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.Google Scholar
  7. [Gan74]
    R.O.Gandy, Set-theoretic functions for elementary syntax, in: Proc. in Pure Math., Vol 13, Part II (1974) 103–126.Google Scholar
  8. [Gur83]
    Y.Gurevich, Algebras of feasible functions, in: FOCS'83 (1983) 210–214.Google Scholar
  9. [Gur84]
    Y.Gurevich, Towards logic tailored for computational complexity, in: LNM 1104, Springer, Berlin (1984) 175–216.Google Scholar
  10. [GS86]
    Y.Gurevich and S.Shelah, Fixed point extensions of first-order logic, Ann. Pure Appl. Logic 32 (1986) 265–280.CrossRefGoogle Scholar
  11. [Imm82]
    N.Immerman, Relational queries computable in polynomial time, in: 14th. STOC (1982) 147–152; cf. Inform. and Control 68 (1986) 86–104.Google Scholar
  12. [Jen72]
    R.B. Jensen, The fine structure of the constructible hierarchy, Ann.Math. Logic 4 (1972) 229–308.CrossRefGoogle Scholar
  13. [Liv82]
    A.B.Livchak, Languages of polynomial queries, in: Raschet i optimizacija teplotehnicheskih ob'ektov s pomosh'ju EVM, Sverdlovsk, 1982, 41 (in Russian).Google Scholar
  14. [Mos74]
    Y.N. Moschovakis, Elementary Induction on Abstract Structures, Amsterdam, North-Holland, 1974.Google Scholar
  15. [Men64]
    E.Mendelson Introduction to Mathematical Logic, D. Van Nostrand, Princeton, 1964.Google Scholar
  16. [Saz80]
    V.Yu.Sazonov, Polynomial computability and recursivity in finite domains. EIK, 16, N7 (1980) 319–323.Google Scholar
  17. [Saz85]
    V.Yu.Sazonov, Bounded set theory and polynomial computability. Conf. on Applied Logic, Novosibirsk, 1985, 188–191. (In Russian)Google Scholar
  18. [Saz85a]
    V.Yu.Sazonov, Collection principle and existetial quantifier. (In Russian) Vychislitel'nye sistemy 107 (1985) Novosibirsk, 30–39.) (Cf. English translation in AMS Transi. (2) 142 (1989) 1–8.)Google Scholar
  19. [Saz87]
    V.Yu.Sazonov, Bounded set theory, polynomial computability and Δ-programming, Vychislitel'nye sistemy 122 (1987) Novosibirsk, 110–132 (in Russian). Cf. also LNCS 278 (1987) 391–397 (in English).Google Scholar
  20. [Saz91]
    V.Yu.Sazonov, Bounded Set Theory and Inductive Definability, Logic Colloquium'90, JSL, 56, Nu.3 (1991) 1141–1142.Google Scholar
  21. [Saz93]
    V.Yu.Sazonov, Hereditarily-finite sets, data bases and polynomial-time computability, TCS 119 (1993) 187–214, Elsevier.Google Scholar
  22. [Var82]
    M.Y.Vardi, The complexity of relational query languages, STOC'82, 137–146.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Vladimir Yu. Sazonov
    • 1
  1. 1.Program Systems InstitutePereslavl-ZalesskyRussia

Personalised recommendations