Results 111 to 120 of about 17,772 (305)

Revisiting a Proof of the Sine Theorem

open access: yesРазвитие образования, 2020
The author of the article outlines, that in school geometry course, the sine theorem and the cosine theorem are well known. In this course, they are proved by the authors of the textbook in a way different from the one that is presented in the article ...
Victor A. Dalinger
doaj   +1 more source

Quantum Phenomena in Molecular and Biological Systems: A Decoherence‐Based Decision Framework With Falsifiable Predictions and a Failure‐Mode Taxonomy

open access: yesAdvanced Physics Research, EarlyView.
A physics‐grounded framework based on decoherence timescales (τ_dec vs τ_func), Markovian validity, and falsifiability criteria is applied across molecular systems to distinguish where quantum effects are necessary, marginal, or irrelevant. The analysis integrates quantum chemistry, biological quantum mechanisms, and quantum computing under a unified ...
Sarfaraz K. Niazi
wiley   +1 more source

Interactive Solution Viewers for Automated Theorem Proving

open access: yesProceedings of the International Florida Artificial Intelligence Research Society Conference
This paper describes interactive viewers for TPTP format proofs and models generated by Automated Theorem Proving (ATP) systems.
Daniel Li   +3 more
doaj  

Working with laws, regularities and singularities in biology: The evolution of mammalian red blood cell size as a case study

open access: yesThe Anatomical Record, EarlyView.
Abstract Phylogenetic comparative methods have been used in recent literature to work with laws and test for regularities (evolutionary associations of quantitative features) and evolutionary singularities (features that evolved in a single taxon). We analyzed these uses epistemologically, taking the evolution of red‐blood‐cell mean corpuscular volume (
Jorge Cubo   +3 more
wiley   +1 more source

A proof-theoretic analysis of the classical propositional matrix method

open access: yes, 2014
The matrix method, due to Bibel and Andrews, is a proof procedure designed for automated theorem-proving. We show that underlying this method is a fully structured combinatorial model of conventional classical proof theory.
Ritter, E   +5 more
core   +1 more source

Departing from standard practices: Strategic application of value engineering in the anatomy laboratory to enhance formaldehyde extraction using high‐impact, low‐cost, and low‐maintenance solutions

open access: yesAnatomical Sciences Education, Volume 18, Issue 3, Page 241-253, March 2025.
Abstract This study describes the process of developing a high‐impact, low‐cost, and low‐maintenance air ventilation system for anatomy facilities. It employed the strategic application of Value Engineering (VE), assuring that the air ventilation system meets contemporary threshold limit values (TLVs) for formaldehyde in the working zone of dissection ...
Jürgen Russ, Niels Hammer
wiley   +1 more source

The TPS theorem proving system [PDF]

open access: yes, 1986
When one is seeking an expansion proof for a theorem of higher-order logic, not all necessary substitution terms can be generated by unification of formulas already present, so certain expansion options [5] are applied, and then a search for a p-acceptable mating [2] is made, using Huet's higher-order unification algorithm [8] to generate all remaining
Peter B. Andrews   +3 more
openaire   +1 more source

Modeling and parameter estimation for fractional large‐scale interconnected Hammerstein systems

open access: yesAsian Journal of Control, EarlyView.
Abstract This paper addresses the challenge of modeling and identifying large‐scale interconnected systems exhibiting memory effects, hereditary properties, and non‐local interactions. We propose a fractional‐order extension of the Hammerstein architecture that incorporates Grünwald–Letnikov operators to capture complex dynamics through multiple ...
Mourad Elloumi   +2 more
wiley   +1 more source

Relational Rippling: A General Approach

open access: yes, 1995
We propose a new version of rippling, called relational rippling. Rippling is a heuristic for guiding proof search, especially in the step cases of inductive proofs. Relational rippling is designed for representations in which value passing is by shared
Vincent Lombart   +3 more
core  

On structural controllability in complex networks with periodic switching topologies

open access: yesAsian Journal of Control, EarlyView.
Abstract This paper investigates the structural controllability of complex networks with periodic switching topologies. First, several graph transformations that preserve structural controllability are demonstrated. Based on the n‐walk theory, a criterion is derived that determines structural controllability by analyzing only the joint graph within a ...
Jingrui Hou   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy