Logic Transformation Research Articles

From Ojibwa to Dakota: Toward a Typology of Semantic Transformations in American Indian Languages

In this article we propose a radical new typological approach to the diversity of North American languages that is directly inspired by Claude Lévi-Strauss’s Mythologiques and his concept of transformation. As with mythology, the semantic dimension of phenomena is crucial. A comparison between the grammars of an Algonquian and a Siouan language will serve as a first illustration of the logical transformations linking two language families that previously have been considered to be fundamentally distinct. A parallel appears between the results obtained and those stemming from a comparison between the principal ritual manifestations of Sioux culture and Subarctic Algonquian culture.

QUANTUM SECRET ENCRYPTION AND DECRYPTION IN CAVITY QED

We present a proposal of the quantum secret encryption, transmission, and decryption implementation for quantum secret-sharing protocol using cavity QED. In the proposed scheme, the information is stored in two identical two-level atoms, and the two-qubit logic transformation is realized through the interaction between atoms and a nonresonant cavity mode. The proposed scheme requires no ancilla states to assist the intermediate atomic transitions and conditional quantum dynamics for quantum phase flip and quantum state diffusion. The encryption and decryption of quantum states are mostly governed by the Hamiltonian of an atom-cavity system. Moreover, secret transmission using quasi-swap gates for entanglement swapping has also been presented. With fewer supplements of external fields, a speed quantum protocol can be realized without universal gates.

What does it mean to say that a physical system implements a computation?

When we are concerned with the logical form of a computation and its formal properties, then it can be theoretically described in terms of mathematical and logical functions and relations between abstract entities. However, actual computation is realised by some physical process, and the latter is of course subject to physical laws and the laws of thermodynamics in particular. An issue that has been the subject of much controversy is that of whether or not there are any systematic connections between the logical properties of computations considered abstractly and the thermodynamical properties of their concrete physical realizations. Landauer [R. Landauer, Irreversibility and heat generation in the computing process, IBM Journal of Research and Development 5 (1961) 183–191. Reprinted in Leff and Rex (1990)] proposed such a general connection, known as Landauer’s Principle. To resolve this matter an analysis of the notion of the implementation of a computation by a physical system is clearly required. Another issue that calls for an analysis of implementation is that of realism about computation. The account of implementation presented here is based on the notion of an L - machine. This is a hybrid physical-logical entity that combines a physical device, a specification of which physical states of that device correspond to various logical states, and an evolution of that device which corresponds to the logical transformation L . The most general form of Landauer’s Principle can be precisely stated in terms of L -machines, namely that the logical irreversibility of L implies the thermodynamic irreversibility of every corresponding L -machine.

A note on reification in Hegel's logic

A note on reification in Hegel's logic

The predicament of firms in the new and old economies: a critical inquiry into traditional binaries in the study of the space-economy

Working with the assumption that the social and the material are mutually embedded, this article suggests that actors in the business world tend to separate social from material concerns despite the entanglement of these two dimensions. This disconnection — a binary logic applied in the context of blurry realities — creates problems, the resolution of which requires change in production logic. The predicament of firms is the apparent inability of actors to develop a production logic that recognizes the entwinement of the material and the social; rather than changing from a unidimensional to a multidimensional logic, strategies continuously oscillate between one unidimensional logic (emphasizing social or material concerns) and another (emphasizing the opposite), thus perpetuating the predicament. The oscillation occurs in both the old and new economies, but is compressed in the new economy. Recognizing this oscillation in the new and old economies requires dehomogenizing each to uncover problems that prompt change. Recognizing the transformation of production logics within the old and new economies requires awareness of, and retreat from, binary logic in academic analysis.

Dynamic carbon footprinting

The early focus by individual businesses on the reduction of their own carbon footprint is being superseded by a phase of building carbon-constrained business networks. Across these networks, businesses evaluate each others' footprints and conduct business accordingly. Dynamic carbon footprinting is emerging as a powerful tool for guiding operational logic and business transformation into the carbon-constrained markets, with delivery of huge reductions in greenhouse gas emissions.

Some Remarks About Russellian Incomplete Symbols

Russellian incomplete symbols are usually conceived as an analytical residue—as what remains of the would-be entities when properly analyzed. This article aims to reverse the approach in raising another question: what, if any, does the incomplete symbol contribute to the completely analyzed language? I will first show that, from a technical point of view, there is no difference between the way Russell defines his denoting phrases in “On Denoting” and the way Frege defines his second-order concepts. But I will secondly support that the two notions have two widely different conceptual meanings: the same logical procedures which are used by Frege to increase the deductive power of his system allow Russell to logically relate quantificational notation to ordinary language. Focusing on Russell’s treatment of OD’s puzzles, I will thirdly argue that this shift constitutes the source of a deep transformation in the way logic and language are related.

Some Remarks about Russellian Incomplete Symbols

Russellian incomplete symbols are usually conceived as an analytical residue—as what remains of the would-be entities when properly analyzed. This article aims to reverse the approach in raising another question: what, if any, does the incomplete symbol contribute to the completely analyzed language? I will first show that, from a technical point of view, there is no difference between the way Russell defines his denoting phrases in “On Denoting” and the way Frege defines his second-order concepts. But I will secondly support that the two notions have two widely different conceptual meanings: the same logical procedures which are used by Frege to increase the deductive power of his system allow Russell to logically relate quantificational notation to ordinary language. Focusing on Russell’s treatment of OD ’s puzzles, I will thirdly argue that this shift constitutes the source of a deep transformation in the way logic and language are related.

Circle graphs and monadic second-order logic

This article is part of a project consisting in expressing, whenever possible, graph properties and graph transformations in monadic second-order logic or in its extensions using modulo p cardinality set predicates or auxiliary linear orders. A circle graph is the intersection graph of a set of chords of a circle. Such a set is called a chord diagram. It can also be described by a word with two occurrences of each letter, called a double occurrence word. If a circle graph is prime for the split ( or join) decomposition defined by Cunnigham, it has a unique representation by a chord diagram, and this diagram can be defined by monadic second-order formulas with the even cardinality set predicate. By using the (canonical) split decomposition of a circle graph, we define in monadic second-order logic with auxiliary linear orders all its chord diagrams. This construction uses the fact that the canonical split decomposition of a graph can be constructed in monadic second-order logic with help of an arbitrary linear order. We prove that the order of first occurrences of the letters in a double occurrence word w that represents a connected circle graph determines this word in a unique way. The word w can be defined by a monadic second-order formula from the word of first occurrences of letters. We also prove that a set of circle graphs has bounded clique-width if and only if all the associated chord diagrams have bounded tree-width.

Optimization of Multi-Criteria Experiments with Fuzzy Results

The classical design of experiments (DoE) method can optimize systems with one technical response and multiple inputs. The objective of this study is to optimize multiple technical responses at the same time by integrating fuzzy logic transformation into a DoE system. The transformation from technical responses to the individual fuzzy responses and the overall fuzzy response are first defined, and the fuzzy response system is established. The method used to optimize the overall fuzzy response is introduced and discussed. The results show that the established fuzzy response system can optimize systems with multiple technical responses and multiple inputs.

Beyond the Convergence–Divergence Debate: The Role of Spatial Scales in Transforming Organizational Logic

Studies of organizational globalization typically assume that space is progressively ‘overcome’, resulting in the convergence of organizational logics, or that organizations continue to be embedded within the space of the nation state, resulting in divergent organizational logics. I argue that organizational logics are transformed as they move across space. Transformations in organizational logic are also underpinned by changes in space. I use the concept of spatial scale to theorize changes in space. I argue that spatial scales are multiple spatial levels that are produced through three interconnected processes: capital accumulation, regulation and articulation of discourse. Organizational logics are typically positioned on a number of spatial scales at once. The transformation of organizational logic is underpinned by processes of rescaling and resistance involving the political contestation of scale. I conclude by reflecting on what contributions the concept of scales makes to studies of the transformation of organizational logics.

