Previous |  Up |  Next

Article

Title: The observational predicate calculus and complexity of computations (Preliminary communication) (English)
Author: Pudlák, Pavel
Language: English
Journal: Commentationes Mathematicae Universitatis Carolinae
ISSN: 0010-2628 (print)
ISSN: 1213-7243 (online)
Volume: 16
Issue: 2
Year: 1975
Pages: 395-398
.
Category: math
.
MSC: 02C99
MSC: 02F15
MSC: 03B10
MSC: 03B99
MSC: 03C68
MSC: 03D10
MSC: 08B99
MSC: 68A20
MSC: 68Q25
idZBL: Zbl 0311.02021
idMR: MR0386346
.
Date available: 2008-06-05T20:48:22Z
Last updated: 2012-04-27
Stable URL: http://hdl.handle.net/10338.dmlcz/105634
.
Reference: [1] S. A. COOK: A hierarchy for nondeterministic time complexity.Journ. Comput. and System Sci. 7 (1973), 343-353. Zbl 0278.68042, MR 0337539
Reference: [2] P. HÁJEK: Generalized quantifiers and finite sets.Proceedings of the Autumn School in Set Theory and Hierarchy Theory, Karpacz, Poland, 1974.
Reference: [3] P. HÁJEK: Projective classes of models in observational predicate calculi.Preprint for the 6th Internat. Congress for Logic, Methodology and Philosophy of Science, London, Ontario, Canada, 1975.
Reference: [4] D. S. JOHNSON P. GÁCS L. LOVÁSZ: Pseudoelementary classes of finite structures and polynomial completeness.To appear.
Reference: [5] P. PUDLÁK: Observační predikátorový počet a teorie složitosti.(master thesis, Charles University 1975).
.

Files

Files Size Format View
CommentatMathUnivCarol_016-1975-2_16.pdf 297.8Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo