Logically Equivalent Research Articles

Populist desires, nostalgic narratives: the Marcos golden age myth and manipulation of collective memories on YouTube

ABSTRACT This article investigates the Marcos golden age narratives on YouTube before the 2022 Philippine presidential elections. Despite evidence of brutality during the Marcos years, many Filipinos reminisce about his tenure as a period of peace and progress, influenced by selective historical accounts propagated through digital media. Expanding Laclau's theory of populism, we identify affective storytelling techniques prominent pro-Marcos YouTubers employ to glorify the Marcos era and examine them to understand how the populist logic of difference and equivalence guides the articulation of a romanticized past and endorses the vilification of elites and Marcos critics. Our analysis underscores the potency of nostalgia in populist and authoritarian politics, demonstrating their capacity to foster a collective yearning for a mythic past and stoke a collective desire for Marcos-brand authoritarianism. Ultimately, this article contributes to understanding the dynamics of historical revisionism and its implications for political discourse and historical consciousness in the digital age, emphasizing the role of YouTubers in shaping political landscapes through nostalgia and the manipulation of social memory.

Extraction of logical networks during decompiling transistor-level CMOS circuit descriptions

Objectives. The problem of restoring the functional description of digital VLSI devices presented at the transistor level is considered. The objective of the work is to develop means for extraction of blocks representing logical networks from two-level descriptions of CMOS circuits at the transistor level, which were obtained as a result of recognition (extraction) of subcircuits that implement logic elements.Methods. Graph based methods and software tools are proposed for extracting a connected blocks representing a logical network from two-level descriptions of a transistor circuits in SPICE format. In the graph interpretation, the task is reduced to constructing a labeled directed graph of a logical network based on a labeled undirected bipartite graph specifying a two-level description of the transistor circuit.Results. The proposed method makes it possible to identify lexicographically ranked logical networks, from which a transition is made to logical equations that specify the functions implemented at the outputs of the resulting networks. Software tools have been developed that provide the generation of a hierarchical description in SPICE format that implements the original circuit at the transistor level, as well as descriptions of found logical networks in the SF language of hierarchical structural and functional descriptions of discrete devices and in high-level languages (VHDL and Verilog).Conclusion. The developed methods are implemented in C++, included in the program for decompiling transistor CMOS circuits and tested within it on practical examples of transistor-level circuits. The paper provides examples of reverse engineering of some practical transistor circuits.

Logical equivalences, homomorphism indistinguishability, and forbidden minors

Two graphs G and H are homomorphism indistinguishable over a graph class F if for all graphs F∈F the number of homomorphisms from F to G is equal to the number of homomorphisms from F to H. Many graph isomorphism relaxations such as (quantum) isomorphism, spectral, and logical equivalences can be characterised as homomorphism indistinguishability relations over certain graph classes.Abstracting from the wealth of such instances, we show in this paper that equivalences w.r.t. any self-complementarity logic admitting a characterisation as homomorphism indistinguishability relation can be characterised by homomorphism indistinguishability over a minor-closed graph class. Self-complementarity is a mild property satisfied by most well-studied logics.Furthermore, we classify all graph classes which are in a sense finite and satisfy the maximality condition of being homomorphism distinguishing closed, i.e. adding any graph to the class strictly refines its homomorphism indistinguishability relation. Thereby, we answer various questions raised by Roberson (2022) on properties of the homomorphism distinguishing closure.

Multifaceted formal methods and their interdisciplinary role — From the cathedral of ‘components as coalgebras’ to the HCI context and the open source software bazaar