The connection between logical and thermodynamic irreversibility

There has recently been a good deal of controversy about Landauer's Principle, which is often stated as follows: the erasure of one bit of information in a computational device is necessarily accompanied by a generation of kT ln 2 heat. This is often generalised to the claim that any logically irreversible operation cannot be implemented in a thermodynamically reversible way. Norton [2005. Eaters of the lotus: Landauer's principle and the return of Maxwell's demon. Studies in History and Philosophy of Modern Physics, 36, 375–411] and Maroney [2005. The (absence of a) relationship between thermodynamic and logical reversibility. Studies in History and Philosophy of Modern Physics, 36, 355–374] both argue that Landauer's Principle has not been shown to hold in general, and Maroney offers a method that he claims instantiates the operation Reset in a thermodynamically reversible way. In this paper we defend the qualitative form of Landauer's Principle, and clarify its quantitative consequences (assuming the second law of thermodynamics). We analyse in detail what it means for a physical system to implement a logical transformation L, and we make this precise by defining the notion of an L-machine. Then we show that logical irreversibility of L implies thermodynamic irreversibility of every corresponding L-machine. We do this in two ways. First, by assuming the phenomenological validity of the Kelvin statement of the second law, and second, by using information-theoretic reasoning. We illustrate our results with the example of the logical transformation ‘Reset’, and thereby recover the quantitative form of Landauer's Principle.

Features of the Expert-System-Shell SPIRIT

The inference process in a probabilistic and conditional environment under minimum relative entropy, permits the acquisition of basic knowledge, the consideration of - even uncertain - ad hoc knowledge, and the response to queries. Even if these procedures are well known in the relevant literature their realisation for large-scale applications needs a sophisticated tool, allowing the communication with the user as well as all relevant logical transformations and numerical calculations. SPIRIT is an Expert-System-Shell for these purposes. Even for hundreds of – consistent – facts about the involved variables’ dependencies the shell automatically generates the corresponding epistemic state, thus permitting the derivation of conclusions from the acquired knowledge. These conclusions’ reliability or precision can be checked, inviting the user to enrich the knowledge by further facts, if desired. Any inconsistencies among provided facts are detected, and their elimination will be supported by the shell. Knowledge acquisition can come from provided facts by a knowledge engineer as well as from real world data; inductive learning supports the use of such data. An important capability of the shell is the calculation of impacts upon ideas or concepts from a given stimulus. This paper is a brief survey of theoretical concepts and the corresponding features of the system, which are accompanied by illustrative examples.

Rescue

Scaling feature size improves processor performance but increases each deviceýs susceptibility to defects (i.e., hard errors). As a result, fabrication technology must improve significantly to maintain yields. Redundancy techniques in memory have been successful at improving yield in the presence of defects. Apart from core sparing which disables faulty cores in a chip multiprocessor, little has been done to target the core logic. While previous work has proposed that either inherent or added redundancy in the core logic can be used to tolerate defects, the key issues of realistic testing and fault isolation have been ignored. This paper is the first to consider testability and fault isolation in designing modern high-performance, defect-tolerant microarchitectures. We define intra-cycle logic independence (ICI) as the condition needed for conventional scan test to isolate faults quickly to the microarchitectural-block granularity. We propose logic transformations to redesign conventional superscalar microarchitecture to comply with ICI. We call our novel, testable, and defect-tolerant microarchitecture Rescue. We build a verilog model of Rescue and verify that faults can be isolated to the required precision using only conventional scan test. Using performace simulations, we show that ICI transformations reduce IPC only by 4% on average for SPEC2000 programs. Taking yield improvement into account, Rescue improves average yield-adjusted instruction throughput over core sparing by 12% and 22% at 32nm and 18nm technology nodes, respectively.

A Study of the Transformation of the Multinational Corporation into Monopolistic Industry-equity Capital from the Viewpoint of So-called ‘Goodwill’

