Results 41 to 50 of about 25,852,401 (225)
Refinement of higher-order logic programs [PDF]
, 2003 The original publication is available at www.springerlink.comA refinement calculus provides a method for transforming specifications to executable code, maintaining the correctness of the code with respect to its specification.
Colvin, Robert +11 more
core +1 more source
Explicit substitions and all that
Revista Colombiana de Computación, 2000 Explicit substitution calculi are extensions of the calculus where the substitution mechanism is internalized into the theory. This feature makes them suitable for implementation and theoretical study of logic based tools as strongly typed programming ...
Mauricio Ayala Rincón, César Muñoz
doaj
Advanced Functional Materials, EarlyView.Nitride MXenes remain constrained by a persistent gap between computational prediction and experimental realization. This Review identifies the thermodynamic, kinetic, and chemical barriers limiting their synthesis, critically evaluates emerging fabrication routes, and proposes a multidimensional computational‐experimental framework to accelerate the ...
Naresh Varnakavi, Masoud Soroush
wiley +1 more source
Second order logic or set theory? [PDF]
, 2012 We try to answer the question which is the “right” foundation of mathematics, second order logic or set theory. Since the former is usually thought of as a formal language and the latter as a first order theory, we have to rephrase the question.
Väänänen, J.
core +2 more sources
Chemical Strategies for Multistimuli Responsive Dynamic Covalent Materials in Regenerative Medicine
Advanced Healthcare Materials, EarlyView.Multistimuli responsive dynamic covalent materials integrate reversible chemistry with the complex chemical, mechanical, and biochemical cues of regenerative environments. This review highlights chemical strategies based on orthogonal dynamic bonds, multicomponent networks, and hierarchical architectures to regulate mechanics, degradation, and ...
Saurabh Joshi +2 more
wiley +1 more source
Model theory of second order logic
, 2023 Suppose a model or a model class is definable in set theory. I ask, what more do we know about it, if we know that it is definable in second order logic? Second order model theory is undoubtedly manifestly different from first order model theory.
Väänänen, Jouko
core +1 more source
Advanced Materials, EarlyView.A Nb‐proximitized Josephson junction based on a WTe2/α‐Fe2O3 heterostructure exhibits a robust superconducting diode effect with programmable polarity. The diode direction can be trained by magnetic fields and switched by temperature cycling, revealing tunable finite‐momentum pairing states and competing superconducting states in symmetry‐broken ...
Enze Zhang +9 more
wiley +1 more source
Advanced Materials, EarlyView.Azobenzene photoswitches translate molecular‐scale E/Z photoisomerization into macroscopic material responses and device‐level photonic functions. This Review highlights how azobenzene research has evolved from molecular photochemistry to photoalignment, mass migration, photomechanics, and heat release, ultimately enabling holography, reconfigurable ...
Heeju Son +20 more
wiley +1 more source
Conservativity of Type Theory over Higher-Order Arithmetic [PDF]
We investigate how much type theory can prove about the natural numbers. A classical result in this area shows that dependent type theory without any universes is conservative over Heyting Arithmetic (HA).
van den Berg, Benno +3 more
core +1 more source
A Practical Type Analysis for Verification of Modular Prolog Programs [PDF]
, 2008 Regular types are a powerful tool for computing very precise descriptive types for logic programs. However, in the context of real life, modular Prolog programs, the accurate results obtained by regular types often come at the price of efficiency.
Pietrzak, Pawel +10 more
core +1 more source