نتایج جستجو برای: safe theorem

تعداد نتایج: 268895  

Journal: :Notes on Number Theory and Discrete Mathematics 2023

In this paper, we provide a generalization of Proth’s theorem for integers the form Kp^n+1. particular, primality test that requires modular exponentiation (with proper base a) similar to Fermat’s without computation any GCD’s. We also two tests increase chances proving Kp^n+1 primes. As corollaries, three families N whose can be certified only by a^{N-1} \equiv 1 \pmod (Fermat’s test). One the...

ژورنال: پژوهش های ریاضی 2020

In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem. 

Karimi, Simin,

سرطانهای جلدی را می توان به انواع پیش بدخیم و بدخیم تقسیم نمود. شایعترین ضایعه جلدی پیش بدخیم، کراتوز آفتابی نام دارد که بصورت ضایعات خشک و دلمه دار جلدی بروز می کنند - لنتیگو  آفتابی یک ضایعه پیش بدخیم دیگرن است که بصورت لکه های قهوه ای و صاف (غیر برجسته روی پوست مشاهده می شوند) ضایعات پیش بدخیم در صورت عدم درمان می توانند بدخیم شوند. 

The aim of this paper is to compute a simplicial cohomology group of some specific digital images. Then we define ringand algebra structures of a digital cohomology with the cup product. Finally, we prove a special case of the Borsuk-Ulam theorem fordigital images.

Journal: :Fundam. Inform. 2011
Roberto Gorrieri Cristian Versari

ACCS is a conservative extension of CCS, enriched with an operator of strong prefixing, enabling the modeling of atomic sequences and multi-party synchronization (realized as an atomic sequence of binary synchronizations); the classic dining philosophers problem is used to illustrate the approach. A step semantics for ACCS is also presented directly as a labeled transition system. A safe Petri ...

2015
Jean-Baptiste Jeannin Khalil Ghorbal Yanni Kouskoulas Ryan Gardner Aurora Schmidt Erik Zawadzki André Platzer

The next-generation Airborne Collision Avoidance System (ACAS X) is intended to be installed on all large aircraft to give advice to pilots and prevent mid-air collisions with other aircraft. It is currently being developed by the Federal Aviation Administration (FAA). In this paper we determine the geometric configurations under which the advice given by ACAS X is safe under a precise set of a...

2014
Chantal Keller

Most theorem provers are either hard to trust because they are large programs or hard to use due to a lack of automation. They are thus used by two di erent communities depending on the property one needs most: the ability to prove quickly a large amount of theorems or a high level of safety. My thesis studies a communication between these di erent kinds of tools, by asking for proof witnesses ...

Journal: :J. Symb. Comput. 2000
Andrea Formisano Eugenio G. Omodeo Marco Temperini

Tarski-Givant’s map calculus is briefly reviewed, and a plan of research is outlined aimed at investigating applications of this ground equational formalism in the theorem-proving field. The main goal is to create synergy between first-order predicate calculus and the map calculus. Techniques for translating isolated sentences, as well as entire theories, from first-order logic into map calculu...

2015
Jean-Baptiste Jeannin Khalil Ghorbal Yanni Kouskoulas Ryan Gardner Andre Platzer Aurora Schmidt Erik Zawadzki André Platzer

The next-generation Airborne Collision Avoidance System (ACAS X) is intended to be installed on all large aircraft to give advice to pilots and prevent mid-air collisions with other aircraft. It is currently being developed by the Federal Aviation Administration (FAA). In this paper we determine the geometric configurations under which the advice given by ACAS X is safe under a precise set of a...

2002
Achim D. Brucker Burkhart Wolff

Tools for a specification language can be implemented directly (by building a special purpose theorem prover) or by a conservative embedding into a typed meta-logic, which allows their safe and logically consistent implementation and the reuse of existing theorem prover engines. For being useful, the conservative extension approach must provide derivations for several thousand “folklore” theore...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید