Investigation of the Proof Complexity Measures of Strongly Equal K-Tautologies in Some Proof Systems

Transactions on Machine Learning and Artificial Intelligence
doi 10.14738/tmlai.71.6187
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Scholar Publishing

Related search

Parameterized Proof Complexity

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
2011English

Diagonalization in Proof Complexity

Fundamenta Mathematicae
Number TheoryAlgebra
2004English

Proof Complexity Meets Algebra

ACM Transactions on Computational Logic
Computational MathematicsTheoretical Computer ScienceComputer ScienceLogic
2019English

Proof Complexity of Propositional Default Logic

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Proof Complexity of Propositional Default Logic

Archive for Mathematical Logic
PhilosophyLogic
2011English

Witnessing Matrix Identities and Proof Complexity

International Journal of Algebra and Computation
Mathematics
2018English

Probabilistic Proof Systems

BRICS Report Series
1994English

Conjecture and Proof of Summation of Series Equal to One

2019English

The Complexity of the Max Word Problem and the Power of One-Way Interactive Proof Systems

Computational Complexity
MathematicsComputational MathematicsTheoretical Computer ScienceComputational Theory
1993English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy