English
Related papers

Related papers: Semantic Limits of Positive Existential Reasoning …

200 papers

An extension of algebras is a homomorphism of algebras preserving identities. We use extensions of algebras to study the finitistic dimension conjecture over Artin algebras. Let $f: B \to A$ be an extension of Artin algebras. We denote by…

Rings and Algebras · Mathematics 2018-03-01 Shufeng Guo

The behavior of factorization properties in various ring extensions is a central theme in commutative algebra. Classically, the UFDs are (completely) integrally closed and tend to behave well in standard ring extensions, with the notable…

Commutative Algebra · Mathematics 2025-04-16 Jason Boynton , Jim Coykendall , Grant Moles , Chelsey Morrow

Using the functional interpretation from proof theory, we analyze nonconstructive proofs of several central theorems about polynomial and differential polynomial rings. We extract effective bounds, some of which are new to the literature,…

Logic · Mathematics 2018-10-17 William Simmons , Henry Towsner

The Aristotelian syllogistic cannot account for the validity of many inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a)…

Logic in Computer Science · Computer Science 2024-04-24 Ian Pratt-Hartmann , Lawrence S. Moss

This paper investigates some issues arising in categorical models of reversible logic and computation. Our claim is that the structural (coherence) isomorphisms of these categorical models, although generally overlooked, have decidedly…

Category Theory · Mathematics 2013-04-29 Peter Hines

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

Rings and Algebras · Mathematics 2022-06-16 A. J. Kanel-Belov , I. A. Melnikov , I. V. Mitrofanov

We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable…

Logic · Mathematics 2014-04-16 Lauri Hella , Antti Kuusisto

One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks of existential (universal) quantifiers that leave at most one variable free. We investigate this fragment over words and trees, presenting a…

Logic in Computer Science · Computer Science 2024-04-08 Emanuel Kieronski , Antti Kuusisto

We contemplate a higher-level bipolar abstract argumentation for non-elementary arguments such as: X argues against Ys sincerity with the fact that Y has presented his argument to draw a conclusion C, by omitting other facts which would not…

Artificial Intelligence · Computer Science 2019-01-21 Ryuta Arisaka , Stefano Bistarelli , Francesco Santini

We propose a novel constructive framework for approaching the Hodge Conjecture via explicit degenerations. Building on limiting mixed Hodge structures (LMHS), we formulate a criterion under which a rational class of type (p, p) on a smooth…

Algebraic Geometry · Mathematics 2025-07-22 Badre Mounda

In this memoir, we seek to construct a dynamical theory as complete as possible to describe the algebraic properties of the field of real numbers in constructive mathematics without axiom of dependent choice. We propose a theory which turns…

Logic · Mathematics 2024-10-18 Henri Lombardi , Assia Mahboubi

This paper introduces an abstract notion of fragments of monadic second-order logic. This concept is based on purely syntactic closure properties. We show that over finite words, every logical fragment defines a lattice of languages with…

Formal Languages and Automata Theory · Computer Science 2015-03-20 Manfred Kufleitner , Alexander Lauser

We extend the framework of abstract algebraic logic to weak logics, namely logical systems which are not necessarily closed under uniform substitution. We interpret weak logics by algebras expanded with an additional predicate and we…

Logic · Mathematics 2026-01-16 Georgi Nakov , Davide Emilio Quadrellaro

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

We prove model completeness for the theory of addition and the Frobenius map for certain subrings of rational functions in positive characteristic. More precisely: Let $p$ be a prime number, $\mathbb{F}_{p}$ the prime field with $p$…

Logic · Mathematics 2021-07-26 Dimitra Chompitaki , Manos Kamarianakis , Thanases Pheidas

We will pursue a way of building up an algebraic structure that involves, in a mathematical abstract way, the well known Grassmann variables. The problem arises when we tried to understand the grassmannian polynomial expansion on the scope…

Mathematical Physics · Physics 2007-05-23 Ricardo M Bentin

Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…

Logic in Computer Science · Computer Science 2015-07-01 Desharnais Jules , Bernhard Moeller , Struth Georg

We present constructive versions of Krull's dimension theory for commutative rings and distributive lattices. The foundations of these constructive versions are due to Joyal, Espa\~nol and the authors. We show that the notion of Krull…

Commutative Algebra · Mathematics 2018-01-03 Thierry Coquand , Henri Lombardi

Many recursive functions can be defined elegantly as the unique homomorphisms, between two algebras, two coalgebras, or one each, that are induced by some universal property of a distinguished structure. Besides the well-known applications…

Logic in Computer Science · Computer Science 2015-06-25 Baltasar Trancón y Widemann , Michael Hauhs

Our understanding about things is conceptual. By stating that we reason about objects, it is in fact not the objects but concepts referring to them that we manipulate. Now, so long just as we acknowledge infinitely extending notions such as…

Artificial Intelligence · Computer Science 2015-04-21 Ryuta Arisaka