The observational predicate calculus and complexity of computations (Preliminary communication)
Commentationes Mathematicae Universitatis Carolinae (1975)
- Volume: 016, Issue: 2, page 395-398
- ISSN: 0010-2628
Access Full Article
topHow to cite
topReferences
top- S. A. COOK, A hierarchy for nondeterministic time complexity, Journ. Comput. and System Sci. 7 (1973), 343-353. (1973) Zbl0278.68042MR0337539
- P. HÁJEK, Generalized quantifiers and finite sets, Proceedings of the Autumn School in Set Theory and Hierarchy Theory, Karpacz, Poland, 1974. (1974)
- 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. (1975)
- D. S. JOHNSON P. GÁCS L. LOVÁSZ, Pseudoelementary classes of finite structures and polynomial completeness, To appear.
- P. PUDLÁK, Observační predikátorový počet a teorie složitosti, (master thesis, Charles University 1975). (1975)