On non-tabular m -pre-complete classes of formulas in the propositional provability logic.

Izbaş, Olga; Rusu, Andrei

Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică (2006)

  • Volume: 14, Issue: 1, page 91-98
  • ISSN: 1223-723X

How to cite

top

Izbaş, Olga, and Rusu, Andrei. "On non-tabular -pre-complete classes of formulas in the propositional provability logic.." Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică 14.1 (2006): 91-98. <http://eudml.org/doc/130044>.

@article{Izbaş2006,
author = {Izbaş, Olga, Rusu, Andrei},
journal = {Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică},
keywords = {functional expressibility; -completeness; provability logic; -completeness},
language = {eng},
number = {1},
pages = {91-98},
publisher = {Universitatea “Ovidius"},
title = {On non-tabular -pre-complete classes of formulas in the propositional provability logic.},
url = {http://eudml.org/doc/130044},
volume = {14},
year = {2006},
}

TY - JOUR
AU - Izbaş, Olga
AU - Rusu, Andrei
TI - On non-tabular -pre-complete classes of formulas in the propositional provability logic.
JO - Analele Ştiinţifice ale Universităţii “Ovidius" Constanţa. Seria: Matematică
PY - 2006
PB - Universitatea “Ovidius"
VL - 14
IS - 1
SP - 91
EP - 98
LA - eng
KW - functional expressibility; -completeness; provability logic; -completeness
UR - http://eudml.org/doc/130044
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.