The greenfield-type foreign direct investment (FDI) is different from the M&A-type FDI, since the latter incurs so-called‘goodwill’to the investor.Since S.Hymer, most theorists on multinational corporations (MNCs) with the exception of R.Aliber and R. Caves, have paid so little attention to this fact that they could not perceive the transformation of the MNC from industrial capital into industry-equity capital.The logical transformation of this process leads MNCs to be conglomerate-type of industry-equity capital in the last stage, in which MNCs are in pursuit for maximizing capital gains as their driving force.

Individual perception of stress in the ICU

Individual perception of stress in the ICU

A Novel Hierarchical Method For Decomposition And Design Of Workflow Models

Modeling and analysis of large and complex workflow processes includes transformation of the process logic into a formal representation. Petri net-based modeling is convenient, but it suffers from ...

Meta‐ and object‐language for information retrieval research: proposal for a distinction

The distinction between a meta‐ and an object‐language has become increasingly familiar in information science, through the diffusion of the concept of metadata. A significant antecedent to this distinction can be found in the development of formal logic. This paper proposes an analogous distinction for information retrieval research, between the metalanguage of discourse about information retrieval systems and the object‐language of transformations within systems. In formal logic, acceptance of a meta:object distinction has had a clarifying and simplifying effect. An understanding of potential object‐language transformations as the writing, erasure, and substitution of symbols has also been developed. The existing metalanguage of information retrieval research has displayed a founding assumption (the value of delivering all, and possibly only all, the records relevant to a given query), some central concepts, entities for evaluative purposes, and derived measures. An alternative founding principle of enhanced informed choice is endorsed. The emerging view of operations within information retrieval systems such as transformation, sorting, and partitioning is strongly analogous to the more fully established account of possible object‐language transformations in formal logic. Analytical clarity has been obtained and economy in research effort is made possible.

Theoretical comparison between sequential redundancy addition and removal and retiming optimization techniques

This paper attempts to determine the capabilities of existing redundancy addition and removal (SRAR) techniques for logic optimization of sequential circuits. To this purpose, we compare this method with the retiming and resynthesis (RaR) techniques. For the RaR case the set of possible transformations has been established by relating them to STG transformations by other authors. Following these works, we first formally demonstrate that logic transformations provided by RaR are covered by SRAR as well. Then we also show that SRAR is able to identify transformations that cannot be found by RaR. This way we prove that the sequential redundancy addition and removal technique provides more possibilities for logic optimization.

Intelligent machines in the twenty-first century: foundations of inference and inquiry.

The last century saw the application of Boolean algebra to the construction of computing machines, which work by applying logical transformations to information contained in their memory. The development of information theory and the generalization of Boolean algebra to Bayesian inference have enabled these computing machines, in the last quarter of the twentieth century, to be endowed with the ability to learn by making inferences from data. This revolution is just beginning as new computational techniques continue to make difficult problems more accessible. Recent advances in our understanding of the foundations of probability theory have revealed implications for areas other than logic. Of relevance to intelligent machines, we recently identified the algebra of questions as the free distributive algebra, which will now allow us to work with questions in a way analogous to that which Boolean algebra enables us to work with logical statements. In this paper, we examine the foundations of inference and inquiry. We begin with a history of inferential reasoning, highlighting key concepts that have led to the automation of inference in modern machine-learning systems. We then discuss the foundations of inference in more detail using a modern viewpoint that relies on the mathematics of partially ordered sets and the scaffolding of lattice theory. This new viewpoint allows us to develop the logic of inquiry and introduce a measure describing the relevance of a proposed question to an unresolved issue. Last, we will demonstrate the automation of inference, and discuss how this new logic of inquiry will enable intelligent machines to ask questions. Automation of both inference and inquiry promises to allow robots to perform science in the far reaches of our solar system and in other star systems by enabling them not only to make inferences from data, but also to decide which question to ask, which experiment to perform, or which measurement to take given what they have learned and what they are designed to understand.