In this article we revisit the history of formal methods with a focus on important aspects that contribute to their interdisciplinary role. We consider: the variability of mathematical representation techniques on which the theoretical foundations of formal methods are based; formal methods multidisciplinarity; their capability to serve at a meta-level in providing the semantics of programming languages, specification and modelling languages as well as higher-level and domain-specific formal notations; and, finally, how some of these higher-level and domain-specific notations may be lifted at an interdisciplinary level.Within this historical review, we are inspired by Luís Barbosa's “components as coalgebras” approach in seeing that the duality data-process is underlying all those aspects of formal methods. We also see that such a duality may not only be expressed in universal terms within category theory, but may also be characterised in practical terms and focused applications by two distinct logic paradigms, equational logic for the data and rewriting logic for the process, by two modelling directions, forward process definitions and backward data-driven process transformations, and by the distinction between syntax, defined by the data structures, and semantics, provided by rewrite rules. We use the Maude modelling language to illustrate the application of the data-process duality. In fact, Maude use equational logic to define data types and rewriting logic to express system evolution. Illustrative examples are from the areas of cognitive science and human-computer interaction (HCI).We then define a data-driven model transformation, which we call elaborative mining, which adopts a backward perspective to recover a behaviour that was observed in real life but was not predicted forward by the original model. Finally, we see how the “open source software bazaar”, which is a metaphor for the apparently chaotic open source development process, offers us a big data context to lift the driving process for model transformation from deterministic to statistical.

Lasserre Hierarchy for Graph Isomorphism and Homomorphism Indistinguishability

We show that feasibility of the $t^\text{th}$ level of the Lasserre semidefinite programming hierarchy for graph isomorphism can be expressed as a homomorphism indistinguishability relation. In other words, we define a class $\mathcal{L}_t$ of graphs such that graphs $G$ and $H$ are not distinguished by the $t^\text{th}$ level of the Lasserre hierarchy if and only if they admit the same number of homomorphisms from any graph in $\mathcal{L}_t$. By analysing the treewidth of graphs in $\mathcal{L}_t$, we prove that the $3t^\text{th}$ level of Sherali--Adams linear programming hierarchy is as strong as the $t^\text{th}$ level of Lasserre. Moreover, we show that this is best possible in the sense that $3t$ cannot be lowered to $3t-1$ for any $t$. The same result holds for the Lasserre hierarchy with non-negativity constraints, which we similarly characterise in terms of homomorphism indistinguishability over a family $\mathcal{L}_t^+$ of graphs. Additionally, we give characterisations of level-$t$ Lasserre with non-negativity constraints in terms of logical equivalence and via a graph colouring algorithm akin to the Weisfeiler--Leman algorithm. This provides a polynomial time algorithm for determining if two given graphs are distinguished by the $t^\text{th}$ level of the Lasserre hierarchy with non-negativity constraints.

Da religião à espiritualidade na educação: rumo a uma regulamentação política da espiritualidade?

The analysis of the emergence of the concept of spirituality in public education policies reveals various tensions at work in the religious and secular fields. Is this emergence a ploy by large religious groups to preserve influence in societies that are putting an end to official alliances with them? Has the concept of spirituality become broad enough to designate any search for meaning, and also to satisfy the aspiration for formal equality between all forms of beliefs, cults, and non-beliefs? This article addresses the issue of spirituality and how it has been integrated into the school legislation of the Canadian province of Quebec. It analyzes the creation in that province of the Spiritual Care and Guidance and Community Involvement Service. Designed to be neutral, it is aimed at both religious and non-religious students, in an effort to promote a logic of equality.

The challenges of coeliac disease at work: A contestation of the politics of inclusion.

By focusing on the experiences of employees living with coeliac disease as evidenced in UK employment tribunal cases, this paper interrogates the way practices of exclusion are performed in legal and organisational contexts that purport to promote values of inclusion. In paying attention to how differences are constructed and negotiated, the paper unpacks the way organisational practices mobilise an array of workplace mechanisms to produce complex dynamics of exclusion. Applying Laclau and Mouffe's logics of equivalence and difference, we show how questionable impulses and practices emerge in a workplace environment characterised by unclarity and vagueness. One impulse, for example, involves privatising and individualising the condition of employees with coeliac disease, giving rise to patronising and stigmatising attitudes that can turn them into victims. However, we also identify workplace mechanisms countering these tendencies, which can underpin forms of collective support in the struggle for recognition. Our study thus contributes to the body of sociological literature that pays attention to health-related workplace injustices by challenging the purported promotion of health-based inclusion through a focus on tribunal cases, leading to suggestions for further research into the way medical conditions are theorised and 'lived' at work.

The method of linear-logical operators and logical equations in information extraction tasks

