English
Related papers

Related papers: Cook's Theory and the Twentieth Century Mathematic…

200 papers

In this paper, we make a preliminary interpretation of Cook's theorem presented in [1]. This interpretation reveals cognitive biases in the proof of Cook's theorem that arise from the attempt of constructing a formula in CNF to represent a…

Computational Complexity · Computer Science 2015-01-09 JianMing Zhou , Yu Li

We give four new proofs of the directed version of Brook's Theorem and an NP-completeness result.

Discrete Mathematics · Computer Science 2023-04-14 Pierre Aboulker , Guillaume Aubian

We introduce the concept of quotient in PN spaces and give some examples. We prove some theorems with regard to the completeness of a quotient.

Probability · Mathematics 2007-05-23 Bernardo Lafuerza-Guillen , Donal O'Regan , Reza Saadati

Stephen Cook posited SAT is NP-Complete in 1971. If SAT is NP-Complete then, as is generally accepted, any polynomial solution of it must also present a polynomial solution of all NP decision problems. It is here argued, however, that NP is…

Computational Complexity · Computer Science 2009-11-30 C. Sauerbier

The four authors present their speculations about the future developments of mathematical logic in the twenty-first century. The areas of recursion theory, proof theory and logic for computer science, model theory, and set theory are…

Logic in Computer Science · Computer Science 2007-05-23 Samuel R. Buss , Alexander S. Kechris , Anand Pillay , Richard A. Shore

We review some recent results on $K$-theory of perfection of commutative $\mF_p$-algebras and provide an alternative proof.

K-Theory and Homology · Mathematics 2023-04-05 Kevin Coulembier

This survey paper is an expanded version of lectures given at the Clay Mathematics Academy ; see http://www.claymath.org/programs/outreach/academy/colloquium2005.php These lectures were intended to very young (and motivated) college…

K-Theory and Homology · Mathematics 2007-05-23 Max Karoubi

The basic notions of logic-predicate logic, Peano arithmetic, incompleteness theorems, etc.-have for long been an advanced topic. In the last decades, they became more widely taught, inphilosophy, mathematics, and computer science…

History and Overview · Mathematics 2023-04-03 Gilles Dowek

The general completeness problem of Hoare logic relative to the standard model $N$ of Peano arithmetic has been studied by Cook, and it allows for the use of arbitrary arithmetical formulas as assertions. In practice, the assertions would…

Logic in Computer Science · Computer Science 2017-03-02 Zhaowei Xu , Wenhui Zhang , Yuefei Sui

Mathematical aspects of contemporary classical and quantum gauge theory are sketched.

High Energy Physics - Theory · Physics 2007-05-23 G. Sardanashvily

A sketch of some of the fundamental notions related to the nature of knowledge is offered, with special focus on the role of mathematics and my own opinions. No single idea exposed here is entirely original; indeed, this topic has been…

History and Overview · Mathematics 2023-10-23 Daniel Canarutto

The open question, P=NP?, was presented by Cook (1971). In this paper, a proof that P is not equal to NP is presented. In addition, it is shown that P is not equal to the intersection of NP and co-NP. Finally, the exact inclusion…

Computational Complexity · Computer Science 2007-05-23 R. A. Cohen

The problem of advancing coordinatization of mathematics is considered. The need to develop a theory for measuring value and complexity of mathematical implications and proofs is discussed including motivations, benefits and implementation…

History and Overview · Mathematics 2018-03-07 Peteris Daugulis

In this paper, we use G\"{o}del's incompleteness theorem as a case study for investigating mathematical depth. We take for granted the widespread judgment by mathematical logicians that G\"{o}del's incompleteness theorem is deep, and focus…

Logic · Mathematics 2022-11-08 Yong Cheng

We first review the historical developments, both in physics and in mathematics, that preceded (and in some sense provided the background of) deformation quantization. Then we describe the birth of the latter theory and its evolution in the…

Quantum Algebra · Mathematics 2010-12-13 Daniel Sternheimer

We improve on Gonek-Montgomery's quantitative version of Kronecker's approximation theorem.

Number Theory · Mathematics 2024-05-14 Daria Maksimova

The article gives a survey of mathematical proofs that rely on computer calculations and formal proofs.

History and Overview · Mathematics 2013-02-13 Thomas Hales

Kitchloo and Morava give a strikingly simple picture of elliptic cohomology at the Tate curve by studying a completed version of $S^1$-equivariant $K$-theory for spaces. Several authors (cf [ABG],[KM],[L]) have suggested that an equivariant…

Algebraic Topology · Mathematics 2022-07-22 Kiran Luecke

The assumptions needed to prove Cox's Theorem are discussed and examined. Various sets of assumptions under which a Cox-style theorem can be proved are provided, although all are rather strong and, arguably, not natural.

Artificial Intelligence · Computer Science 2007-05-23 Joseph Y. Halpern

Quantum complementarity is a fundamental feature of quantum systems and has captivated the physics research community for nearly a century, with significant advancements emerging in recent decades. This review traces the historical…

Quantum Physics · Physics 2026-05-27 Diego S. Starke , Jonas Maziero , Marcos L. W. Basso , Tabish Qureshi
‹ Prev 1 2 3 10 Next ›