Results 291 to 300 of about 2,196,068 (340)

Binary image algebra representations of optical cellular logic and symbolic substitution

Annual Meeting Optical Society of America, 1987
Binary image algebra (BIA) provides a systematic mathematical formalism for both digital optical cellular logic and symbolic substitution processors, in addition to being a unified theory of parallel binary image processing.1 Cellular logic operations ...
Kung-Shiuh Huang, B. K. Jenkins, A. Sawchuk   +2 more
semanticscholar   +1 more source

The Millennium Development Goals and Education: Accountability and Substitution in Global Assessment

International Organization, 2019
Precise international metrics and assessments may induce governments to alter policies in pursuit of more favorable assessments according to these metrics. In this paper, we explore a secondary effect of global performance indicators (GPIs).
J. Bisbee, J. Hollyer, B. Rosendorff, J. Vreeland   +3 more
semanticscholar   +1 more source

Dataflow for logic program as substitution manipulator

Proceedings of the international symposium on Symbolic and algebraic computation, 1990
This paper shows a method of constructing a dataflow, which denotes the deductions of a logic program, by means of a sequence domain based on equivalence classes of substitutions. The dataflow involves fair merge functions to represent unions of atom subsets over a sequence domain, as well as functions as manipulations of unifiers for the deductions of
openaire   +2 more sources

A Highly Secure FPGA-Based Dual-Hiding Asynchronous-Logic AES Accelerator Against Side-Channel Attacks

IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2022
Jun-Sheng Ng, Juncheng Chen, Kwen-Siong Chong, J. Chang, B. Gwee   +4 more
semanticscholar   +1 more source

A method of epsilon substitution for the predicate logic with equality

Journal of Mathematical Sciences, 1997
The method of epsilon substitution for arithmetic proposed by Hilbert proceeds by a series of finite approximations ``from below'' to a solution of a fixed system of critical formulas. Ackermann applied the method also to the first order predicate logic with equality and extensionality formalized in terms of the epsilon symbol, which however proceeds ``
openaire   +2 more sources

On detachment-substitutional formalization in normal modal logics

Studia Logica, 1977
The aim of this paper is to propose a criterion of finite detachment-substitutional formalization for normal modal systems. The criterion will comprise only those normal modal systems which are finitely axiomatizable by means of the substitution, detachment for material implication and Godel rules.
openaire   +2 more sources

Identity in Mares-Goldblatt Models for Quantified Relevant Logic

Journal of Philosophical Logic, 2021
Shawn Standefer
semanticscholar   +1 more source

On the equivalence of deferred substitution and immediate substitution semantics for Logic Programs

1991
The paper considers a deferred substitution semantics for Logic Programs, in which both the composition of computed substitutions and their application to atoms in the current goal are deferred. This kind of semantics occurs in several interpreter optimization contexts: Prolog implementation optimization.
Nissim Francez, Oded Shmueli, Amir Rahat
openaire   +2 more sources

The substitution interpretation in topological logic [PDF]

Journal of Philosophical Logic, 1974
openaire   +1 more source

Duality for Compact Logics and Substitution in Abstract Model Theory

Mathematical Logic Quarterly, 1985
Using no special set-theoretical hypothesis we prove the following, for arbitrary logics L and M generated by a set of quantifiers: (i) If L is compact and \(\equiv_ L=\equiv_ M\), then L and M are equivalent. (ii) if \(L\subseteq M\), then there is the largest logic \(L^+\) such that \(L^+\subseteq M\) and \(\equiv_{L^+}=\equiv_ L.\) We also find an ...
openaire   +5 more sources