scientific article; zbMATH DE number 545277
zbMATH Open0790.03008MaRDI QIDQ4286756FDOQ4286756
Authors: Yu. Matiyasevich 
Publication date: 10 April 1994
Title of this publication is not available (Why is that?)
exponentiationprimalityexercisesdiophantine complexitybounded universal quantifiersdiophantine codingFour-Color Problemrecursive unsolvability of Hilbert's Tenth Problemuniversal diophantine equationsimplications of negative solution to Hilbert's Tenth problem
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Decidability and field theory (12L05) Diophantine equations (11D99) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Decidability (number-theoretic aspects) (11U05)
Cited In (63)
- Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
- Extensions of Hilbert's tenth problem: definability and decidability in number theory
- Metafinite model theory
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems
- Theories of orders on the set of words
- Symbolic computation in Maude: some tapas
- On the computability of Nash equilibria
- Symmetry of eigenvalues of Sylvester matrices and tensors
- Liouville closed \(H\)-fields
- Diophantine equations and the generalized Riemann hypothesis
- Diophantine undecidability of holomorphy rings of function fields of characteristic 0
- Bisimilarity of Diagrams
- Intelligent Instantiation and Supersafe Rules
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
- Padovan-like sequences and Bell polynomials
- Quasi-interpretations. A way to control resources
- Diophantine questions in the class of finitely generated nilpotent groups
- Title not available (Why is that?)
- Uncomputability and undecidability in economic theory
- Frontier between decidability and undecidability: A survey
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
- On the termination problem for probabilistic higher-order recursive programs
- Extendability of continuous maps is undecidable
- Size-based termination of higher-order rewriting
- Title not available (Why is that?)
- Undecidable problems in quantum field theory
- Semi-Galois categories. II: An arithmetic analogue of Christol's theorem
- On certain biquadratic equations. II
- Computing the exact number of periodic orbits for planar flows
- Hintikka's independence-friendly logic meets Nelson's realizability
- Tree Automata for Non-linear Arithmetic
- The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data
- Constraint satisfaction problems over numeric domains
- Definability and decidability in infinite algebraic extensions
- Algebraic degrees of 3-dimensional polytopes
- A short note on Layman permutations
- Isomorphisms of scattered automatic linear orders
- Complexity in Young's lattice
- A computational glimpse at the Leibniz and Frege hierarchies
- Title not available (Why is that?)
- Authentication schemes from actions on graphs, groups, or rings
- Metafinite model theory
- Integral points on affine quadric surfaces
- Polynomial Equations over Finite, Discrete-Time Dynamical Systems
- Decidability of univariate real algebra with predicates for rational and integer powers
- Complexity of optimizing over the integers
- Turing reducibility in the fine hierarchy
- Diophantine sets of representations
- The computational power of enzymatic numerical P systems working in the sequential mode
- The Diophantine problem for systems of algebraic equations with exponents
- Formal and Natural Proof: A Phenomenological Approach
- \(\text{NP}\not={co}\)-NP and models of arithmetic
- P, NP, Co-NP and weak systems of arithmetic
- An arithmetic analysis of closed surfaces
- Succinct ordering and aggregation constraints in algebraic array theories
- The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals
- On multilinear inequalities of Hölder-Brascamp-Lieb type for torsion-free discrete abelian groups
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
- Existential Definability over the Subword Ordering
- Reverse engineered Diophantine equations
- Logical models of mathematical texts: the case of conventions for division by zero.
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Employing the cloud for finding solutions to large systems of nonlinear equations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4286756)
