Existential arithmetization of Diophantine equations
From MaRDI portal
Recommendations
- A direct method for simulating partial recursive functions by Diophantine equations
- On a Diophantine representation of the predicate of provability
- A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers
- scientific article; zbMATH DE number 4079400
- A Note on Diophantine Representations
Cites work
- An Informal Arithmetical Approach to Computability and Computation
- Arithmetical problems and recursively enumerable predicates
- Computability of Recursive Functions
- Existential Definability in Arithmetic
- How to Program an Infinite Abacus
- scientific article; zbMATH DE number 42574 (Why is no real title available?)
- scientific article; zbMATH DE number 3310089 (Why is no real title available?)
- scientific article; zbMATH DE number 3336816 (Why is no real title available?)
- Notes on Binomial Coefficients I-A Generalization of Lucas' Congruence†
- Recursive unsolvability of Post's problem of Tag und other topics in theory of Turing machines
- The decision problem for exponential diophantine equations
Cited in
(5)
This page was built for publication: Existential arithmetization of Diophantine equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006616)