Proof Procedure Research Articles

D-complete Single Axioms for the Equivalential Calculus with the rules D and R

Ulrich (2005) showed that most of the known axiomatisations of the classical equivalence calculus (EC) are D-incomplete, that is, they are not complete with the condensed detachment rule (D) as the primary rule of the proof procedure. He proved that the axiomatisation \(\{EEpEqrErEqp, EEEpppp\}\) by Wajsberg (1937) is D-complete and pointed out a number of D-complete single axioms, including one organic single axiom. In this paper we present new single axioms for EC with the condensed detachment and the reversed condensed detachment rules that form D-complete bases and are organic.

Novel reachable set estimation results for delayed linear systems with bounded disturbance

Reachable set estimation is a prominent research topic in control theory and systems science. Reachable set estimation for time-delay systems has drawn a lot of interest. Until now, most approaches to the reachable set estimation problem of time-delay systems have involved building intricate Lyapunov functionals and utilizing LMI techniques. This has resulted in complicated LMI conditions and a proof procedure. The reachable set estimation issue for delayed linear systems with bounded disturbance will be reviewed in this paper. A novel reachable set estimation lemma with a time-delay term is proposed, and based on the acquired lemma, a sufficient condition is given to bound the reachable set estimation of the systems under discussion. In addition, an event-based sufficient criterion for reachable set estimation is also provided. The theoretical analysis in this paper is succinct when compared to previous findings, and the obtained conditions are simple to validate. Lastly, two examples are presented to confirm that the theoretical results hold true.

ω-Groundedness of argumentation and completeness of grounded dialectical proof procedures

Dialectical proof procedures in assumption-based argumentation are in general sound but not complete with respect to both the credulous and skeptical semantics (due to non-terminating loops). This raises the question of whether we could describe exactly what such procedures compute. In a previous paper, we introduce infinite arguments to represent possibly non-terminating computations and present dialectical proof procedures that are both sound and complete with respect to the credulous semantics of assumption-based argumentation with infinite arguments. In this paper, we study whether and under what conditions dialectical proof procedures are both sound and complete with respect to the grounded semantics of assumption-based argumentation with infinite arguments. We introduce the class of ω-grounded and finitary-defensible argumentation frameworks and show that finitary assumption-based argumentation is ω-grounded and finitary-defensible. We then present dialectical procedures that are sound and complete wrt finitary assumption-based argumentation.

Principles of Specific Expertise Use in Investigation of Crimes Against Foundations of National Security of Ukraine

During investigation of crimes against foundations of national security of Ukraine today, latest achievements of science and technology are quite actively used, therefore there is a need for a more rational organization of the procedure of proof and drawing the attention of scientists to the issues of specific expertise use at the stage of pre-trial investigation. The purpose of this article is to determine the general principles of specific expertise use at the stage of pre-trial investigation of crimes against foundations of national security of Ukraine. Methodological background: general scientific and special scientific methods of cognition. Principles of specific expertise use during investigation of criminal offenses are considered and characterized. In particular, it is determined that specific expertise is used during investigation of crimes against foundations of national security of Ukraine based on the following principles: independence of person who has special knowledge; legality; rule of law; research complexity; competitiveness; objectivity; comprehensiveness and completeness of specific expertise use; non-disclosure by a person who uses specific expertise while conducting investigative (search) actions, pre-trial investigation data and operational information; observance of constitutional rights and freedoms of citizens involved in pre-trial investigation procedure; compliance by person with specific expertise, specific expertise use exclusively within the limits of his competence.

Sequence analysis in the development of ethnomethodological conversation analysis

When Harvey Sacks and Emanuel A. Schegloff explored the possibility of a ‘naturalistic observational discipline that could deal with the details of social action(s) rigorously, empirically, and formally’ (Schegloff and Sacks, 1973), it was not by chance that their attention was attracted by records of natural conversations and by conversation as an activity in its own right. For, in conversation, every action, every speaking turn of its participants presents itself as a clearly determinable unit with a beginning and end. This appearance is reinforced by the conversation's transcript, which presents in a seeming order, a sequence of turns. Sequence analysis was developed for ‘conversations’ from this observational basis. In this paper, the requirements and implications concerning the role of indexicality in organising and interpreting participants' turns are examined critically and it is investigated whether sequence analysis is also applicable as a proof procedure to ‘talk in interaction’ and multimodal face-to-face interaction. It is argued that unclearly determined non-verbal actions and multiple forms of simultaneous events may restrict the applicability of sequence analysis or even prevent its successful application altogether. It is argued that for different forms of (communicative) interaction and their constitutive conditions of perception an empirical investigation of the relation between simultaneity and sequentiality may be necessary.

السياسة الجنائية والاقتصاد: مظاهر وحدود التأثير والتأثر، قانون الأعمال في التشريع المغربي نموذجًا

Economic development in the modern era has led to the emergence of crimes different from traditional crimes that affect the national economy and develop alongside the development of the economic and social life of individuals and societies. This has prompted legislators to enact legal rules regulating these matters. The Moroccan legal system related to trade and business has witnessed a radical transformation over the past decade, represented by the amendment of a set of commercial legal texts and the enactment of new ones, as classical criminal law does not accommodate this number of transformations, especially in the field of business. This study discusses the extent to which the Moroccan legislator has succeeded in controlling business crimes at the level of concept and specificity, and at the level of criminalization and punishment, and the effectiveness of the legal texts included in the criminal law for business in framing and combating business crimes. It aims to approach this topic and suggest possible solutions to address it. It deals with business crimes looking at criminal legitimacy, privacy, and procedures for research and proof in business crimes. The study concluded that the technical characteristics of the business field negatively affected the formulation of criminal rules and texts for business, especially with regard to the use of broad terms that carry many legal meanings. There is duplication in the texts regulating the field of business, as well as duplication in the bodies that carry out legislation, and confusion among Moroccan legislators in formulating legal texts related to the field of business due to combining the Latin and Anglo-Saxon schools. The study recommends the need for the independence of criminal law for business, by creating special provisions within codification independent of the codification of criminal law, the need to limit the arbitrary use of authorization, and the need to reduce the intensity of criminalization in the field of business, by adopting a clear and deliberate policy to limit criminalization, limit punishment, and expand the scope of penalties while being inclusive of all the guarantees prescribed for criminal penalties.

The sensitivity of legal proof

The proof paradox results from conflicting intuitions concerning different types of fallible evidence in a court of law. We accept fallible individual evidence but reject fallible statistical evidence even when the conditional probability that the defendant is guilty given the evidence is the same, a seeming inconsistency. This paper defends a solution to the proof paradox, building on a sensitivity account of checking and settling a question. The proposed sensitivity account of legal proof not only requires sensitivity simpliciter but sensitivity of each relevant step of the proof procedure and/or sensitivity concerning all relevant alternatives. This account avoids problems that have been identified for other sensitivity views of legal proof. Moreover, it is argued that sensitivity, rather than safety, is the crucial modal condition for legal proof. It is, finally, shown that the provided account can fruitfully support very different existing views on the relationship between knowledge and legal proof.

Synchronization of delayed stochastic reaction–diffusion Hopfield neural networks via sliding mode control

Synchronization of stochastic reaction–diffusion Hopfield neural networks with s-delays via sliding mode control is investigated in this article. To begin with, we choose suitable functional space for state variables, then the system is transformed into a functional differential equation in an infinite-dimensional Hilbert space by using appropriate functional analysis technique. Based on above preliminary preparation, sliding mode control (SMC) is constructed to drive the error trajectory into the designed switching surface. Specifically, the switching surface is constructed as linear combination of state variables, which is related to control gains. Then novel SMC law is designed which involving delay, reaction diffusion term, and reaching law. Furthermore, the criterion of mean-square exponential synchronization for stochastic delayed reaction–diffusion Hopfield neural networks with s-delays is given in the form of matrix form. This criterion is less restrictive and easy to check in computer. Meanwhile, a different novel Lyapunov–Krasovskii functional (LKF) mixed with Itô’s formula, Young inequality, Hanalay inequality is employed in this proof procedure. At last, a numerical example is presented to validate the availability of theoretical result. The simulation is based on the finite difference method, and numerical result coincides with the theoretical result proposed.

Technical supervision in criminal proceedings

The principle of finding out the truth is one of the fundamental principles of the criminal process. Within it, the reactions of the individual who harm the values protected by criminal norms are analyzed, aiming to guarantee the rights of the parties and other participants, as well as the efficient exercise of the duties of the judicial bodies.
 Although the purpose of criminal proceedings is no longer effectively enshrined in the Code of Criminal Procedure, the notion is nevertheless found in Article 8 of the Code of Criminal Procedure under the title "Fairness and reasonable term of criminal proceedings". It stipulates that criminal prosecution and trial must be conducted in compliance with procedural guarantees and the rights of parties and procedural subjects in such a way that facts constituting criminal offences are ascertained in a timely and complete manner, no innocent person is held criminally responsible and any individual who has committed a crime is punished according to law, within a reasonable time.
 According to Article 97 para. (1) Code of Criminal Procedure, evidence is those realities, events, circumstances that serve to establish the existence or non-existence of a crime, as well as to the identity of the person who committed it. Thus, evidence comprises three interconnected and interdependent elements: evidence, means of proof and evidentiary procedures. The literature states that by introducing this system, "a more effective control over the manner of taking evidence can be established. Moreover, the analysis of the evidence will be possible only in terms of form, so that it complies with the law, while the analysis of the evidentiary procedures will concern the technical operation by which that means of evidence was obtained."
 The use of technical supervision as an evidentiary procedure in criminal proceedings is a topical topic, given the technological leap in communication and information that has taken place in recent years. We note that in the title dedicated to evidence (Title IV) of the New Code of Criminal Procedure we find a new chapter (Chapter IV), which refers to special surveillance or investigation techniques. This legislation seeks to strike a balance between ensuring the State's right to use new evidentiary procedures and respecting the right to privacy and the secrecy of correspondence.
 Thus, Article 138 para. (1) The Code of Criminal Procedure expressly and exhaustively provides for special technical surveillance techniques, as follows: letter (a) interception of conversations and communications; lit.(b) access to an information system; lit.(c) video, audio or photographic surveillance; (d) tracking or tracing by technical means; lit.(e) obtaining data on a person's financial transactions. Interception is defined as the intervention of authorized bodies in any kind of conversations or in any other electronic means of communication involving the idea of confidentiality.
 The results of the technical surveillance activity are recorded in the report, which will thus become a genuine means of evidence, being concluded in accordance with the provisions of Article 143 of the Criminal Procedure Code. Also, Articles 139-146 of the Code of Criminal Procedure provide for the cases that allow such restrictive measures against human rights and freedoms to be taken, the conditions to be met, the bodies authorized to carry out these activities, as well as the ways of verifying these means of evidence.
 Obtaining evidence by means of these special evidentiary procedures requires a carefully organized activity consisting in tracking the data subjects, the activities they carry out, the individuals with whom they come into contact, as well as the interception of any communication dip between them. This type of evidence was appreciated as a real modernization of the evidentiary system in criminal proceedings

Tractable algorithms for strong admissibility

Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded extension. As such, strongly admissible sets and labellings can be used as an explanation of membership of the grounded extension, as is for instance done in some of the proof procedures for grounded semantics. In the current paper, we present two polynomial algorithms for constructing relatively small strongly admissible labellings, with associated min–max numberings, for a particular argument. These labellings can be used as relatively small explanations for the argument’s membership of the grounded extension. Although our algorithms are not guaranteed to yield an absolute minimal strongly admissible labelling for the argument (as doing so would have implied an exponential complexity), our best performing algorithm yields results that are only marginally larger. Moreover, the runtime of this algorithm is an order of magnitude smaller than that of the existing approach for computing an absolute minimal strongly admissible labelling for a particular argument. As such, we believe that our algorithms can be of practical value in situations where the aim is to construct a minimal or near-minimal strongly admissible labelling in a time-efficient way.

Finite-time boundedness of switched linear systems via periodically intermittent control

This paper focuses on finite-time boundedness problem of switched linear systems under periodically intermittent control. Sufficient conditions are established to guarantee finite-time boundedness or finite-time stability of switched linear systems under periodically intermittent control. The proof procedures are implemented successfully resorting to piecewise Lyapunov functions. Based on the linear matrix inequality technique, the conditions are casted into a convex optimisation problem and therefore, they can be efficiently handled. The method proposed in this paper is a much potentially useful one in practice because of its economical and efficient nature that is easy to employ. Finally, two examples are given to express the validity and efficiency of the proposed methods.

A conversation analytic approach to schizophrenic interaction: methodological reflections on disruptions of the common-sense world.

Certain schools of phenomenological psychiatry conceive of schizophrenia as a pathology of common-sense. Ethnomethodological enquiry, with its roots in Schutzian social phenomenology, takes as its domain, topic, and substance of study the ongoing achievement of a common-sense world between social members. Yet, dialogue between psychiatry and ethnomethodological approaches is thin. In this article, we discuss a conversation analytic approach to schizophrenic interaction which has generated and utilized a model of a five-world manifold to frame analyses of talk-in-interaction. 'Worlds' are conceived, after Schutz, as finite domains of meaning, and the model operates as a breach of natural attitude assumptions to examine mechanisms of the constitution of the one-world-in-common of common-sense. It is suggested that certain aspects of schizophrenic talk might receive account in terms of a loss of integration between these five domains of meaning. Conversation Analytic methods were applied to transcripts of audio recordings of psychiatric interviews but encountered hurdles that motivated the broadening of methodological scope. Such hurdles included a weakening of the next turn proof procedure, implicit reification of the schizophrenia construct, and problems of translation presented by the analyst's normative membership encountering non-normative life-worlds of schizophrenic experience. Strategic responses to these hurdles included exploring linkages between phenomenological psychiatry and ethnomethodological approaches, as well as an engagement of ethnomethodological self-reflection and conceptual clarification of the schizophrenia construct in line with Garfinkel's unique adequacy requirement. The manifold model is glossed, and interaction between two of its worlds - a world of concrete, situational immediacies and another of abstract organizations - is explored in more detail via analysis of conversational data. It is suggested that the five-world model, along with further micro-analysis of talk-in-interaction, might have implications in psychiatry for topics such as autism, double bookkeeping, concretism, theories of disturbed indexicality, and insight attribution. We conclude that the consideration of atypical interaction obliges the interaction analyst to take account of their own implicit normative world-frames and that the use of domain-specific top-down models in conjunction with the inductive approach of Conversation Analysis may extend the reach of CA to facilitate productive dialogue with other disciplines.

Thread-modular counter abstraction: automated safety and termination proofs of parameterized software by reduction to sequential program verification

AbstractParameterized programs are composed of an arbitrary number of concurrent, infinite-state threads. Automated safety and liveness proofs of such parameterized software are hard; state-of-the-art methods for their formal verification rely on intricate abstractions and complicated proof techniques that impede automation. In this paper, we introduce thread-modular counter abstraction (TMCA), a lean new abstraction technique to replace the existing heavy proof machinery. TMCA is a structured abstraction framework built from a novel combination of counter abstraction, thread-modular reasoning, and predicate abstraction. Its major strength lies in reducing the parameterized verification problem to the sequential setting, for which powerful proof procedures, efficient heuristics, and effective automated tools have been developed over the past decades. In this work, we first introduce the TMCA abstraction paradigm, then present a fully automated method for parameterized safety proofs, and finally discuss its application to automated termination and liveness proofs of parameterized software.

The measurement of responsivity of infrared photodetectors using a cavity blackbody

For the measurement of responsivity of an infrared photodetector, the most-used radiation source is a blackbody. In such a measurement system, distance between the blackbody, the photodetector and the aperture diameter are two parameters that contribute most measurement errors. In this work, we describe the configuration of our responsivity measurement system in great detail and present a method to calibrate the distance and aperture diameter. The core of this calibration method is to transfer direct measurements of these two parameters into an extraction procedure by fitting the experiment data to the calculated results. The calibration method is proved experimentally with a commercially extended InGaAs detector at a wide range of blackbody temperature, aperture diameter and distance. Then proof procedures are further extended into a detector fabricated in our laboratory and consistent results were obtained.

Adaptive Fuzzy Event-Triggered Cooperative Control for Multi-Robot Systems: A Predefined-Time Strategy.

A predefined-time adaptive fuzzy cooperative controller with event triggering is proposed for multi-robot systems that takes into account external disturbances, input saturation, and model uncertainties in this paper. First, based on the asymmetric tan-type barrier Lyapunov function, a predefined-time controller is proposed to acquire a quick response and more precise convergence time under the directed communication topology. Second, predefined-time fuzzy logic systems are developed to approximate external disturbances and model uncertainties. Third, a dynamic relative threshold event-triggered mechanism is improved to save the communication resources of the robots. Subsequently, the proof procedure for the predefined-time stability is given using the Lyapunov stability theorem. Finally, some simulation examples, including a comparative experi-ment on multi-robot systems, are provided to test the effectiveness of the above algorithm.

A Proof Procedure for Separation Logic with Inductive Definitions and Data

A Proof Procedure for Separation Logic with Inductive Definitions and Data

On Lagrange Multiplier Theorems for Non-smooth Optimization for a Large Class of Variational Models in Banach Spaces

This article develops optimality conditions for a large class of non-smooth variational models. The main results are based on standard tools of functional analysis and calculus of variations. Firstly we address a model with equality constraints and, in a second step, a more general model with equality and inequality constraints, always in a general Banach space context. We highlight some novelties are introduced related to the proof procedures developed in this text, which are in general softer than those concerning the present literature.

