Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Tiuryn:1988:SRB,
author = "J. Tiuryn and P. Urzyczyn",
title = "Some relationships between logics of programs and
complexity theory",
journal = j-THEOR-COMP-SCI,
volume = "60",
number = "1",
pages = "83--108",
month = mar,
year = "1988",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. of Math., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "arrays; comparative schematology; complexity theory;
computational complexity; computational power;
flow-diagrams; formal logic; logics; programming
theory; recursive procedures",
pubcountry = "Netherlands A02",
treatment = "T Theoretical or Mathematical",
}