Results 11 to 20 of about 2,196,068 (340)
Eliminating the substitution axiom from UNITY logic [PDF]
Formal Aspects of Computing, 1991 Abstract The UNITY substitution axiom, “if (x=y) is an invariant of a program, then x can be replaced by y in any property of the program”, is problematic for several reasons. In this paper, dual predicate transformers sst and wst are introduced that allow the strongest invariant of
B. Sanders
semanticscholar +7 more sources
What Did the Cross Achieve? The Logic of Penal Substitution [PDF]
Tyndale Bulletin, 1974 The task which I have set myself in this lecture is to focus and explicate a belief which, by and large, is a distinguishing mark of the word-wide evangelical fraternity: namely, the belief that Christ's death on the cross had the character of penal ...
J. I. Packer
doaj +3 more sources
SUBSTITUTION IN RELEVANT LOGICS [PDF]
The Review of Symbolic Logic, 2019 AbstractThis essay discusses rules and semantic clauses relating to Substitution—Leibniz’s law in the conjunctive-implicational form $s\dot{ = }t \wedge A\left( s \right) \to A\left( t \right)$—as these are put forward in Priest’s books In Contradiction and An Introduction to Non-Classical Logic: From If to Is. The stated rules and clauses are shown to
Tore Fjetland Øgaard
openaire +4 more sources
IEEE AccessPresents corrections to the paper, Corrections to “Fuzzy Logic-Based Substitution-Box for Robust Medical Image Encryption in Telemedicine”.
Abdul Razaq +4 more
doaj +2 more sources
Efficient Substitution in Hoare Logic Expressions
Electronic Notes in Theoretical Computer Science, 2001 AbstractSubstitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important to choose a good implementation for it. In this paper we compare different definitions and implementations of substitution in a logical framework, in an effort to ...
Andrew W. Appel +2 more
openaire +3 more sources
On the multi-dimensional modal logic of substitutions [PDF]
Studia Scientiarum Mathematicarum Hungarica, 2019 Abstract We prove completeness, interpolation, decidability and an omitting types theorem for certain multi-dimensional modal logics where the states are not abstract entities but have an inner structure. The states will be sequences. Our approach is algebraic addressing varieties generated by complex algebras of Kripke semantics for such ...
Tarek Ahmed, Mohammad Assem Mahmoud
+7 more sources
Algebraic Logic Perspective on Prucnal’s Substitution [PDF]
Notre Dame Journal of Formal Logic, 2016 A term $\mathit{td}(p,q,r)$ is called a ternary deductive (TD) term for a variety of algebras $\mathcal{V}$ if the identity $\mathit{td}(p,p,r)\approxr$ holds in $\mathcal{V}$ and $(\mathsf{c},\mathsf{d})\in\theta(\mathsf{a},\mathsf{b})$ yields $\mathit{td}(\mathsf{a},\mathsf{b},\mathsf{c})\approx\mathit{td}(\mathsf{a},\mathsf{b},\mathsf{d})$ for any $\
Alex Citkin
openaire +3 more sources
Lifting Term Rewriting Derivations in Constructor Systems by Using Generators [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Narrowing is a procedure that was first studied in the context of equational E-unification and that has been used in a wide range of applications. The classic completeness result due to Hullot states that any term rewriting derivation starting from an ...
Adrián Riesco, Juan Rodríguez-Hortalá
doaj +4 more sources
Extending separation logic with fixpoints and postponed substitution
Theoretical Computer Science, 2006 AbstractWe are interested in separation-logic-based static analysis of programs that use shared mutable data structures. In this paper, we introduce backward and forward analysis for a separation logic called BIμν, an extension of separation logic [Ishtiaq and O’Hearn, BI as an assertion language for mutable data structures, in: POPL’01, 2001, pp.
Élodie-Jane Sims
semanticscholar +3 more sources