Previous |  Up |  Next


[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