English
Related papers

Related papers: Transfinitely valued Euclidean domains have arbitr…

200 papers

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…

Logic · Mathematics 2016-09-07 Carsten Butz , Ieke Moerdijk

We study initial value problems having dynamics ruled by discontinuous ordinary differential equations with the property of possessing a unique solution. We identify a precise class of such systems that we call solvable intitial value…

Computational Complexity · Computer Science 2024-05-03 Olivier Bournez , Riccardo Gozzi

The conditions for superintegrable systems in two-dimensional Euclidean space admitting separation of variables in an orthogonal coordinate system and a functionally independent third-order integral are studied. It is shown that only…

Mathematical Physics · Physics 2015-01-05 A. Marchesiello , S. Post , L. Šnobl

We construct a continuum of non-homeomorphic compact subspaces of the real line R without singleton components. Thus from the purely topological point of view the real line contains not only more closed sets than open sets but also more…

General Topology · Mathematics 2020-04-24 Gerald Kuba

If G is a countable discrete group acting linearly on a finite-dimensional vector space over any topological field, then the groups of coboundaries are closed for the product topology in all degrees, and hence the cohomology is reduced in…

Group Theory · Mathematics 2017-03-23 Tim Austin

A new syntactic characterization of problems complete via Turing reductions is presented. General canonical forms are developed in order to define such problems. One of these forms allows us to define complete problems on ordered…

Computational Complexity · Computer Science 2014-11-25 Vladimir Naidenko

The uninorms with continuous underlying t-norm and t-conorm are characterized via an extended ordinal sum construction. Using the results of [18], where each uninorm with continuous underlying operations was characterized by properties of…

Rings and Algebras · Mathematics 2015-06-26 Andrea Mesiarova-Zemankova

We extend results of Videla and Fukuzaki to define algebraic integers in large classes of infinite algebraic extensions of Q and use these definitions for some of the fields to show the first-order undecidability. We also obtain a…

Number Theory · Mathematics 2014-10-23 Alexandra Shlapentokh

We use Bowen's definition of topological entropy and Ahlfors five islands theorem, as well as the theory of polynomial-like mappings, to show that the topological entropy of any entire transcendental function is infinity. In addition the…

Dynamical Systems · Mathematics 2020-11-05 Markus Wendt

Given an algebraic differential equation of order greater than one, it is shown that if there is any nontrivial algebraic relation amongst any number of distinct nonalgebraic solutions, along with their derivatives, then there is already…

Algebraic Geometry · Mathematics 2022-11-23 James Freitag , Rémi Jaoui , Rahim Moosa

We prove first-order definability of the prime subring inside polynomial rings, whose coefficient rings are (commutative unital) reduced and indecomposable. This is achieved by means of a uniform formula in the language of rings with…

Logic · Mathematics 2020-05-22 Marco Barone , Nicolás Caro , Eudes Naziazeno

This paper presents a theory of systemic undecidability, reframing incomputability as a structural property of systems rather than a localized feature of specific functions or problems. We define a notion of causal embedding and prove a…

Logic in Computer Science · Computer Science 2025-09-03 Seth Bulin

We consider the lower order eigenvalues of poly-Laplacian with any order on spherical domains. We obtain universal inequalities for them and show that our results are optimal.

Differential Geometry · Mathematics 2009-10-22 Guangyue Huang , Bingqing Ma

We prove that every finite distributive lattice is isomorphic to a final segment of the d.c.e. Turing degrees (i.e., the degrees of differences of computably enumerable sets). As a corollary, we are able to infer the undecidability of the…

Logic · Mathematics 2024-03-22 Steffen Lempp , Yiqun Liu , Yong Liu , Keng Meng Ng , Cheng Peng , Guohua Wu

As an extension of the classical irreducibility result of Dumas, a factorization result for polynomials over any valued field with a Krull valuation of arbitrary rank is proved. Further, a lower degree factor bound on factors of a given…

Number Theory · Mathematics 2025-11-27 Rishu Garg , Jitender Singh

The general description of superintegrable systems with one polynomial integral of order $N$ in the momenta is presented for a Hamiltonian system in two-dimensional Euclidean plane. We consider classical and quantum Hamiltonian systems…

Mathematical Physics · Physics 2018-09-10 A. M. Escobar-Ruiz , P. Winternitz , I. Yurdusen

Polymodal provability logic GLP is incomplete w.r.t. Kripke frames. It is known to be complete w.r.t. topological semantics, where the diamond modalities correspond to topological derivative operations. However, the topologies needed for…

Logic · Mathematics 2024-07-16 Lev D. Beklemishev , Yunsong Wang

The paper presents a solution to the long-standing question about the decidability of the two-variable fragment of the superintuitionistic predicate logic $\mathbf{QLC}$ defined by the class of linear Kripke frames, which is also the…

Logic · Mathematics 2025-10-06 Mikhail Rybakov

We supply basic tools for the study of the topological order of a multiplet which is an eigenspace of a finite-dimensional normal operator with continuous parameters. We allow intrinsic degeneracies within the multiplet where a well-known…

Mesoscale and Nanoscale Physics · Physics 2009-11-10 Yasuhiro Hatsugai

We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…

Rings and Algebras · Mathematics 2019-10-31 Juan Orendain