Relational and logical methods of knowledge representation play a key role in creating a mathematical basis for information systems. Predicate algebra and predicate operators are among the most effective tools for describing information in detail. These tools make it easy to formulate formalized information, create database queries, and simulate human activity. In the context of the new need for reliable and efficient data selection, a problem arises in deeper analysis. Subject of the study is the theory of quantum linear equations based on the algebra of linear predicate operations, the formal apparatus of linear logic operators and methods for solving logical equations in information extraction tasks. Aim of the study is a developing of a method for using linear logic operators and logical equations to extract information. This approach can significantly optimize the process of extracting the necessary information, even in huge databases. Main tasks: analysis of existing approaches to information extraction; consideration of the theory of linear logic operators; study of methods for reducing logic to an algebraic form; analysis of logical spaces and the algebra of finite predicate actions and the theory of linear logic operators. The research methods involve a systematic analysis of the mathematical structure of the algebra of finite predicates and predicate functions to identify the key elements that affect the query formation process. The method of using linear logic operators and logical equations for information extraction is proposed. The results of the study showed that the method of using linear logic operators and logical equations is a universal and adaptive tool for working with algebraic data structures. It can be applied in a wide range of information extraction tasks and prove its value as one of the possible methods of information processing. Conclusion. The paper investigates formal methods of intelligent systems, in particular, ways of representing knowledge in accordance with the peculiarities of the field of application and the language that allows encoding this knowledge for storage in computer memory. The proposed method can be implemented in the development of language interfaces for automated information access systems, in search engine algorithms, for logical analysis of information in databases and expert systems, as well as in performing tasks related to object recognition and classification.

DECLAREd: A Polytime LTLf Fragment

This paper considers a specification rewriting meachanism for a specific fragment of Linear Temporal Logic for Finite traces, DECLAREd, working through an equational logic and rewriting mechanism under customary practitioner assumptions from the Business Process Management literature. By rewriting the specification into an equivalent formula which might be easier to compute, we aim to streamline current state-of-the-art temporal artificial intelligence algorithms working on temporal logic. As this specification rewriting mechanism is ultimately also able to determine with the provided specification is a tautology (always true formula) or a formula containing a temporal contradiction, by detecting the necessity of a specific activity label to be both present and absent within a log, this implies that the proved mechanism is ultimately a SAT-solver for DECLAREd. We prove for the first time, to the best of our knowledge, that this fragment is a polytime fragment of LTLf, while all the previously-investigated fragments or extensions of such a language were in polyspace. We test these considerations over formal synthesis (Lydia), SAT-Solvers (AALTAF) and formal verification (KnoBAB) algorithms, where formal verification can be also run on top of a relational database and can be therefore expressed in terms of relational query answering. We show that all these benefit from the aforementioned assumptions, as running their tasks over a rewritten equivalent specification will improve their running times, thus motivating the pressing need of this approach for practical temporal artificial intelligence scenarios. We validate such claims by testing such algorithms over a Cybersecurity dataset.

Towards determinism in PDL: relations and proof theory

Abstract Guarded Kleene Algebra with Tests (GKAT) was presented as a fragment of KAT to abstract imperative programming languages, where only if-then-else and while-do statements are allowed in the language. The loss of expressiveness is, nevertheless, compensated by a clear advantage over KAT: it allows almost linear decidability of program equivalence. In this work, we give the first step to optimizing the complexity of dynamic logic equivalence, which is EXPTIME-complete in propositional dynamic logic (PDL). First, and based on strict deterministic PDL, we present guarded propositional dynamic logic (GPDL), a fragment of PDL where programs correspond to GKAT terms. It comes embedded, as expected, with a semantics over relational models and a sound axiomatisation. Then, we present a Natural Deduction system for GPDL, proving its soundness and completeness, concerning the axiomatisation. Based on Smolka et al. (2019, Proceedings of the ACM Programming Language 4), we obtain the main result of this work—the equivalence of GPDL programs can be established in almost linear time.

An Experimental Research of the Algorithm for Extracting of a Boolean Function Subsystems for Joint Multilevel Optimization

