Definability and decision problems in arithmetic

Cites work

An Unsolvable Problem of Elementary Number Theory
Weak definitions of field

Cited in

(only showing first 100 items - show all)

A view of computability on term algebras
A note on Parikh maps, abstract languages, and decision problems
Julia Robinson, in memoriam
Polynomial time algorithms for sentences over number fields
Complexity of logical theories involving coprimality
Self-injective regular algebras and function rings
Problemi di decidibilita in logica topologica
Extended order-generic queries
Ehrenfeucht games and ordinal addition
Queries with arithmetical constraints
On nonelementarily equivalent pairs of fields
Quantifier rank for parity of embedded finite models.
Hilbert's tenth problem for rings of rational functions
Predicate logics of expressively strong theories
First-order decidability and definability of integers in infinite algebraic extensions of the rational numbers
Definability, decidability, complexity
Decidability of certain theories of integers
On arithmetical first-order theories allowing encoding and decoding of lists
Decidable \({\exists}^*{\forall}^*\) first-order fragments of linear rational arithmetic with uninterpreted predicates
Universally defining finitely generated subrings of global fields
Axiomatic (and non-axiomatic) mathematics
Computable procedures for fields
Ordered fields dense in their real closure and definable convex valuations
On mutual definability of operations on fields
Termination of polynomial loops
The scope of Gödel's first incompleteness theorem
All arithmetical sets of powers of primes are first-order definable in terms of the successor function and the coprimeness predicate
When is scalar multiplication decidable?
On decidability and axiomatizability of some ordered structures
On mathematical realism and applicability of hyperreals
Uniformly defining \(p\)-Henselian valuations
Definability and decidability in infinite algebraic extensions
Hilbert's tenth problem over function fields of positive characteristic not containing the algebraic closure of a finite field
Uniform first-order definitions in finitely generated fields
The Hilbert's-tenth-problem operator
An existential divisibility lemma for global fields
Integrality at a prime for global fields and the perfect closure of global fields of characteristic \(p > 2\)
First-order definitions of rational functions and \({\mathcal S}\)-integers over holomorphy rings of algebraic functions of characteristic 0
Can one design a geometry engine? Can one design a geometry engine? On the (un)decidability of certain affine Euclidean geometries
Automatic sets of rational numbers
Defining integers
The compactness of first-order logic:from gödel to lindström
On Dipphantine definability and decidability in some rings of algebraic functions of characteristic 0
Baire category theory and Hilbert's tenth problem inside \(\mathbb {Q}\)
Some new results in monadic second-order arithmetic
The Undecidability of Algebraic Rings and Fields
Extensions of Hilbert's tenth problem: definability and decidability in number theory
Mathematics by machine
Fuzzy simplification of non-numeric expressions containing some intervals and/or floating point numbers
Sparse interpolation over finite fields via low-order roots of unity
Multivariate sparse interpolation using randomized Kronecker substitutions
Computing the differential Galois group of a parameterized second-order linear differential equation
A new deterministic algorithm for sparse multivariate polynomial interpolation
A fast algorithm for computing the characteristic polynomial of the \(p\)-curvature
Computing necessary integrability conditions for planar parametrized homogeneous potentials
Improved algorithm for computing separating linear forms for bivariate systems
Solving higher order linear differential equations having elliptic function coefficients
Parallel telescoping and parameterized Picard-Vessiot theory
A generalized Apagodu-Zeilberger algorithm
The asymptotic analysis of some interpolated nonlinear recurrence relations
Fast arithmetic for the algebraic closure of finite fields
On the computation of the topology of plane curves
Essentially optimal interactive certificates in linear algebra
Root counts of semi-mixed systems, and an application to counting Nash equilibria
Synthesis of optimal numerical algorithms using real quantifier elimination (case study: square root computation)
Sub-cubic change of ordering for Gröbner basis: a probabilistic approach
Sparse Gröbner bases: the unmixed case
The MMO problem
Factoring linear differential operators in \(n\) variables
Online order basis algorithm and its impact on the block Wiedemann algorithm
On isomorphisms of modules over non-commutative PID
Radical solutions of first order autonomous algebraic ordinary differential equations
Computing low-degree factors of lacunary polynomials: a Newton-Puiseux approach
Maximum likelihood geometry in the presence of data zeros
Constructing fewer open cells by GCD computation in CAD projection
An a posteriori certification algorithm for Newton homotopies
Evaluating parametric holonomic sequences using rectangular splitting
Equivariant lattice generators and Markov bases
Sparse polynomial interpolation codes and their decoding beyond half the minimum distance
Sparse multivariate function recovery with a high error rate in the evaluations
Bounds for D-finite closure properties
Powers of tensors and fast matrix multiplication
Reduction among bracket polynomials
Formal solutions of a class of Pfaffian systems in two variables
On the reduction of singularly-perturbed linear differential systems
High performance implementation of the TFT
Randomized detection of extraneous factors
Toric border basis
On efficient algorithms for computing parametric local cohomology classes associated with semi-quasihomogeneous singularities and standard bases
A near-optimal algorithm for computing real roots of sparse polynomials
LLL reducing with the most significant bits
Covering of surfaces parametrized without projective base points
Linear independence oracles and applications to rectangular and low rank linear systems
Faster relaxed multiplication
Unimodular completion of polynomial matrices
Elliptic curves retaining their rank in finite extensions and Hilbert's Tenth Problem for rings of algebraic numbers
A note on definability in fragments of arithmetic with free unary predicates
Answer to a problem raised by J. Robinson: The arithmetic of positive or negative integers is definable from successor and divisibility
Definability in number fields
Undecidability and Definability for the Theory of Global Fields

This page was built for publication: Definability and decision problems in arithmetic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5791204)