Results 51 to 60 of about 387 (145)
An algebraic version of the Cantor-Bernstein-Schröder theorem [PDF]
, 2004 summary:The Cantor-Bernstein-Schröder theorem of the set theory was generalized by Sikorski and Tarski to $\sigma $-complete boolean algebras, and recently by several authors to other algebraic structures.
Freytes, Hector
core +1 more source
Measure and Integration on Boolean Algebras of Regular Open Subsets in a Topological Space
, 2022 International audienceThe regular open subsets of a topological space form a Boolean algebra, where the join of two regular open sets is the interior of the closure of their union.
Pivato, Marcus, Vergopoulos, Vassili
core +1 more source
Boundary Algebra: A Simpler Approach to Boolean Algebra and the Sentential Connectives [PDF]
Boundary algebra [BA] is a algebra of type , and a simplified notation for Spencer-Brown’s (1969) primary algebra. The syntax of the primary arithmetic [PA] consists of two atoms, () and the blank page, concatenation, and enclosure between ‘(‘ and ...
Philip Meguire
core
Online and Feasible Presentability: From Trees to Modal Algebras [PDF]
We investigate whether every computable member of a given class of structures admits a fully primitive recursive (also known as punctual) or fully P-TIME copy. A class with this property is referred to as punctually robust or P-TIME robust, respectively.
Wrocławski, Michał +2 more
core +1 more source
07441 Summary – Algorithmic-Logical Theory of Infinite Structures
, 2008 One of the important research fields of theoretical and applied computer science and mathematics is the study of algorithmic, logical and model theoretic properties of structures and their interactions.
Downey, Rod +4 more
core +1 more source
A new bound for the 2/3 conjecture [PDF]
, 2012 We show that any n-vertex complete graph with edges coloured with three colours contains a set of at most four vertices such that the number of the neighbours of these vertices in one of the colours is at least 2n/3.
Sereni, Jean-Sébastien +10 more
core +1 more source
Hirschfeldt; Degree spectra of relations on Boolean algebras, Algebra and Logic 42
, 2003 We show that every computable relation on a computable Boolean algebra B is either definable by a quantifier-free formula with constants from B (in which case it is obviously intrinsically computable) or has infinite degree spectrum.
Sergey S. Goncharov +2 more
core
SOFT BOOLEAN ALGEBRA AND ITS PROPERTIES
, 2015 Molodtsov [21] introduced the concept of soft theory which can be used as a generic mathematical tool for dealing with uncertainty. In this paper, we apply the notion of the soft set theory of Molodtsov to the theory of Boolean algebras which is a well ...
Sahin, Ridvan, Küçük, Ahmet
core
, 2012 REA's Essentials provide quick and easy access to critical information in a variety of different fields, ranging from the most basic to the most advanced.
Solomon, Alan D
core
Complemented subsets and Boolean-valued, partial functions
We study the two algebras of complemented subsets that were introduced in the constructive development of the Daniell approach to measure and integration within Bishop-style constructive mathematics.
Petrakis, Iosif +1 more
core +1 more source