Results 31 to 40 of about 37,011 (230)

Conservativity of Type Theory over Higher-Order Arithmetic [PDF]

open access: yes
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

HOL with Definitions: Semantics, Soundness, and a Verified Implementation [PDF]

open access: yes, 2014
. We present a mechanised semantics and soundness proof for the HOL Light kernel including its definitional principles, extending Har-rison’s verification of the kernel without definitions. Soundness of the logic extends to soundness of a theorem prover,
Arthan, Rob   +7 more
core   +1 more source

Higher-Order Fuzzy Logics and their Categorical Semantics: Higher-Order Linear Completeness and Baaz Translation via Substructural Tripos Theory

open access: yes, 2021
There are, in general, two kinds of logical foundations of mathematics, namely set theory and higher-order logic (aka. type theory). Fuzzy set theory and class theory have been studied extensively for a long time.
Maruyama, Yoshihiro, Yoshihiro Maruyama
core   +1 more source

Field Report from Collaborative Research Center 1625: Heterogeneous Research Data Management Using Ontology Representations

open access: yesAdvanced Engineering Materials, EarlyView.
A unified research data management framework for heterogeneous materials data is presented. The system integrates multimodal datasets using ontologies and knowledge graphs, enabling interoperability and FAIR (findable, accessible, interoperable, reusable) data principles. By linking data across scales and workflows, it supports reproducible, Artifitial
Doaa Mohamed   +6 more
wiley   +1 more source

Superposition for Higher-Order Logic [PDF]

open access: yes, 2021
This thesis presents an extension of the superposition calculus to higher-order logic (also called simple type theory) and its implementation and empirical evaluation in an automated theorem prover.
Bentkamp, Alexander; id_orcid
core  

Oxygen‐Tunnel Indium Tin Oxide Vertical Channel Transistors with Enhanced Current Density and Reliability for Monolithic 3D Compute‐In‐Memory Systems

open access: yesAdvanced Functional Materials, EarlyView.
Oxygen‐tunnel (OT) indium tin oxide (ITO) vertical channel transistors (VCTs) enable reliable, high‐density gain‐cell memory for monolithic 3D integration. A sandwiched SiN/SiO2/SiN OT stack selectively regulates oxygen transport, suppressing parasitic electrode oxidation while stabilizing channel oxygen vacancies, thereby suppressing carrier injection
Hyeonho Gu   +17 more
wiley   +1 more source

Omnipolar Magnetic Field Detection by Superlattice‐Based Hall Sensor

open access: yesAdvanced Functional Materials, EarlyView.
Magnetic‐field‐induced electronic switching is demonstrated in unit‐cell‐engineered La0.7Sr0.3MnO3–BiFeO3 superlattices. Distinct substrate terminations modify magnetic and transport properties. Hall resistance measurements show omnipolar, hysteretic anomalous Hall switching above the Curie temperature, arising from Fe─Mn interfacial exchange, enabling
Mark Huijben   +6 more
wiley   +1 more source

Interlayer Expansion of Bulk MoS2 via Top‐Down Organic Pillaring Enables Tunable Li+ Intercalation and Controlled Solvent Co‐Intercalation

open access: yesAdvanced Functional Materials, EarlyView.
Top‐down organic pillaring expands the interlayer spacing of bulk‐sized MoS2 particles while preserving the bulk morphology. Operando X‐ray diffraction and electrochemical dilatometry show that MoS2‐bulk undergoes solvent co‐intercalation in diglyme electrolyte, causing large structural expansion, while pillared, expanded MoS2 suppresses solvent uptake
Jaehoon Choi   +8 more
wiley   +1 more source

LFTOP: An LF based approach to domain specific reasoning [PDF]

open access: yes, 2006
Specialized vocabulary, notations and inference rules tailored for the description, analysis and reasoning of a domain is very important for the domain.
Pang, Jianmin
core  

A Practical Type Analysis for Verification of Modular Prolog Programs

open access: yes, 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

Home - About - Disclaimer - Privacy