Peculiarities of the investigation of frauds disguised as civil legal relations

The materials of judicial and investigative practice were analyzed, as a result of which shortcomings in the process of proof have been identified, to eliminate which it is appropriate to distinguish three stages in the fraud investigation methodology: 1) features of receiving and checking fraud reports and working with the victim; 2) collecting evidence of the use of deception or abuse of trust by a specific person before his or her detention; 3) collection of evidence after arrest and notification of suspicion to a person involved in committing fraud. It has been noted that each of the stages is characterized by a feature in relation to tactical tasks and means of solving them and is acceptable and understandable to employees of practical units, as it is related to specific procedural features of their work.
 It has been determined that the peculiarities of the stage of receiving and checking fraud reports and the procedure of the investigator’s work with the victim are the need to record the initiative of the victim (in person or through a representative) to prosecute the guilty person and demand compensation for the damage caused. A set of actions aimed at solving typical tactical tasks solved at this stage has been presented.
 It has been noted that the courts recognize as a legal basis for the detention of a person suspected of committing fraud, only collected evidence of the use of deception or abuse of trust during the acquisition of property or the right to it. Therefore, at the stage of collecting evidence of involvement in fraud of a specific person before his or her arrest, the investigator must solve quite specific tactical tasks, taking into account this, it has been recommended to carry out a set of measures and procedural actions.
 The specifics of evidence collection after the arrest and notification of suspicion to a person involved in fraud were revealed through the implementation of a complex of investigative actions (presentation for identification; interrogations, obtaining temporary access to things and documents, etc.).
 The need to simplify the procedure of proof in proceedings on simple, minor criminal offenses related to fraud and more active use of the institution of concluding agreements provided for in Art. 468 of the CCP of Ukraine.

Activities of law enforcement agencies and the court in bringing offenders to administrative responsibility for domestic violence

The scientific article examines the activities of law enforcement agencies, in particular the police and the court, in bringing offenders to administrative responsibility for domestic violence. The article discusses the concept of domestic violence, forms and manifestations of domestic violence. The provisions of the legislation providing for administrative responsibility have been studied. It is noted that administrative responsibility is provided for in Article 173-2 of the Code of Administrative Offenses.
 It was emphasized that according to the Criminal Code of Administrative Offenses, the police are obliged to draw up a protocol on an administrative offense provided for in Article 173-2 of the Criminal Code of Administrative Offenses. In addition, the employees of this law enforcement agency are obliged to collect evidence to confirm the story set out in the protocol. After that, the case materials are transferred to the court.
 Some problems of the implementation of administrative responsibility are disclosed, in particular, it is stated that the practical application of Article 173-2 is quite difficult. The problem is that the legislator does not quite clearly describe the objective side of this offense, and the acts of interpretation interpret the content of the said norm quite inconsistently.
 It was emphasized that there are certain problems in proof. It is noted that the resolutions under Art. 173-2 of the Code of Ukraine on Administrative Offenses demonstrate that the following are usually used in evidence: a protocol on an administrative offense, police reports, explanations of a person who is brought to administrative responsibility, explanations of a victim, a statement about the commission of domestic violence, an urgent restraining order, a form for assessing the risks of committing domestic violence, printouts of messages from "Viber" and "Telegram", video recordings.
 It is noted that the closure of the proceedings usually occurs due to insufficient evidence of guilt according to the set plot of the protocol, which usually results from the following reasons: unqualified police officers; court practice on domestic violence is not yet sufficiently developed; the circumstances of the offense usually occur TETA-TET; victims neglect their rights to gather evidence.
 It was emphasized that significant steps have already been taken at the legislative level to improve the situation in combating domestic violence. However, as practice shows, the procedure of proof in cases is imperfect. The urgent need to strengthen control over offenders by the police was emphasized.

On the Proof of Sylow’s Theorems in Group Theory

The Sylow’s theorems are significant principles for analysis of special subgroups of a finite group, and they are significant theories in finite group research area. It is firmly established that every group owns more than one Sylow group pertaining to every prime factor of . The purpose of this article is to summarize and generalize the existing research progress of Sylow’s theorems. A summary of them will help more people comprehend and apply group theory to analyze problems. In this paper, the basic information of three distinct Sylow’s theorems are introduced, including their definitions and detailed proof procedures. After that, some examples and application that are related to the Sylow’s theorems are shown one by one. After that, the relationship between the Sylow’s theorems to that of the orbit-stabilizer theorem is discussed. This work will potentially stimulate more research efforts on the basis theorems in group theory.