Non-effective quantifier elimination
General connections between quantifier elimination and decidability for first order theories are studied and exemplified.
Read moreScopul nostru este sprijinirea şi promovarea cercetării ştiinţifice şi facilitarea comunicării între cercetătorii români din întreaga lume.
General connections between quantifier elimination and decidability for first order theories are studied and exemplified.
Read moreWe show that non-deterministic machines in the sense of BSS over wide classes of analytic functions are strictly more powerful then the corresponding deterministic machines.
Read moreWe define diophantinely rings of algebraic integers inside their own polinomial rings using only coefficients from Z. We minimize the degree of some other diophantine definitions.
Read more