Division by zero

DOI10.1007/s00153-016-0508-5zbMath1362.03050arXiv1604.07309OpenAlexW2345122139MaRDI QIDQ335000

Emil Jeřábek

Publication date: 1 November 2016

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.07309

zbMATH Keywords

decidabilityDiophantine equationRobinson arithmeticuniversal theory

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) First-order arithmetic and fragments (03F30) Nonstandard models of arithmetic (03H15)

Related Items (1)

Algebraic combinatorics in bounded induction

Uses Software

• MathOverflow

Cites Work

• Diophantine induction
• Hilbert's tenth problem for weak theories of arithmetic
• NP-complete decision problems for binary quadratics
• On Diophantine equations solvable in models of open induction
• Which Curves Over Z have Points with Coordinates in a Discrete Ordered Ring?
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Division by zero