scientific article; zbMATH DE number 545277
From MaRDI portal
Publication:4286756
bounded universal quantifiersdiophantine codingdiophantine complexityexercisesexponentiationFour-Color Problemimplications of negative solution to Hilbert's Tenth problemprimalityrecursive unsolvability of Hilbert's Tenth Problemuniversal diophantine equations
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Decidability of theories and sets of sentences (03B25) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Diophantine equations (11D99) Decidability (number-theoretic aspects) (11U05) Decidability and field theory (12L05)
Cited in
(97)- Uncomputability and undecidability in economic theory
- Diophantine undecidability of holomorphy rings of function fields of characteristic 0
- Metafinite model theory
- On the computability of Nash equilibria
- Frontier between decidability and undecidability: A survey
- The complexity of computation and approximation of the t-ratio over one-dimensional interval data
- Semi-Galois categories. II: An arithmetic analogue of Christol's theorem
- Hintikka's independence-friendly logic meets Nelson's realizability
- A computational glimpse at the Leibniz and Frege hierarchies
- Liouville closed \(H\)-fields
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems
- Symbolic computation in Maude: some tapas
- Integral points on affine quadric surfaces
- Algebraic degrees of 3-dimensional polytopes
- Turing reducibility in the fine hierarchy
- Symmetry of eigenvalues of Sylvester matrices and tensors
- Padovan-like sequences and Bell polynomials
- Definability and decidability in infinite algebraic extensions
- The computational power of enzymatic numerical P systems working in the sequential mode
- Extendability of continuous maps is undecidable
- Diophantine sets of representations
- Isomorphisms of scattered automatic linear orders
- Complexity in Young's lattice
- A short note on Layman permutations
- Complexity of \(\Sigma^0_n\)-classifications for definable subsets
- Diophantine questions in the class of finitely generated nilpotent groups
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups
- On certain biquadratic equations. II
- scientific article; zbMATH DE number 4173079 (Why is no real title available?)
- scientific article; zbMATH DE number 7228882 (Why is no real title available?)
- Extensions of Hilbert's tenth problem: definability and decidability in number theory
- Theories of orders on the set of words
- Decidability of univariate real algebra with predicates for rational and integer powers
- Tree Automata for Non-linear Arithmetic
- Size-based termination of higher-order rewriting
- Constraint satisfaction problems over numeric domains
- Undecidable cases of model checking probabilistic temporal-epistemic logic (extended abstract)
- Solving systems of polynomial equations over GF(2) by a parity-counting self-reduction
- Bisimilarity of Diagrams
- Computing the exact number of periodic orbits for planar flows
- On the termination problem for probabilistic higher-order recursive programs
- Intelligent Instantiation and Supersafe Rules
- Quasi-interpretations. A way to control resources
- Diophantine equations and the generalized Riemann hypothesis
- The SAGEX review on scattering amplitudes Chapter 4: Multi-loop Feynman integrals
- Analytic one-dimensional maps and two-dimensional ordinary differential equations can robustly simulate Turing machines
- Undecidable problems in quantum field theory
- The Diophantine problem for systems of algebraic equations with exponents
- Metafinite model theory
- Formal and Natural Proof: A Phenomenological Approach
- Polynomial Equations over Finite, Discrete-Time Dynamical Systems
- Bracket words: A generalisation of Sturmian words arising from generalised polynomials
- Employing the cloud for finding solutions to large systems of nonlinear equations
- Complexity of optimizing over the integers
- Existential Definability over the Subword Ordering
- Reverse engineered Diophantine equations
- Authentication schemes from actions on graphs, groups, or rings
- Succinct ordering and aggregation constraints in algebraic array theories
- An arithmetic analysis of closed surfaces
- On multilinear inequalities of Hölder-Brascamp-Lieb type for torsion-free discrete abelian groups
- Logical models of mathematical texts: the case of conventions for division by zero.
- \(\text{NP}\not={co}\)-NP and models of arithmetic
- P, NP, Co-NP and weak systems of arithmetic
- Disjointness, inclusion, and regularity of -rational trace languages (extended abstract)
- Decidable (ac)counting with Parikh and Muller: adding Presburger arithmetic to monadic second-order logic over tree-interpretable structures
- On the Mordell-Weil rank and 2-Selmer group of a family of elliptic curves
- On guarded extensions of MMSNP
- Decidability of extensions of Presburger arithmetic by generalised polynomials
- Mixed quantifier prefixes over Diophantine equations with integer variables
- Concrete domains meet expressive cardinality restrictions in description logics
- Boosting MCSat modulo nonlinear integer arithmetic via local search
- What's decidable about arrays with sums?
- The mathematics of adversarial attacks in AI -- why deep learning is unstable despite the existence of stable neural networks
- On learning existentially definable subsets in a computable structure
- Membership problems in nilpotent groups
- Undecidability in physics: a review
- Computational considerations on the representation of number-theoretic functions by arithmetic terms
- On finite generating sets of infinitely generated ideals
- An arithmetic term for the factorial function
- Conjunctions of exponential Diophantine equations over \(\mathbb{Q}\)
- A Mordell-Lang-type problem for \(\mathrm{GL}_m \)
- First order complexity of finite random structures
- Effective isotrivial Mordell-Lang in positive characteristic
- For rational numbers with Suppes-Ono division, equational validity is one-one equivalent with Diophantine unsolvability
- On the complexity of convex and reverse convex prequadratic constraints
- SMT solving over finite field arithmetic
- A characterization of wreath products where knapsack is decidable
- A practical extension of computational complexity theory for applications in mathematics and sciences
- One is all you need: associative second-order unification without first-order variables
- Bag containment of join-on-free queries
- The role of logic and automata in understanding transformers
- Word structures and their automatic presentations
- A formal proof of complexity bounds on Diophantine equations
- The Padovan-circulant-Hurwitz sequences
- Undecidability on Diophantine equations over \(\mathbb{Z} \lbrack i \rbrack\) with 20 unknowns
- On lattice diameter segments: algorithms and structure
- Universal Pairs for Diophantine 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)