The results of an experimental comparison of programs for technologically independent minimization of complexity of multilevel representations of systems of fully defined functions based on the Shannon expansion are described. The main attention is paid to the effectiveness of using, when synthesizing logical circuits, a program that implements an algorithm for solving the problem of extracting from a system of functions such subsystems for which it is advisable to carry out joint minimization of multi-level representations of subsystems in the form of Binary Decision Diagrams, called BDD-representations, and in the form of Boolean net. The complexity of the representation is estimated by the total number of literals of Boolean variables in a set of interrelated logical equations that define a system of Boolean functions. After extracting the subsystems and their joint minimization, the synthesis of logic circuits is carried out in the design library of custom digital CMOS VLSIs, the results are compared in terms of chip area and speed (time delay) on a stream of 39 industrial examples of circuits. It was found that for 20 examples, the subsystem selection algorithm allows one to obtain better solutions than joint or separate minimization of multi-level representations based on Shannon expansion (13 examples). The three best solutions are obtained by applying the well-known Espresso program for minimizing functions in the DNF class, and the three solutions are obtained by the synthesizer using the original (non-optimized) matrix representations of DNF systems of Boolean functions.

The Past and Future of High Technology

Abstract This interview was given in 2008 by Arkady Zakrevsky (1928–2014), Corresponding Member of the National Academy of Sciences of Belarus (1972), Doctor of Technical Sciences (1967), and Professor (1969). He stood at the origins of the birth of cybernetics in the Soviet Union. He proposed the programming language for logical tasks LYaPAS, on the basis of which a series of computer-aided design systems for discrete devices was created, and methods for implementing parallel algorithms for the logical control of interacting processes. Some monographs: LYaPAS: A Programming Language for Logic and Coding Algorithms (N.-Y., L.: Academic Press, 1969; with M. A. Gavrilov); Boolesche Gleichungen: Theorie, Anwendung, Algorithmen (Berlin: VEB Verlag Technik, 1984; with Dieter Bochmann and Christian Posthoff); Combinatorial Algorithms of Discrete Mathematics (Tallinn: TUT Press, 2008; with Yu. Pottosin, L. Cheremisinova); Optimization in Boolean Space (Tallinn: TUT Press, 2009; with Yu. Pottosin, L. Cheremisinova); Design of Logical Control Devices (Tallinn: TUT Press, 2009; with Yu. Pottosin, L. Cheremisinova); Combinatorial Calculations in Many-Dimensional Boolean Space (Tallinn: TUT Press, 2012); Solving Large Systems Logical Equations (Tallinn: TUT Press, 2013).

16-Bit Carry Look-Ahead Adder: Design and Layout with Cadence Tools Top of Form

Abstract: The development of highly organised architecture is the primary goal of the current communication world in order to achieve high speed computation with low power consumption. The Carry Look Ahead Adder is highly efficient due to its ability to reduce the propagation time of carry bits, resulting in time savings. The implementation of a 16-Bit Carry Look Ahead Adder using the Cadence tool is carried out in our project. Logical equations for carry generation (G) and carry propagation (P) are used to create the carry and sum for the 1-bit adder. Then, using the Virtuoso schematic editor, a single bit carry is developed. After that, a fresh cell view for the carry block is made and supplied as an input for adder implementations. Next, the bit rate is increased to 4 bits. Using this 4 bit adder, 8/16 bit adder is implemented using Cadence tool. It is necessary to have a basic understanding of IC design guidelines and fabrication procedures in order to produce the layout. Within the electronic VLSI design system, the layout will go through a Design Rule Check to find any breaches

Developing a quality assessment model (QAM) using logical prediction: Binary validation

This study focuses on evaluating the quality of competency transfer through various assessment methods and results, considering diverse stakeholder perspectives. The research aims to introduce an innovative approach for validating assessment outcomes, leveraging predicted sub-measurements, and transforming Boolean parameters' symbols into a binary coding system. This transformation simplifies the validation process by employing logical equations. The study's sample involves the adaptation of a competency transfer model, which combines internal parameters with the novel logical assessment method. The research findings indicate that the binary 2x system effectively simplifies quantitative and qualitative data representation within the validation process. This system facilitates the early detection of potentially ambiguous results, enabling the creation of validation procedures grounded in organizational cultural dimensions, outcomes, reports, and assessments. The proposed Quality Assessment Model (QAM) serves as a powerful tool for prediction, enhancing the quality of both quantitative and qualitative data outcomes. This approach generates distinct values, precise predictive measurements, and valuable result quality suitable for informed decision-making in various contexts. Ultimately, the study contributes to the advancement of assessment methodologies, enabling stakeholders to make more accurate and reliable judgments based on the quality of competency transfer.

The first and second laws of thermodynamics are logically equivalent

In the September 2022 issue of The Physics Teacher ( TPT), Richard Kaufman and Harvey Leff showed the interdependence of the first and second laws of thermodynamics. Here, I go further and use the facts that the first law implies the second law, and that the second law implies the first law. This two-way implication establishes the logical equivalence of the first and second laws. Although the laws are logically equivalent (when one is true, then the other must be true), this does not mean that they are the same. The equivalence provides for a deeper and richer understanding of the laws of thermodynamics for students, teachers, and physicists. Surely, if we can know that the first and second laws are equivalent, then we should know.

State Church and Religious Equality: A Comparative Study of Competing Logics during the Process of Changing Relations between State and Church in Sweden and Norway

Abstract In recent decades, the religious landscape in the Nordic countries has changed. Transforming from traditional homogeneous Evangelical-Lutheran societies into more religiously and culturally diverse, there have been reforms creating new relationships between the states and the traditional state churches. Taking a comparative approach, this article analyzes how institutional logics guided the church and state reforms in Norway and Sweden. Analyzing governmental documents through the theoretical lens of institutional logics, the article makes a distinction between the logic of state church and the logic of religious equality. The article shows how the former acts as a foundational logic within policymaking even though there has been a movement towards more religious equality in legislation. Though there are differences in how Norway and Sweden facilitate their arrangements for support to faith communities, the ideas informing the arrangements are similar. We point towards an increased discrepancy behind the ideas informing policymaking and the practical implications of those policies.

Estigma na percepção de médicas e enfermeiras sobre o pré-natal de homens transexuais

Abstract Objective To analyze the stigma evidenced in doctors’ and nurses’ perception regarding prenatal care for transgender men. Methods A qualitative study developed with nine health professionals (six nurses and three doctors) working in Family Health Units in a municipality in Bahia. In-depth interviews were carried out, subjected to reflective thematic analysis and interpretation based on the theory of social stigma and the concept of cisheteronormativity. Results Two topics were derived that explained the establishment of labels and stereotypes on the body, mind and gender identity of pregnant trans men: professional (un)preparedness and distancing from cisheteronormative demands and perspectives for prenatal care for trans men. Elements of stigma observed were distance, labels, stereotype, discredit and discrimination. Such elements (stigmatizing perceptions) manifested themselves within the logic of normality and cisgender equality of trans men’s health needs in the prenatal context. Conclusion There is stigma in doctors’ and nurses’ perception regarding prenatal care for trans men. Stigmatization can negatively impact the quality of prenatal care and trans men’s health and safety in the pregnancy and puerperal cycle, anticipating thoughts, attitudes and practices that contribute to the deterioration of transmasculine identity during pregnancy.

Modeling Bidirectional Switches for Enabling Logic Equivalence Checking in a Transistor-Level Programmable Fabric

Modeling Bidirectional Switches for Enabling Logic Equivalence Checking in a Transistor-Level Programmable Fabric

Development of a Prototype of an Automated Dog Feeding System

In large kennels, canine services have difficulties in feeding dogs. Known dog feeding systems are studied and the development of an automated system using Omron PLC is described. The developed technological scheme is given. For simplification of installation, the equipment is divided into modules. A table of signal addresses used in Omron series industrial controllers is given. The system of logical equations for controlling the main modules of the equipment device drive is given. Purpose of the research: development of the project of the automated system of dog feeding in kennels. Materials and methods: the theory of finite automata, the theory of synthesis of logical equations and ladder diagram technique were used. The software was developed using Software CX’, ’One. Results: a laboratory bench prototype of the automated feeding system was developed. Practical significance: implementation of this system in departmental organizations will reduce the time spent on food dosing, reduce the probability of error associated with the human factor, as well as provide the process of feeding dogs while reducing the labor input of service personnel.

The Conway Circle Theorem: Equivalence and Generalization

Summary The elegant and surprising Conway Circle Theorem (CCT) for triangles has become more widely known following the death of its discoverer John Horton Conway (1938–2020). The logical equivalence of the CCT and the well-known triangle incircle tangent length formulas is demonstrated, thereby also providing an alternative proof of the CCT. The CCT is then generalized for tangential polygons.