Keyword:completeness

Papers
SAT is as Hard as Solving Homogeneous Diophantine Equation of Degree Two Frank Vega EasyChair Preprint no. 9354
NP on Logarithmic Space Frank Vega EasyChair Preprint no. 9555
Sharp-P and the Birch and Swinnerton-Dyer Conjecture Frank Vega EasyChair Preprint no. 9368
Gödel Mathematics Versus Hilbert Mathematics. I. the Gödel Incompleteness (1931) Statement: Axiom or Theorem? Vasil Penchev EasyChair Preprint no. 9073
Fermat’s Last Theorem Proved in Hilbert Arithmetic. III. the Quantum-Information Unification of Fermat’s Last Theorem and Gleason's Theorem Vasil Penchev EasyChair Preprint no. 8280
Short Note on P vs NP Frank Vega EasyChair Preprint no. 7447
A Framework for Intuitionistic Grammar Logics Tim Lyon EasyChair Preprint no. 7068
Dense Complete Set For NP Frank Vega EasyChair Preprint no. 6893
P versus NP Frank Vega EasyChair Preprint no. 3061
Models of Concurrent Kleene Algebra Alexandra Silva In:LPAR23. LPAR-23: 23rd International Conference on Logic for Programming, Artificial Intelligence and Reasoning
A Mathematical Conjecture from P versus NP Frank Vega EasyChair Preprint no. 3415
Representation and Reality by Language: How to make a home quantum computer? Vasil Penchev EasyChair Preprint no. 3371
From the Four-Colors Theorem to a Generalizing “Four-Letters Theorem”: a Sketch for “Human Proof” and the Philosophical Interpretation Vasil Penchev EasyChair Preprint no. 3194
Formalizing Bachmair and Ganzinger's Ordered Resolution Prover Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel and Uwe Waldmann EasyChair Preprint no. 396
Reasoning Inside The Box: Deduction in Herbrand Logics Liron Cohen and Yoni Zohar In:GCAI 2017. 3rd Global Conference on Artificial Intelligence
Asynchronous testing of real-time systems Puneet Bhateja In:SCSS 2017. The 8th International Symposium on Symbolic Computation in Software Science 2017
A rewrite-based computational model for functional logic programming Mircea Marin, Temur Kutsia and Besik Dundua In:SCSS 2016. 7th International Symposium on Symbolic Computation in Software Science
Computational Completeness of Interaction Machines and Turing Machines Peter Wegner, Eugene Eberbach and Mark Burgin In:Turing-100. The Alan Turing Centenary