Follow
Andrei Rusu
Title
Cited by
Cited by
Year
On non-tabular m-pre-complete classes of formulas in the propositional provability logic.
O Izbaş, A Rusu
An. Ştiinţ. Univ. “Ovidius” Constanţa, Ser. Mat. 14 (1), 91-98, 2006
32006
Study on the mapping of research data in the Republic of Moldova in the context of open science
N Turcan, A Rusu, R Cujba
International Journal of Advanced Statistics and IT&C for Economics and Life …, 2019
22019
Research data in the context of open science: Case study of the Republic of Moldova
A Rusu, N Ţurcan, R Cujba, M Grecu
Central and Eastern European EDem and EGov Days, 319-328, 2019
22019
Menţinerea şi dezvoltarea infrastructurii publice de cercetare şi inovare
I Cojocaru, A Roşca, M Guzun, A Rusu
Revista de Ştiinţă, Inovare, Cultură şi Artă „Akademos” 47 (4), 20-26, 2017
22017
Medii virtuale multimodale distribuite
DM POPOVICI, E ZAHARESCU, A RUSU, MC PUCHIANU, D SBURLAN
Craiova: Ed. Universitaria, Bucureşti: Ed. ProUniversitaria, ISBN 978-606-14 …, 2015
22015
Completeness criteria for expressibility in a 4-valued extension of provability logic.
AG Russu
Bul. Acad. Ştiinţe Repub. Mold., Mat., 75-86, 1996
2*1996
On some pre-complete relative to positive expressibility classes of formulas in the 8-valued para-consistent extension of the logic
A RUSU, E RUSU
Proceedings of Workshop on Intelligent Information Systems WIIS2023, 199--206, 2023
12023
Open Science in the Republic of Moldova
G Cuciureanu, R Cujba, E Ungureanu, I Cojocaru, V Minciuna, M Grecu, ...
Zenodo, 2018
12018
Public Research and Innovation Infrastructure of the Republic of Moldova: Challenges and Opportunities
I Cojocaru, A Roşca, A Rusu, M Guzun
Central and Eastern European eDem and eGov Days, 421-430, 2018
12018
On some properties of complete by expressibility systems of formulas in the Gödel–Löb provability logic
MF Ratsa, AG Russu
Walter de Gruyter, Berlin/New York 10 (6), 553-570, 2000
12000
A Simple CAD System for Faculty Timetabling Design
A Rusu, E Rusu
Proceedings of the International Conference IMCS-60, 361--364, 2024
2024
On some classes of formulas in S5 which are pre-complete relative to existential expressibility
A Rusu, E Rusu
Computer Science Journal of Moldova 93 (3), 395-408, 2023
2023
On AI frameworks for investigation of expressibility in logical calculi
A RUSU, E RUSU
Proceedings of the 9th International Conference "Mathematics & IT: Research …, 2023
2023
Tehnologii pentru „Digital Mathematical Library – Moldova” (DML-MD)
F DAMIAN, A RUSU
Știința Deschisă în Republica Moldova, Ed. Ediția 2, 22, 2022
2022
Tehnologii pentru „Digital Mathematical Library – Moldova” (DML-MD)
F DAMIAN, A RUSU
Știința Deschisă în Republica Moldova, Ediția 2, 155-158, 2022
2022
Tehnologii pentru „Digital Mathematical Library–Moldova”(DML-MD)
RA Damian Florin
Știința Deschisă în Republica Moldova, 22-22, 2022
2022
On Algorithms Related to Expressibility of Functions of Diagonalizable Algebras
A Rusu, E Rusu
Algorithms as a Basis of Modern Applied Mathematics, 257-277, 2021
2021
On functionally complete systems of formulas containing paraconsistent negation in a simple paraconsistent logic
A Rusu, E Rusu
Научное обеспечение развития АПК в условиях импортозамещения: сборник …, 2021
2021
On weak-functionally complete systems of formulas containing paraconsistent negation in a paraconsistent logic
A Rusu, E Rusu
International Conference on Intelligent Information Systems, 170-175, 2020
2020
Evaluarea bunurilor imobile în scop de garantare a împrumuturilor
A RUSU
Universitatea Tehnică a Moldovei, 2019
2019
The system can't perform the operation now. Try again later.
Articles 1–20