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