The observational predicate calculus and complexity of computations (Preliminary communication)
Commentationes Mathematicae Universitatis Carolinae, Tome 16 (1975) no. 2, pp. 395-398
Cet article a éte moissonné depuis la source Czech Digital Mathematics Library
@article{CMUC_1975_16_2_a15,
author = {Pudl\'ak, Pavel},
title = {The observational predicate calculus and complexity of computations {(Preliminary} communication)},
journal = {Commentationes Mathematicae Universitatis Carolinae},
pages = {395--398},
year = {1975},
volume = {16},
number = {2},
mrnumber = {0386346},
zbl = {0311.02021},
language = {en},
url = {http://geodesic.mathdoc.fr/item/CMUC_1975_16_2_a15/}
}
TY - JOUR AU - Pudlák, Pavel TI - The observational predicate calculus and complexity of computations (Preliminary communication) JO - Commentationes Mathematicae Universitatis Carolinae PY - 1975 SP - 395 EP - 398 VL - 16 IS - 2 UR - http://geodesic.mathdoc.fr/item/CMUC_1975_16_2_a15/ LA - en ID - CMUC_1975_16_2_a15 ER -
%0 Journal Article %A Pudlák, Pavel %T The observational predicate calculus and complexity of computations (Preliminary communication) %J Commentationes Mathematicae Universitatis Carolinae %D 1975 %P 395-398 %V 16 %N 2 %U http://geodesic.mathdoc.fr/item/CMUC_1975_16_2_a15/ %G en %F CMUC_1975_16_2_a15
Pudlák, Pavel. The observational predicate calculus and complexity of computations (Preliminary communication). Commentationes Mathematicae Universitatis Carolinae, Tome 16 (1975) no. 2, pp. 395-398. http://geodesic.mathdoc.fr/item/CMUC_1975_16_2_a15/
[1] S. A. COOK: A hierarchy for nondeterministic time complexity. Journ. Comput. and System Sci. 7 (1973), 343-353. | MR | Zbl
[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).