Related papers: Hilbert's tenth problem, G\"odel's incompleteness,…
I present the proof of Goedel's First Incompleteness theorem in an intuitive manner, while covering all technically challenging steps. I present generalizations of Goedel's fixed point lemma to two-sentence and multi-sentence versions,…
The Computational Algebraic Geometry applied in Algebraic Statistics; are beginning to exploring new branches and applications; in artificial intelligence and others areas. Currently, the development of the mathematics is very extensive and…
In this work we attempt to generalize our result in [6] [7] for real rings (not just von Neumann regular real rings). In other words we attempt to characterize and construct real closure * of commutative unitary rings that are real. We also…
Given a finitely generated free monoid $X$ and a morphism $\phi : X\to X$, we show that one can construct an algebra, which we call an iterative algebra, in a natural way. We show that many ring theoretic properties of iterative algebras…
For any first order theory T we construct a Boolean valued model M, in which precisely the T--provable formulas hold, and in which every (Boolean valued) subset which is invariant under all automorphisms of M is definable by a first order…
Natural numbers satisfying an unusual property are mentioned by the author in [5], in which their infinitude is also proved. In this paper, we start with an arbitrary natural number which is not a multiple of 10 and non-palindromic, form…
We show that the Skolem Problem is decidable in finitely generated commutative rings of positive characteristic. More precisely, we show that there exists an algorithm which, given a finite presentation of a (unitary) commutative ring…
In this paper we investigate three unsolved conjectures in geometric combinatorics, namely Falconer's distance set conjecture, the dimension of Furstenburg sets, and Erdos's ring conjecture. We formulate natural $\delta$-discretized…
Iterated reflection principles have been employed extensively to unfold epistemic commitments that are incurred by accepting a mathematical theory. Recently this has been applied to theories of truth. The idea is to start with a collection…
One of the greatest problems in philosophy is that of meaning. The turning point in thinking on meaning was Tarski's definition of truth, and the rapid development of logical semantics and model theory was a consequence of this achievement.…
We show: 1) The existence of the first twisted Hilbert space that is not isomorphic to its dual; this solves a problem posed by Cabello in [Nonlinear centralizers in homology, Math. Ann. 358 (2014), no. 3-4, 779-798]. 2) The existence of a…
We analyze the informal notion of truth and conclude that it can be formalized in essentially two distinct ways: constructively, in terms of provability, or classically, as a hierarchy of concepts which satisfy Tarski's biconditional in…
It is a widespread belief that results like G\"odel's incompleteness theorems or the intrinsic randomness of quantum mechanics represent fundamental limitations to humanity's strive for scientific knowledge. As the argument goes, there are…
Tarski initiated a logic-based approach to formal geometry that studies first-order structures with a ternary betweenness relation (\beta) and a quaternary equidistance relation (\equiv). Tarski established, inter alia, that the first-order…
The enumeration degrees of sets of natural numbers can be identified with the degrees of difficulty of enumerating neighborhood bases of points in a universal second-countable $T_0$-space (e.g. the $\omega$-power of the Sierpi\'nski space).…
Julia Robinson has given a first-order definition of the rational integers Z in the rational numbers Q by a formula (\forall \exists \forall \exists)(F=0) where the \forall-quantifiers run over a total of 8 variables, and where F is a…
For a homomorphism f: A --> B of commutative rings, let D(A,B) denote Ker[Pic(A) --> Pic(B)]. Let k be a field and assume that A is a f.g. k-algebra. We prove a number of finiteness results for D(A,B). Here are four of them. 1: Suppose B is…
We reformulate Hrushovski's definability patterns from the setting of first order logic to the setting of positive logic. Given an h-universal theory T we put two structures on the type spaces of models of T in two languages, \mathcal{L}…
One of the classical problems in group theory is determining the set of positive integers $n$ such that every group of order $n$ has a particular property $P$, such as cyclic or abelian. We first present the Sylow theorems and the idea of…
The theory of addition in the domains of natural (N), integer (Z), rational (Q), real (R) and complex (C) numbers is decidable, so is the theory of multiplication in all those domains. By Godel's Incompleteness Theorem the theory of…