Last update: Thu Sep 27 02:46:39 MDT 2018
@Article{Pudlak:1979:CMH,
author = "P. Pudlak and F. N. Springsteel",
title = "Complexity in mechanized hypothesis formation",
journal = j-THEOR-COMP-SCI,
volume = "8",
number = "2",
pages = "203--225",
month = apr,
year = "1979",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:36:07 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1975.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic)",
corpsource = "Math. Inst., Czechoslovak Acad. of Sci., Prague,
Czechoslovakia",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithmic complexity; computability; computability
and decidability; computational complexity; formal
logic; GUHA; mechanized hypothesis formation; sampled
data",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}