Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Sazonov:1993:HFS,
author = "Vladimir Yu Sazonov",
title = "Hereditarily-finite sets, data bases and
polynomial-time computability",
journal = j-THEOR-COMP-SCI,
volume = "119",
number = "1",
pages = "187--214",
day = "11",
month = oct,
year = "1993",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Mon Jul 19 22:17:36 MDT 1999",
bibsource = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_free/browse/browse.cgi?year=1993&volume=119&issue=1;
http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
URL = "http://www.elsevier.com/cgi-bin/cas/tree/store/tcs/cas_sub/browse/browse.cgi?year=1993&volume=119&issue=1&aid=1449",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory); C6160D (Relational DBMS)",
conflocation = "Grenoble, France; Oct. 1991",
conftitle = "5th Soviet-French Symposium on Theoretical Computer
Science, Methods and Tools for Compilation, and Program
Development (Informatika'91)",
corpsource = "Comput. Logic Lab., Acad. of Sci., Pereslavl-Zalessky,
Russia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "attributes; computability; computational complexity;
data bases; hereditarily-finite sets; polynomial-time
computability; relational databases; resource bounded",
pubcountry = "Netherlands",
treatment = "P Practical; T Theoretical or Mathematical",
}