| Publication | Date of Publication | Type |
|---|
| https://portal.mardi4nfdi.de/entity/Q6201768 | 2024-03-25 | Paper |
| A common approach to three open problems in number theory | 2023-12-12 | Paper |
| Erratum to: A common approach to three open problems in number theory | 2023-12-12 | Paper |
| On the Relationship Between Matiyasevich's and Smorynski's Theorems | 2022-07-19 | Paper |
| Hilbert's 10th Problem for solutions in a subring of Q | 2019-09-08 | Paper |
| Is there an algorithm that decides the solvability of a Diophantine equation with a finite number of solutions? | 2017-02-09 | Paper |
| All Functions $$g: \mathbb{N} \rightarrow \mathbb{N}$$ Which have a Single-Fold Diophantine Representation are Dominated by a Limit-Computable Function $$f: \mathbb{N}\setminus \{0\} \rightarrow \mathbb{N}$$ Which is Implemented in MuPAD and Whose Computability is an Open Problem | 2016-03-04 | Paper |
| Is there a computable upper bound on the heights of rational solutions of a Diophantine equation with a finite number of solutions? | 2015-11-19 | Paper |
| On systems of Diophantine equations with a large number of integer solutions | 2015-10-26 | Paper |
| A hypothetical way to compute an upper bound for the heights of solutions of a Diophantine equation with a finite number of solutions | 2015-02-17 | Paper |
| A new characterization of computable functions | 2014-10-14 | Paper |
| Is there a computable upper bound for the height of a solution of a Diophantine equation with a unique solution in positive integers? | 2014-04-23 | Paper |
| Conjecturally computable functions which unconditionally do not have any finite-fold Diophantine representation | 2014-04-14 | Paper |
| An algorithm which transforms any Diophantine equation into an equivalent system of equations of the forms x_i=1, x_i+x_j=x_k, x_i \cdot x_j=x_k | 2014-03-12 | Paper |
| A conjecture on integer arithmetic which implies that there is an algorithm which to each Diophantine equation assigns an integer which is greater than the heights of integer (non-negative integer, rational) solutions, if these solutions form a finite set | 2014-03-12 | Paper |
| Is there an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the number of integer solutions, if the solution set is finite? | 2013-09-14 | Paper |
| Does there Exist an Algorithm which to Each Diophantine Equation Assigns an Integer which is Greater than the Modulus of Integer Solutions, if these Solutions form a Finite Set? | 2013-08-26 | Paper |
| Small systems of Diophantine equations with a prescribed number of solutions in non-negative integers | 2011-10-16 | Paper |
| A subset of Z^n whose non-computability leads to the existence of a Diophantine equation whose solvability is logically undecidable | 2011-07-27 | Paper |
| Does there exist an algorithm which to each Diophantine equation assigns an integer which is greater than the number (heights) of integer solutions, if these solutions form a finite set? | 2011-05-28 | Paper |
| Small systems of Diophantine equations which have only very large integer solutions | 2011-02-20 | Paper |
| Two conjectures on the arithmetic in ℝ and ℂ | 2010-04-15 | Paper |
| Two conjectures on integer arithmetic and their applications to Diophantine equations | 2009-11-02 | Paper |
| Some conjectures on addition and multiplication of complex (real) numbers | 2009-10-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3625141 | 2009-05-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3518882 | 2008-08-12 | Paper |
| On \(\emptyset\)-definable elements in a field | 2007-09-05 | Paper |
| A discrete form of the Beckman-Quarles theorem for mappings from \(\mathbb{R}^2\,(\mathbb{C}^2)\) to \(\mathbb{F}^2\), where \(\mathbb{F}\) is a subfield of a commutative field extending \(\mathbb{R}\,(\mathbb{C})\) | 2007-01-24 | Paper |
| The Beckman-Quarles theorem for continuous mappings from \({\mathbb C}^{n}\) to \({\mathbb C}^{n}\) | 2006-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5475653 | 2006-06-27 | Paper |
| A discrete form of the theorem that each field endomorphism of \(\mathbb R(\mathbb Q_p)\) is the identity | 2006-05-18 | Paper |
| A stronger form of the theorem on the existence of a rigid binary relation on any set | 2005-08-22 | Paper |
| The Beckman-Quarles theorem for mappings from \(\mathbb{R}^2\) of \(\mathbb{F}^2\), where \(\mathbb{F}\) is a subfield of a commutative field extending \(\mathbb{R}\) | 2005-02-28 | Paper |
| Beckman-Quarles type theorems for mappings from \(\mathbb{R}^n\) to \(\mathbb{C}^n\) | 2004-10-05 | Paper |
| Mappings from R^n to F^n which preserve unit Euclidean distance, where F is a field of characteristic 0 | 2003-05-15 | Paper |
| A discrete form of the Beckman-Quarles theorem for rational eight-space | 2003-01-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2765390 | 2002-11-11 | Paper |
| The Beckman-Quarles theorem for continuous mappings from R^2 to C^2 | 2002-06-25 | Paper |
| On binary relations without non-identical endomorphisms | 2002-05-21 | Paper |
| The Beckman-Quarles theorem for continuous mappings from R^n to C^n | 2002-04-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4804716 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2725861 | 2001-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4504213 | 2001-02-28 | Paper |
| Discrete versions of the Beckman-Quarles theorem | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939327 | 2000-02-23 | Paper |
| A Discrete Form of the Beckman-Quarles Theorem | 1998-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3124434 | 1997-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5285422 | 1997-03-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4848340 | 1995-09-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4288836 | 1994-04-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4275546 | 1994-01-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4843243 | 1994-01-01 | Paper |
| ON ONE COMBINATORIAL LEMMA AND ITS GEOMETRIC CONSEQUENCES | 1993-06-29 | Paper |
| A new combinatorial characterization of the minimal cardinality of a subset of R which is not of first category | 0001-01-03 | Paper |
| Constructive mathematics with the knowledge predicate $K$ satisfied by every currently known theorem | 0001-01-03 | Paper |
