English
Related papers

Related papers: Boolean and ortho fuzzy subset logics

200 papers

It has previously been an open problem whether all Boolean submodular functions can be decomposed into a sum of binary submodular functions over a possibly larger set of variables. This problem has been considered within several different…

Discrete Mathematics · Computer Science 2009-09-09 Stanislav Zivny , David A. Cohen , Peter G. Jeavons

The theory of fuzzy semigroups is a branch of mathematics that arose in early 90's as an effort to characterize properties of semigroups by the properties of their fuzzy subsystems which include, fuzzy subsemigroups and their alike, fuzzy…

General Mathematics · Mathematics 2023-10-11 Anjeza Krakulli , Elton Pasku

We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More…

Logic in Computer Science · Computer Science 2017-06-28 Carlos Caleiro , Sérgio Marcelino , João Marcos

By a Ruspini partition we mean a finite family of fuzzy sets $\{f_1, \ldots, f_n\}$, $f_i : [0,1] \to [0,1]$, such that $\sum_{i=1}^n f_i(x)=1$ for all $x \in [0,1]$, where $[0,1]$ denotes the real unit interval. We analyze such partitions…

Logic in Computer Science · Computer Science 2014-01-22 Pietro Codara , Ottavio M. D'Antona , Vincenzo Marra

We consider a combinatorial problem occurring naturally in a group theoretical setting and provide a constructive solution in a special case. More precisely, in 1999 the author established a logarithmic bound for the derived length of the…

Combinatorics · Mathematics 2014-07-18 Thomas Michael Keller

Simulations and bisimulations are well-established notions in crisp/fuzzy automata theory and are widely used to compare the behaviors of automata. Their main drawback is that they compare the behaviors of fuzzy automata in a crisp manner.…

Formal Languages and Automata Theory · Computer Science 2023-07-10 Linh Anh Nguyen , Ivana Micić , Stefan Stanimirović

The context of this work is that of partial frames; these are meet-semilattices where not all subsets need have joins. A selection function, S, specifies, for all meet-semilattices, certain subsets under consideration, which we call the…

General Topology · Mathematics 2023-06-22 Anneliese Schauerte , John Frith

Boolean locales are "almost discrete", in the sense that a spatial Boolean locale is just a discrete locale (that is, it corresponds to the frame of open subsets of a discrete space, namely the powerset of a set). This basic fact, however,…

Logic · Mathematics 2024-02-14 Francesco Ciraulo

We describe a feasible logic Bell-state analysis protocol by employing the logic entanglement to be the robust concatenated Greenberger-Horne-Zeilinger (C-GHZ) state. This protocol only uses polarization beam splitters and half-wave plates,…

Quantum Physics · Physics 2015-11-18 Lan Zhou , Yu-Bo Sheng

The notions of infimum and maximal lower bounds of a set $\mathfrak M$ of bounded self-adjoint operators were mainly studied for a set $\mathfrak M$ of two elements. The present paper deals with more general sets $\mathfrak M$, where it is…

Functional Analysis · Mathematics 2026-04-27 Matthias Günther , Lutz Klotz

We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…

Logic in Computer Science · Computer Science 2016-11-01 Robert Constable , Mark Bickford

Backdoors and backbones of Boolean formulas are hidden structural properties. A natural goal, already in part realized, is that solver algorithms seek to obtain substantially better performance by exploiting these structures. However, the…

Artificial Intelligence · Computer Science 2018-11-05 Lane A. Hemaspaandra , David E. Narváez

Timed temporal logics exhibit a bewildering diversity of operators and the resulting decidability and expressiveness properties also vary considerably. We study the expressive power of timed logics TPTL[U,S] and MTL[U,S] as well as of their…

Logic in Computer Science · Computer Science 2013-05-16 Paritosh K. Pandya , Simoni S. Shah

There are two known general results on the finite model property (fmp) of commutators [L,L'] (bimodal logics with commuting and confluent modalities). If L is finitely axiomatisable by modal formulas having universal Horn first-order…

Logic in Computer Science · Computer Science 2017-10-18 Agi Kurucz

Combining symbolic and neural approaches has gained considerable attention in the AI community, as it is often argued that the strengths and weaknesses of these approaches are complementary. One such trend in the literature are weakly…

Artificial Intelligence · Computer Science 2020-06-08 Emile van Krieken , Erman Acar , Frank van Harmelen

A notorious open question in circuit complexity is whether Boolean operations of arbitrary arity can efficiently be expressed using modular counting gates only. H{\aa}stad's celebrated switching lemma yields exponential lower bounds for the…

Computational Complexity · Computer Science 2026-04-07 Benedikt Pago

We show that an Artinian quotient of K[x, y, z] by an ideal I generated by powers of linear forms has the Weak Lefschetz property. If the syzygy bundle of I is semistable this follows from results of Brenner-Kaid; our proof works without…

Commutative Algebra · Mathematics 2012-01-31 Hal Schenck , Alexandra Seceleanu

Let $\mathfrak{g}$ be a $2n$-dimensional unimodular Lie algebra equipped with a Hermitian structure $(J,F)$ such that the complex structure $J$ is abelian and the fundamental form $F$ is balanced. We prove that the holonomy group of the…

Differential Geometry · Mathematics 2014-12-23 Adrian Andrada , Raquel Villacampa

We characterize in terms of the Goldman Lie algebra which conjugacy classes in the fundamental group of a surface with non empty boundary are represented by simple closed curves. We prove the following: A non power conjugacy class X…

Geometric Topology · Mathematics 2015-09-30 Moira Chas , Fabiana Krongold

For some fixed alphabet A, a language L of A* is in the class L(1/2) of the Straubing-Therien hierarchy if and only if it can be expressed as a finite union of languages A*aA*bA*...A*cA*, where a,b,...,c are letters. The class L(1) is…

Computational Complexity · Computer Science 2016-01-18 Heinz Schmitz , Klaus W. Wagner
‹ Prev 1 4 5 6 7 8 10 Next ›