The following pages link to M.Tetruashvili (Q1177040):
Displaying 18 items.
- (Q685069) (redirect page) (← links)
- Hilbert's tenth problem for weak theories of arithmetic (Q685070) (← links)
- Complexity of subclasses of the intuitionistic propositional calculus (Q688732) (← links)
- The complexity of the satisfiability problem for Krom formulas (Q800915) (← links)
- Recursive-combinatorial properties of subsets of the natural numbers (Q803118) (← links)
- Decidability of elementary theories of lattices of subsemigroups (Q920966) (← links)
- Henkin quantifiers and complete problems (Q1088983) (← links)
- Bounded arithmetic and the polynomial hierarchy (Q1177041) (← links)
- Bounded arithmetic for NC, ALogTIME, L and NL (Q1192345) (← links)
- Complexity of logical theories involving coprimality (Q1202924) (← links)
- Complexity of deciding Tarski algebra (Q1264143) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- Separations of theories in weak bounded arithmetic (Q1344280) (← links)
- On parallel hierarchies and \(R_k^i\) (Q1377627) (← links)
- Weak covering and the tree property (Q1818430) (← links)
- \(\Delta_ 0\)-complexity of the relation \(y= \prod_{i\leq n} F(i)\) (Q1899142) (← links)
- (Q5183741) (← links)
- (Q5665349) (← links)