Javascript must be enabled to continue!
Commutative action logic
View through CrossRef
AbstractWe prove undecidability and pinpoint the place in the arithmetical hierarchy for commutative action logic, i.e. the equational theory of commutative residuated Kleene lattices (action lattices), and infinitary commutative action logic, the equational theory of *-continuous commutative action lattices. Namely, we prove that the former is $\varSigma _1^0$-complete and the latter is $\varPi _1^0$-complete. Thus, the situation is the same as in the more well-studied non-commutative case. The methods used, however, are different: we encode infinite and circular computations of counter (Minsky) machines.
Title: Commutative action logic
Description:
AbstractWe prove undecidability and pinpoint the place in the arithmetical hierarchy for commutative action logic, i.
e.
the equational theory of commutative residuated Kleene lattices (action lattices), and infinitary commutative action logic, the equational theory of *-continuous commutative action lattices.
Namely, we prove that the former is $\varSigma _1^0$-complete and the latter is $\varPi _1^0$-complete.
Thus, the situation is the same as in the more well-studied non-commutative case.
The methods used, however, are different: we encode infinite and circular computations of counter (Minsky) machines.
Related Results
Bipartite through Prescribed Median and Antimedian of a Commutative Ring with Respect to an Ideal
Bipartite through Prescribed Median and Antimedian of a Commutative Ring with Respect to an Ideal
Introduction: There are plenty of ways of partners with arithmetical constructions. Some of them to make reference to are bipartite from gatherings, median and anti – median from c...
MECHANISMS OF SCHEMATIC MODELING BASED ON VECTOR LOGIC
MECHANISMS OF SCHEMATIC MODELING BASED ON VECTOR LOGIC
Context. This paper addresses issues relevant to the EDA market – reducing the cost and time of testing and verification of digital projects by synthesizing the logic vector of a d...
Logic in the early 20th century
Logic in the early 20th century
The creation of modern logic is one of the most stunning achievements of mathematics and philosophy in the twentieth century. Modern logic – sometimes called logistic, symbolic log...
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
<p>Approximate cells can be used to design Ripple Carry Adders (RCAs) for realizing approximate addition in energy-efficient CMOS digital circuits. As inputs of approximate c...
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
On the Commutative Operation of Approximate CMOS Ripple Carry Adders (RCAs)
Approximate cells can be used to design Ripple Carry Adders (RCAs) for
realizing approximate addition in energy-efficient CMOS digital
circuits. As inputs of approximate cells coul...
A Novel Method for Developing Post-quantum Digital Signature Algorithms on Non-commutative Associative Algebras
A Novel Method for Developing Post-quantum Digital Signature Algorithms on Non-commutative Associative Algebras
Introduction: Development of practical post-quantum signature algorithms is a current challenge in the area of cryptography. Recently, several candidates on post-quantum signature ...
Memristor-Based Priority Encoder and Decoder Circuit
Memristor-Based Priority Encoder and Decoder Circuit
Introduction:
Memristors, recognized as the fourth fundamental circuit element, exhibit unique features
such as non-volatility, scalability, and energy efficien...
Categories of Commutative Algebras
Categories of Commutative Algebras
Abstract
This book studies the universal constructions and properties in categories of commutative algebras, bringing out the specific properties that make commutati...

