The article is devoted to the issue of determining scope and procedure for examination evidence in court proceedings as determinism subject evidence. In process a brief analysis scientific concept evidence, author tries demonstrate errors that occur law enforcement agencies practice. criminal legislation European countries analyzed separately, part boundaries trial evidence.
 study proved ...

The proof identity problem asks: When are two proofs the same? The question naturally occurs when one reflects on mathematical practice. The problem understandably can be seen as a challenge for mathematical logic, and indeed various perspectives on the problem can be found in the proof theory literature. From the proof theory perspective, the challenge is met by laying down new calculi that el...

Learning practical nursing skills is an important part of the baccalaureate in nursing. However, many newly qualified nurses lack practical skill proficiency required to ensure safe patient care. The invasive skill peripheral vein cannulation (PVC) is particularly challenging to learn and perform. This study explored conditions influencing nursing students' learning and performance of the techn...

Formal proofs generated by mechanised theorem proving systems may consist of a large number of inferences. As these theorem proving systems are usually very complex, it is extremely diicult if not impossible to formally verify them. This calls for an independent means of ensuring the consistency of mechanically generated proofs. This paper describes a method of recording HOL proofs in terms of ...

We present a new automated proof method for rst-order classical logic, aimed at limiting the combinatorial explosion of the search. It is non-clausal, based on BDDs (binary decision diagrams) and on new strategies that control the size and traversal of the search space by controlling the amount of information, in Shannon's sense, gained at each step of the proof. Our prover does not search blin...

This paper presents a theoretical and experimental comparison of sound proof rules for proving invariance of algebraic sets, that is, sets satisfying polynomial equalities, under the flow of polynomial ordinary differential equations. Problems of this nature arise in formal verification of continuous and hybrid dynamical systems, where there is an increasing need for methods to expedite formal ...

Establishing properties of binary programs by proof is a desirable goal when the properties of interest are crucial, such as those that arise in safetyand security-critical applications. Practical development of proofs for binary programs requires a substantial infrastructure to disassemble the program, define the machine semantics, and actually undertake the required proofs. At the center of t...

Traditional mathematical proofs are static objects: a prover P writes down a sequence of mathematical statements, and then at some later time a verifier V checks that these statements are consistent and correct. Over the years, computer science has changed the notion of a mathematical proof. The first such change was the observation that for all practical purposes, the verification procedure sh...

We introduce a new connection between formal language theory and proof theory. One of the most fundamental proof transformations in a class of formal proofs is shown to correspond exactly to the computation of the language of a certain class of tree grammars. Translations in both directions, from proofs to grammars and from grammars to proofs, are provided. This correspondence allows theoretica...