منابع مشابه
Count(q) versus the Pigeon-Hole Principle
For each p 2 there exists a model M of I 0 () which satisses the Count(p) principle. Furthermore, if p contains all prime factors of q there exist n; r 2 M and a bijective map f 2 dom(M) mapping f1; 2 A corollary is a complete classiication of the Count(q) versus Count(p) problem. Another corollary shows that the pigeonhole principle for injective maps does not follow from any of the Count(q) p...
متن کاملCount( qq) versus the pigeon-hole principle
For each p ≤ 2 there exist a model M∗ of I∆0(α) which satisfies the Count(p) principle. Furthermore if p contain all prime factors of q there exist n, r ∈ M∗ and a bijective map f ∈ Set(M∗) mapping {1, 2, ..., n} onto {1, 2, ..., n+ qr}. A corollary is a complete classification of the Count(q) versus Count(p) problem. Another corollary solves an open question ([3]). In this note I state and pro...
متن کاملMonotone Proofs of the Pigeon Hole Principle
We study the complexity of proving the Pigeon Hole Principle (PHP) in a monotone variant of the Gentzen Calculus, also known as Geometric Logic. We show that the standard encoding of the PHP as a monotone sequent admits quasipolynomial-size proofs in this system. This result is a consequence of deriving the basic properties of certain quasipolynomial-size monotone formulas computing the boolean...
متن کاملExamining the role of Smart Contracts in the development of the electronic registration system of documents
The document registration system is one of the most important instruments for guaranteeing the rights of individuals and preventing the occurrence of many disputes. In many developed countries, attempts have been made to change the system of registering transactions and documents. Thus, countries like the United States and Britain have changed the status of electronic registrations by adopting ...
متن کاملTree Resolution Proofs of the Weak Pigeon-Hole Principle
We prove that any optimal tree resolution proof of is of size , independently from , even if it is infinity. So far, only a lower bound has been known, in the general case. We also show that any, not necessarily optimal, regular tree resolution proof is bounded by . To best of our knowledge, this is for the first time, the worst case proof complexity is considered. Finally, we discuss possible ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2019
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1424/1/012022