The observational predicate calculus and complexity of computations (Preliminary communication)
Pudlák, Pavel
Commentationes Mathematicae Universitatis Carolinae, Tome 016 (1975), p. 395-398 / Harvested from Czech Digital Mathematics Library
Access to full text
Full (PDF)
Publié le : 1975-01-01
Classification:  02C99,  02F15,  03B10,  03B99,  03C68,  03D10,  08B99,  68A20,  68Q25 
@article{105634,
     author = {Pavel Pudl\'ak},
     title = {The observational predicate calculus and complexity of computations (Preliminary communication)},
     journal = {Commentationes Mathematicae Universitatis Carolinae},
     volume = {016},
     year = {1975},
     pages = {395-398},
     zbl = {0311.02021},
     mrnumber = {0386346},
     language = {en},
     url = {http://dml.mathdoc.fr/item/105634}
}

Pudlák, Pavel. The observational predicate calculus and complexity of computations (Preliminary communication). Commentationes Mathematicae Universitatis Carolinae, Tome 016 (1975) pp. 395-398. http://gdmltest.u-ga.fr/item/105634/

S. A. Cook A hierarchy for nondeterministic time complexity, Journ. Comput. and System Sci. 7 (1973), 343-353. (1973) | MR 0337539 | Zbl 0278.68042

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)