English
Related papers

Related papers: Two examples concerning existential undecidability…

200 papers

We give an upper bound for the norm of the determinant of additively indecomposable, totally positive definite quadratic forms defined over the ring of integers of totally real number fields. We apply these results to find lower and upper…

Number Theory · Mathematics 2025-10-10 Magdaléna Tinková , Pavlo Yatsyna

In this paper, we consider iterative propositional calculi, which are finite sets of propositional formulas together with the rules of modus ponens and weak substitution (when formula being substituted must be already inferred). We…

Logic · Mathematics 2015-04-23 Grigoriy V. Bokov

Permutation polynomials over finite fields have taken an important role in vast areas in mathematics as well as engineering. Recently, Tu et al. gave some classes of complete permutation polynomials over finite fields of even…

Number Theory · Mathematics 2014-04-14 Kitae Kim , Ikkwon Yie

Let F be a field of characteristic different from 2. The u-invariant and the Hasse number of a field F are classical and important field invariants pertaining to quadratic forms. These invariants measure the suprema of dimensions of…

Rings and Algebras · Mathematics 2010-04-15 Detlev W. Hoffmann

We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require…

Logic in Computer Science · Computer Science 2019-07-01 Daniel Danielski , Emanuel Kieronski

In this paper we prove undecidability of finite systems of equations in free Lie algebras of rank at least three over an arbitrary field. We show that the ring of integers $\mathbb{Z}$ is interpretable by positive existential formulas in…

Logic · Mathematics 2017-08-25 Olga Kharlampovich , Alexei Myasnikov

We study completeness in partial differential varieties. We generalize many results from ordinary differential fields to the partial differential setting. In particular, we establish a valuative criterion for differential completeness and…

Logic · Mathematics 2012-02-06 James Freitag

This dissertation introduces executable refinement types, which refine structural types by semi-decidable predicates, and establishes their metatheory and accompanying implementation techniques. These results are useful for undecidable type…

Programming Languages · Computer Science 2014-03-14 Kenneth Knowles

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

Formal Languages and Automata Theory · Computer Science 2017-03-01 Jörg Endrullis , Jeffrey Shallit , Tim Smith

This paper builds fundamental perfect fields of positive characteristic and shows the structure of perfect fields that a field of positive characteristic is a perfect field if and only if it is an algebraic extension of a fundamental…

Commutative Algebra · Mathematics 2014-08-12 Duong Quoc Viet , Truong Thi Hong Thanh

We expand the notion of characteristic formula to infinite finitely presentable subdirectly irreducible algebras. We prove that there is a continuum of varieties of Heyting algebras containing infinite finitely presentable subdirectly…

Logic in Computer Science · Computer Science 2012-08-14 Alex Citkin

We consider the dimensions of finite type of representations of a partially ordered set, i.e. such that there is only finitely many isomorphism classes of representations of this dimension. We give a criterion for a dimension to be of…

Representation Theory · Mathematics 2012-01-24 Yuriy A. Drozd , Eugene A. Kubichka

We introduce the notion of differential largeness for fields equipped with several commuting derivations (as an analogue to largeness of fields). We lay out the foundations of this new class of "tame" differential fields. We state several…

Algebraic Geometry · Mathematics 2024-02-07 Omar León Sánchez , Marcus Tressl

We study finite imaginaries in certain valued fields, and prove a conjecture of Cluckers and Denef.

Logic · Mathematics 2009-02-06 Ehud Hrushovski

In this paper, we study additively indecomposable quadratic forms over real biquadratic and simplest cubic fields. In particular, we show that over these fields, we can always find such a classical form in 2 variables, which differs from…

Number Theory · Mathematics 2026-02-10 Simona Fryšová , Magdaléna Tinková

Differential algebraic geometry seeks to extend the results of its algebraic counterpart to objects defined by differential equations. Many notions, such as that of a projective algebraic variety, have close differential analogues but their…

Algebraic Geometry · Mathematics 2015-05-14 William D. Simmons

The u-invariant of a field is the largest dimension of an anisotropic quadratic torsion form over the field. In this article we obtain a bound on the u-invariant of function fields in one variable over a henselian valued field with…

Number Theory · Mathematics 2025-08-18 Karim Johannes Becher , Nicolas Daans , Vlerë Mehmeti

We prove that the isomorphism problem for finitely generated fully residually free groups is decidable. We also show that each finitely generated fully residually free group G has a decomposition that is invariant under automorphisms of G,…

Group Theory · Mathematics 2007-05-23 Inna Bumagin , Olga Kharlampovich , Alexei Miasnikov

We study function fields of curves over a base field $K$ which is either a global field or a large field having a separable field extension of degree divisible by $4$. We show that, for any such function field, Hilbert's 10th Problem has a…

Number Theory · Mathematics 2025-09-24 Karim Johannes Becher , Nicolas Daans , Philip Dittmann

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
‹ Prev 1 3 4 5 6 7 10 Next ›