Synthesis of ESI Equivalence Class Combinational Circuit Mutants

1997 ◽  
Author(s):  
J. Harlow ◽  
F. Brglez
Keyword(s):  
Equivalence Class ◽  
Combinational Circuit

scholarly journals First among equals: co-hyperintensionality for structured propositions

Synthese ◽  
2020 ◽  
Author(s):  
Bjørn Jespersen
Keyword(s):  
Equivalence Class ◽  
Test Case ◽  
Structured Propositions ◽  
Fine Grained ◽  
Semantic Difference ◽  
Logical Equivalence ◽  
Structural Identity ◽  
Identity Based ◽  
Structural Isomorphism

AbstractTheories of structured meanings are designed to generate fine-grained meanings, but they are also liable to overgenerate structures, thus drawing structural distinctions without a semantic difference. I recommend the proliferation of very fine-grained structures, so that we are able to draw any semantic distinctions we think we might need. But, in order to contain overgeneration, I argue we should insert some degree of individuation between logical equivalence and structural identity based on structural isomorphism. The idea amounts to forming an equivalence class of different structures according to one or more formal criteria and designating a privileged element as a representative of all the elements, i.e., a first among equals. The proposed method helps us to a cluster of notions of co-hyperintensionality. As a test case, I consider a recent objection levelled against the act theory of structured propositions. I also respond to an objection against my methodology.

scholarly journals Minimal diagrams of free knots

2014 ◽  
Vol 23 (06) ◽  
pp. 1450032
Author(s):  
Tomas Boothby ◽  
Allison Henrich ◽  
Alexander Leaf
Keyword(s):  
Equivalence Class ◽  
Virtual Knots ◽  
Knot Diagrams

Manturov recently introduced the idea of a free knot, i.e. an equivalence class of virtual knots where equivalence is generated by crossing change and virtualization moves. He showed that if a free knot diagram is associated to a graph that is irreducibly odd, then it is minimal with respect to the number of classical crossings. Not all minimal diagrams of free knots are associated to irreducibly odd graphs, however. We introduce a family of free knot diagrams that arise from certain permutations that are minimal but not irreducibly odd.

A CMOS combinational circuit-design method using mixed logic concepts

1995 ◽  
Vol 38 (3) ◽  
pp. 266-273 ◽  
Author(s):  
W.B. Hudson ◽  
J.S. Beasley ◽  
J.E. Steelman
Keyword(s):  
Circuit Design ◽  
Design Method ◽  
Combinational Circuit

scholarly journals Eigenvalues and strong orbit equivalence

2015 ◽  
Vol 36 (8) ◽  
pp. 2419-2440 ◽  
Author(s):  
MARÍA ISABEL CORTEZ ◽  
FABIEN DURAND ◽  
SAMUEL PETITE
Keyword(s):  
Equivalence Class ◽  
Quotient Group ◽  
Additive Group ◽  
Orbit Equivalence ◽  
Dimension Group ◽  
Torsion Free

We give conditions on the subgroups of the circle to be realized as the subgroups of eigenvalues of minimal Cantor systems belonging to a determined strong orbit equivalence class. Actually, the additive group of continuous eigenvalues $E(X,T)$ of the minimal Cantor system $(X,T)$ is a subgroup of the intersection $I(X,T)$ of all the images of the dimension group by its traces. We show, whenever the infinitesimal subgroup of the dimension group associated with $(X,T)$ is trivial, the quotient group $I(X,T)/E(X,T)$ is torsion free. We give examples with non-trivial infinitesimal subgroups where this property fails. We also provide some realization results.

Mitigating single-event multiple transients in a combinational circuit based on standard cells

2020 ◽  
Vol 109 ◽  
pp. 113649
Author(s):  
Wen Zhao ◽  
Wei Chen ◽  
Chaohui He ◽  
Rongmei Chen ◽  
Peitian Cong ◽  
...  
Keyword(s):  
Single Event ◽  
Combinational Circuit ◽  
Standard Cells
Sign in / Sign up

Export Citation Format

Share Document