Results 21 to 30 of about 2,250,044 (344)
Extending separation logic with fixpoints and postponed substitution
Theoretical Computer Science, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Élodie-Jane Sims
semanticscholar +3 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
Eliminating the substitution axiom from Unity logic
, 1990 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 transformerssst andwst are introduced that allow the strongest invariant of a program to be expressed, and these are used to give new definitions for the ...
Beverly A. Sanders
openaire +3 more sources
Logic Programming, Substitutions and Finite Computability
DAIMI Report Series, 1985 <p>Apt and van Emden have studied the semantics of logic programming by means of fixed point methods. From a model theoretic point of view, their formalisation is very nice. Least and greatest fixed points correspond to least and greatest Herbrand-models respectively.</p><p>Viewed operationally, there is an ugly asymmetry.
Gudmund Skovbjerg Frandsen
openaire +3 more sources
On Answer Substitutions in Logic Programming [PDF]
, 2017 3 pages.
Keehang Kwon
openaire +3 more sources
Explicit substitutions, logic and normalization
, 2004 Les substitutions explicites ont été introduites comme un raffinement du lambda-calcul, celui-ci étant leformalisme utilisé pour étudier la sémantique des langages de programmation. L'objet de cette thèseest l'étude de leurs propriétés de normalisation forte et de préservation de la normalisation forte.
Emmanuel Polonovski +1 more
openaire +3 more sources
Linguistic Data Model for Natural Languages and Artificial Intelligence. Part 7. Internal Logic 1
Дискурс, 2022 Introduction. The article continues a series of publications on the linguistics of relations (hereinafter referred to as R-linguistics) and is devoted to the study of the functioning of logical connectives with verbs. The article is the first part of the
O. M. Polyakov
doaj +1 more source
Controllable p‐Type Doping of 2D WSe2 via Vanadium Substitution [PDF]
Advanced Functional Materials, 2021 Scalable substitutional doping of 2D transition metal dichalcogenides is a prerequisite to developing next‐generation logic and memory devices based on 2D materials. To date, doping efforts are still nascent. Here, scalable growth and vanadium (V) doping
Azimkhan Kozhakhmetov +12 more
semanticscholar +1 more source
Conditional nature of the application of the substitution of the unserved part of punishment with a milder penalty as a way to improve this criminal law institution [PDF]
Пенитенциарная наука, 2023 Introduction: the article discusses the way to improve the application of norms of the institution of the substitution of the unserved part of punishment with a milder penalty (hereinafter – punishment substitution) by establishing conditions under ...
Balasanov M.R.
doaj +1 more source
Hereditary Substitution for the λΔ-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Hereditary substitution is a form of type-bounded iterated substitution, first made explicit by Watkins et al. and Adams in order to show normalization of proof terms for various constructive logics.
Harley Eades, Aaron Stump
doaj +1 more source