Results 81 to 90 of about 77,893 (200)
Polynomial time algorithm for checking strong equivalence of program
Strong (logic&term) equivalence of programs is the weakest decidable equivalence relation which approximates the functional equivalence of programs.
V. A. Zakharov, T. A. Novikova
doaj
Abstract We correct a mistake in [V. Astier, Some model-theoretic results in the algebraic theory of quadratic forms, Ann. Pure Appl. Logic 112 (2–3) (2001) 189–223].
openaire +1 more source
Algebraic model for scattering in three-
V. S. Vasilevsky +3 more
openalex +1 more source
A MODEL-THEORETIC PERSPECTIVE ON ALGEBRAIC REDUCTIONS OF HYPERKAEHLER MANIFOLDS [PDF]
Rahim Moosa, Anand Pillay
openalex
Algebraic and Model Theoretic Properties of O-minimal Exponential Fields
published
openaire +1 more source
Set theoretical and algebraic model for redundancies in the genetic code [PDF]
Karl Heuer
openalex +1 more source
Researching (Algebraic) Problem Solving from the Perspective of Local Theoretical Models
Luis Puig
openalex +1 more source
Reliability as Projection in Operator-Theoretic Test Theory: Conditional Expectation, Hilbert Space Geometry, and Implications for Psychometric Practice. [PDF]
Zumbo BD.
europepmc +1 more source

