Results 51 to 60 of about 2,012 (164)

The characterization of Nelson algebras by Sheffer stroke

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica
In this study, Sheffer stroke Nelson algebras (briefly, s-Nelson algebras), (ultra) ideals, quasi-subalgebras, quotient sets, and fuzzy structures on these algebraic structures are introduced.
Oner Tahsin, Katican Tugce, Saeid Arsham Borumand   +2 more
doaj   +1 more source

Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors [PDF]

Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘
Philip Meguire
core  

P-model Alternative to the T-model [PDF]

, 2004
Standard linguistic analysis of syntax uses the T-model. This model requires the ordering: D-structure $>$ S-structure $>$ LF, where D-structure is the deep structure, S-structure is the surface structure, and LF is logical form.
Roberts, Mark D.
core  

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  

Quantum Algorithm for Dynamic Programming Approach for DAGs. Applications for Zhegalkin Polynomial Evaluation and Some Problems on DAGs

, 2019
In this paper, we present a quantum algorithm for dynamic programming approach for problems on directed acyclic graphs (DAGs). The running time of the algorithm is $O(\sqrt{\hat{n}m}\log \hat{n})$, and the running time of the best known deterministic ...
A Ambainis, A Ambainis, A Ambainis, AM Childs, C Dürr, C Dürr, F Ablayev, F Ablayev, F Ablayev, F Ablayev, F Ablayev, F Gall Le, G Brassard, I Zhegalkin, K Khadiev, K Khadiev, M Boyer, MA Nielsen, R Ibrahimov, S Arora, S Dörn, SG Gindikin, SV Yablonsky, TH Cormen   +23 more
core   +1 more source

Interval sheffer stroke basic algebras

, 2019
In this paper we deal with Sheffer stroke basic algebras A = (A; |), and we define the operations for any elements a, b ? A in such a way that become also Sheffer Stroke basic algebras, respectively. Subsequeutly, we show that these interval Sheffer Stroke basic algebras on a given Sheffer Stroke basic algebra A = (A; |) verify the patchwork condition.
Oner T., Katican T., Ülker A.
openaire   +8 more sources

Shading Curves: Vector-Based Drawing With Explicit Gradient Control [PDF]

, 2015
A challenge in vector graphics is to define primitives that offer flexible manipulation of colour gradients. We propose a new primitive, called a shading curve, that supports explicit and local gradient control.
Dodgson, NA, Kosinka, J, Lieng, H, Tasse, F   +3 more
core   +3 more sources

Sheffer stroke işlemi üzerine

, 2021
This thesis essentially consists of six chapters. In the first chapter, we mentioned the traces of Sheffer stroke operation, Hilbert, nonassociative MV- and BL-algebras, their usage areas and many applications. Also, we presented information about different results of the researchers and summarized the contents of the chapters comprising the thesis. In
openaire   +1 more source

The Cowl - Special Issue - Oct. 12, 1995 [PDF]

, 1995
The Cowl - student newspaper of Providence College. Special Issue - Oct. 12, 1995.

core   +1 more source

Virtual Evidence: A Constructive Semantics for Classical Logics [PDF]

, 2014
This article presents a computational semantics for classical logic using constructive type theory. Such semantics seems impossible because classical logic allows the Law of Excluded Middle (LEM), not accepted in constructive logic since it does not have
Constable, Robert L.
core