English
Related papers

Related papers: Extension by Conservation. Sikorski's Theorem

200 papers

Birkhoff's representation theorem for finite distributive lattices states that any finite distributive lattice is isomorphic to the lattice of order ideals (lower sets) of the partial order of the join-irreducible elements of the lattice.…

Combinatorics · Mathematics 2026-03-17 Dale R. Worley

We investigate the duality between algebraic and coalgebraic recognition of languages to derive a generalization of the local version of Eilenberg's theorem. This theorem states that the lattice of all boolean algebras of regular languages…

Formal Languages and Automata Theory · Computer Science 2015-01-19 Jiri Adamek , Stefan Milius , Robert Myers , Henning Urbat

In this paper we introduce a new kind of topological space, called 'structured space', which locally resembles various kinds of algebraic structures. This can be useful, for instance, to locally study a space that cannot be globally endowed…

General Mathematics · Mathematics 2020-03-27 Manuel Norman

We define and study entanglement of continuous positive definite functions on products of compact groups. We formulate and prove an infinite-dimensional analog of Horodecki Theorem, giving a necessary and sufficient criterion for…

Quantum Physics · Physics 2009-11-13 J. K. Korbicz , J. Wehr , M. Lewenstein

We provide new equivalent conditions for an algebra $\Lambda$ to be $g$-finite, analogous to those established by L. Demonet, O. Iyama, and G. Jasso, but within the category of projective presentations $\mathcal{K}^{[-1,0]}(\text{proj}…

Representation Theory · Mathematics 2024-06-21 Monica Garcia

We propose to use Tarski's least fixpoint theorem as a basis to define recursive functions in the calculus of inductive constructions. This widens the class of functions that can be modeled in type-theory based theorem proving tool to…

Logic in Computer Science · Computer Science 2007-05-23 Yves Bertot

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Discrete Mathematics · Computer Science 2017-08-08 Emmanuel Jeandel

This work contributes to the domains of Boolean algebra and of Bayesian probability, by proposing an algebraic extension of Boolean algebras, which implements an operator for the Bayesian conditional inference and is closed under this…

Logic · Mathematics 2011-12-19 Frederic Dambreville

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

Logic · Mathematics 2013-05-21 Tarek Sayed Ahmed

Building over recent results, we expand the basic theory of algebraic extensions to the realm of superfields -a field with multivalued sum and product-, showing that every superfield has a (unique up to isomorphism) strong algebraic…

Commutative Algebra · Mathematics 2023-01-18 Kaique Matias de Andrade Roberto , Hugo Luiz Mariano , Hugo Rafael de Oliveira Ribeiro

The objective of this paper is to describe the structure of Zariski closed algebras, which provide a useful generalization to finite dimensional algebras in the study of representable algebras over finite fields. Our results include a…

Rings and Algebras · Mathematics 2011-09-23 Alexei Belov-Kanel , Louis H. Rowen , Uzi Vishne

For any Legendrian knot or link in $\mathbb{R}^3$, we construct an $L_\infty$ algebra that can be viewed as an extension of the Chekanov-Eliashberg differential graded algebra. The $L_\infty$ structure incorporates information from rational…

Symplectic Geometry · Mathematics 2025-07-21 Lenhard Ng

In this note we give an axiomatization of Boolean algebras based on weakly dicomplemented lattices: an algebra $(L,\wedge,\vee,\tu)$ of type $(2,2,1)$ is a Boolean algebra iff $(L,\wedge,\vee)$ is a non empty lattice and $(x\wedge…

Logic · Mathematics 2009-07-08 Leonard Kwuida

We prove that if $B\subseteq A$ is an extension of finite dimensional algebras such that the projective dimension of $A/B$ as a $B$-bimodule is finite, if $A$ has finite finitistic dimension, then so does $B$. We exhibit examples…

Representation Theory · Mathematics 2023-06-06 John William MacQuarrie , Fernando dos Reis Naves

We introduce the notion of infinitary interpretation of structures. In general, an interpretation between structures induces a continuous homomorphism between their automorphism groups, and furthermore, it induces a functor between the…

Logic · Mathematics 2019-02-20 Matthew Harrison-Trainor , Russell Miller , Antonio Montalbán

We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…

Logic · Mathematics 2012-07-25 Michael C. Laskowski

Bilattices (that is, sets with two lattice structures) provide an algebraic tool to model simultaneously the validity of, and knowledge about, sentences in an appropriate language. In particular, certain bilattices have been used to model…

Rings and Algebras · Mathematics 2013-11-13 L. M. Cabrer , A. P. K. Craig , H. A. Priestley

Given a compact of ${\bf R}^n$, there is always a doubling measure having it as its support. We use this fact to construct an integral operator that extends differentiable functions defined on any compact set of ${\bf R}^n$ to the whole of…

Classical Analysis and ODEs · Mathematics 2007-05-23 Jaume Gudayol

We consider several distinct characterizations of finite implication algebras. One of these leads to a new characterization of Boolean polymatroids.

Combinatorics · Mathematics 2009-02-03 Colin Bailey , Joseph Oliveira

We introduce the Birkhoff completion as the smallest distributive lattice in which a given finite lattice can be embedded as semi-lattice. We discuss its relationship to implicational theories, in particular to R. Wille's…

Discrete Mathematics · Computer Science 2024-05-07 Mohammad Abdulla , Johannes Hirth , Gerd Stumme
‹ Prev 1 3 4 5 6 7 10 Next ›