Два неразрешимых класса формул классического исчисления предикатов

В.П. Оревков

Zapiski naucnych seminarov Leningradskogo (1968)

  • Volume: 8, page 202-210

How to cite

top

Оревков, В.П.. "Два неразрешимых класса формул классического исчисления предикатов." Zapiski naucnych seminarov Leningradskogo 8 (1968): 202-210. <http://eudml.org/doc/188124>.

@article{Оревков1968,
author = {Оревков, В.П.},
journal = {Zapiski naucnych seminarov Leningradskogo},
keywords = {recursion theory, constructive mathematics},
language = {rus},
pages = {202-210},
publisher = {Nauka},
title = {Два неразрешимых класса формул классического исчисления предикатов},
url = {http://eudml.org/doc/188124},
volume = {8},
year = {1968},
}

TY - JOUR
AU - Оревков, В.П.
TI - Два неразрешимых класса формул классического исчисления предикатов
JO - Zapiski naucnych seminarov Leningradskogo
PY - 1968
PB - Nauka
VL - 8
SP - 202
EP - 210
LA - rus
KW - recursion theory, constructive mathematics
UR - http://eudml.org/doc/188124
ER -

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

                
Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.