Related papers: The decision problem for normed spaces over any cl…

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…

A class of two-dimensional systems of second-order ordinary differential equations is identified in which a system requires fewer Lie point symmetries than required to solve it. The procedure distinguishes among those which are…

It is proved that the first-order theory of the structure (N,mod) is undecidable. Here mod denotes the operation of computing the remainder for any division between positive integers; i.e. x mod y is the remainder obtained by the division x…

We consider the fragment F of first order arithmetic in which quantification is restricted to ''for all but finitely many.'' We show that the integers form an F-elementary substructure of the real numbers. Consequently, the F-theory of…

In the literature two notions of the word problem for a variety occur. A variety has a decidable word problem if every finitely presented algebra in the variety has a decidable word problem. It has a uniformly decidable word problem if…

We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions and iterated connectives ranging over intervals parameterized by arithmetic variables. The satisfiability problem is shown…

A celebrated 1969 theorem of Michael Rabin is that the MSO theory of the real order where the monadic quantifier is allowed only to range over the sets of rational numbers, is decidable. In 1975 Saharon Shelah proved that if the monadic…

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

A group is called square-like if it is universally equivalent to its direct square. It is known that the class of all square-like groups admits an explicit first order axiomatization but its theory is undecidable. We prove that the theory…

The higher order matching problem is the problem of determining whether a term is an instance of another in the simply typed $\lambda$-calculus, i.e. to solve the equation a = b where a and b are simply typed $\lambda$-terms and b is…

The configuration space of general relativity is superspace - the space of all Riemannian 3-metrics modulo diffeomorphisms. However, it has been argued that the configuration space for gravity should be conformal superspace - the space of…

We consider the logic MSO+U, which is monadic second-order logic extended with the unbounding quantifier. The unbounding quantifier is used to say that a property of finite sets holds for sets of arbitrarily large size. We prove that the…

One often distinguishes between a line and a plane by saying that the former is one-dimensional while the latter is two. But, what does it mean for an object to have $d-$dimensions? Can we define a consistent notion of dimension rigorously…

Recent criticism of higher-dimensional extensions of Einstein's theory is considered. This may have some justification as regards string theory, but is misguided as applied to five-dimensional theories with a large extra dimension. Such…

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…

This paper proves that a plactic monoid of any finite rank will have decidable first order theory. This resolves other open decidability problems about the finite rank plactic monoids, such as the Diophantine problem and identity checking.…

These lecture notes cover classical undecidability results in number theory, Hilbert's 10th problem and recent developments around it, also for rings other than the integers. It also contains a sketch of the authors result that the integers…