About DML-CZ | FAQ | Conditions of Use | Math Archives | Contact Us
  Previous |  Up |  Next

Article

First Page Preview
Pudlák, Pavel
The observational predicate calculus and complexity of computations (Preliminary communication). (English). Commentationes Mathematicae Universitatis Carolinae, vol. 16 (1975), issue 2, pp. 395-398
MSC: 02C99, 02F15, 03B10, 03B99, 03C68, 03D10, 08B99, 68A20, 68Q25 | MR 0386346 | Zbl 0311.02021
References:
[1] S. A. COOK: A hierarchy for nondeterministic time complexity. Journ. Comput. and System Sci. 7 (1973), 343-353. MR 0337539 | Zbl 0278.68042
[2] P. HÁJEK: Generalized quantifiers and finite sets. Proceedings of the Autumn School in Set Theory and Hierarchy Theory, Karpacz, Poland, 1974.
[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.
[4] D. S. JOHNSON P. GÁCS L. LOVÁSZ: Pseudoelementary classes of finite structures and polynomial completeness. To appear.
[5] P. PUDLÁK: Observační predikátorový počet a teorie složitosti. (master thesis, Charles University 1975).
Partner of
EuDML logo