IBN
  



  














    
  


  
Închide

Afișare rezultate

SM ISO690:2012
Afisarea articolelor 1-2(2) pentru cuvîntul-cheie "parametric expressibility of formulas"
Infinitely many precomplete with respect to parametric expressibility classes of formulas in a provability logic of propositions
Rusu Andrei12
1 Information Society Development Institute,
2 Ovidius University, Constanța
Analele Stiintifice ale Universitatii Ovidius Constanta, Seria Matematica
Nr. / 2014 / ISSN 1224-1784 /ISSNe 1844-0835
Disponibil online 28 February, 2024. Descarcări-0. Vizualizări-45
-----------------------------------------------------------------------------------------------------------------------------------
Infinitely many precomplete relative to parametric expressibility classes of formulas in a provability logic
Rusu Andrei
Information Society Development Institute
International Conference on Intelligent Information Systems
2013. Chișinău. .
Disponibil online 12 February, 2018. Descarcări-4. Vizualizări-737
-----------------------------------------------------------------------------------------------------------------------------------
 
 

1-2 of 2