The following pages link to (Q5613949):
Displaying 50 items.
- Diophantine questions in the class of finitely generated nilpotent groups (Q285579) (← links)
- On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram \(\mathbb A_n\) (Q389491) (← links)
- Towards finite-fold Diophantine representations (Q393229) (← links)
- A survey on Büchi's problem: new presentations and open problems (Q393235) (← links)
- Coding true arithmetic in the Medvedev degrees of \(\Pi^0_1\) classes (Q409326) (← links)
- Positive existential definability of multiplication from addition and the range of a polynomial (Q503237) (← links)
- Definability of Frobenius orbits and a result on rational distance sets (Q504116) (← links)
- Recognition and complexity of point visibility graphs (Q512262) (← links)
- Knapsack problem for nilpotent groups (Q524650) (← links)
- Hensley's problem for complex and non-Archimedean meromorphic functions (Q542843) (← links)
- Diophantine equations and the generalized Riemann hypothesis (Q548056) (← links)
- The analogue of Büchi's problem for function fields (Q555587) (← links)
- ABS methods for continuous and integer linear equations and optimization (Q623802) (← links)
- A modal logic framework for reasoning about comparative distances and topology (Q636293) (← links)
- Norm bounds and underestimators for unconstrained polynomial integer minimization (Q684153) (← links)
- Friedberg splittings of recursively enumerable sets (Q685058) (← links)
- Hilbert's tenth problem for weak theories of arithmetic (Q685070) (← links)
- Computability of recurrence equations (Q685372) (← links)
- Hilbert's tenth problem is of unification type zero (Q688556) (← links)
- Some new results on decidability for elementary algebra and geometry (Q714712) (← links)
- Powerful values of polynomials and a conjecture of Vojta (Q740847) (← links)
- Propositional dynamic logic of nonregular programs (Q792083) (← links)
- Polynomial time computations in models of ET (Q795035) (← links)
- Algorithmic undecidability of compatibility problem for equations in free groups: explicit equations with one commutator-type constraint (Q827048) (← links)
- Further results on Hilbert's tenth problem (Q829448) (← links)
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem (Q843609) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Recursively enumerable sets of polynomials over a finite field (Q875928) (← links)
- Inferring answers to queries (Q927868) (← links)
- Weak quantifier elimination for the full linear theory of the integers (Q945000) (← links)
- Satisfiability of algebraic circuits over sets of natural numbers (Q987688) (← links)
- Existential arithmetization of Diophantine equations (Q1006616) (← links)
- A view of computability on term algebras (Q1051428) (← links)
- A note on Presburger arithmetic with array segments, permutation and equality (Q1073009) (← links)
- Efficient symbolic analysis of programs (Q1082800) (← links)
- An infinite version of Arrow's theorem in the effective setting (Q1108914) (← links)
- Universal theory of nilpotent groups (Q1135362) (← links)
- An algorithmic problem for nilpotent groups and rings (Q1144655) (← links)
- Decidability of the universal theory of natural numbers with addition and divisibility (Q1147117) (← links)
- A new proof of the theorem on exponential diophantine representation of enumerable sets (Q1147132) (← links)
- On nonstochastic languages and homomorphic images of stochastic languages (Q1163382) (← links)
- 2DST mappings of languages and related problems (Q1164438) (← links)
- An arithmetical characterization of NP (Q1171050) (← links)
- Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games (Q1196208) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- New techniques and results in multidimensional problems (Q1229183) (← links)
- The equality problem for vector addition systems is undecidable (Q1238997) (← links)
- NP-complete decision problems for binary quadratics (Q1243130) (← links)
- Properties of the solutions of equations in a free semigroup (Q1245822) (← links)
- Some decision problems for polynomial mappings (Q1248614) (← links)
