Decidability of some problems pertaining to base 2 exponential diophantine equations

Mathematical Logic Quarterly 31 (7‐8):109-115 (1985)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1002/malq.19850310703

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories.Panu Raatikainen - 2003 - Journal of Symbolic Logic 68 (1):262-266.
On the existence of a new family of diophantine equations for Ω.Toby Ord - 2003 - Fundamenta Informaticae 56:273-284.
Ω in number theory.Toby Ord - 2007 - In C. S. Calude (ed.), Randomness and Complexity, from Leibniz to Chaitin. World Scientific. pp. 161-173.
Diophantine equivalence and countable rings.Alexandra Shlapentokh - 1994 - Journal of Symbolic Logic 59 (3):1068-1095.
Register machine proof of the theorem on exponential diophantine representation of enumerable sets.J. P. Jones & Y. V. Matijasevič - 1984 - Journal of Symbolic Logic 49 (3):818-829.
Real Closed Exponential Subfields of Pseudo-Exponential Fields.Ahuva C. Shkop - 2013 - Notre Dame Journal of Formal Logic 54 (3-4):591-601.
Herbrand-analysen zweier beweise Des satzes Von Roth: Polynomiale anzahlschranken.H. Luckhardt - 1989 - Journal of Symbolic Logic 54 (1):234-263.
Corrigendum: On diophantine equations solvable in models of open induction.Margarita Otero - 1991 - Journal of Symbolic Logic 56 (3):811-812.
Walking Cautiously Into the Collatz Wilderness: Algorithmically, Number Theoretically, Randomly.Edward G. Belaga & Maurice Mignotte - 2006 - Discrete Mathematics and Theoretical Computer Science.
Pfaffian differential equations over exponential o-minimal structures.Chris Miller & Patrick Speissegger - 2002 - Journal of Symbolic Logic 67 (1):438-448.
A Turing Machine for Exponential Function.P. M. F. Lemos - manuscript
After Gödel: Mechanism, Reason, and Realism in the Philosophy of Mathematics.Richard Tieszen - 2006 - Philosophia Mathematica 14 (2):229-254.
Base rates and randomness.Ranald R. Macdonald - 1997 - Behavioral and Brain Sciences 20 (4):778-778.

Analytics

Added to PP
2013-10-31

Downloads
9 (#1,187,161)

6 months
1 (#1,459,555)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references