Proof Complexity of Non-classical Logics (Q5894972): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Wikidata QID
 
Property / Wikidata QID: Q61835458 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1510102921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom Generators in Propositional Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monotone circuit complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof theoretical approach to default reasoning I: tableaux for default logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution in Modal, Description and Hybrid Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds on Hilbert's Nullstellensatz and Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bounds for the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the correspondence between arithmetic theories and propositional proof systems – a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Complexity of Non-classical Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof complexity of propositional default logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2744124 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequent calculi for propositional nonmonotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for cutting planes proofs with small coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Interpolation and Automatization for Frege Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3800030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4035302 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the disjunction and existential properties in intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational content of intuitionistic propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of complexity results for non-monotonic logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228469 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Foundations of Proof Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative efficiency of propositional proof systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional interpretations of feasibly constructive arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Computing Procedure for Quantification Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resolution-based methods for modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof-complexity results for nonmonotonic reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the disjunction property in intuitionistic and modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: One hundred and two problems in mathematical logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3703316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many-dimensional modal logics: theory and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3022776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unification in intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4754492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical modal logic: A view of its evolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Nonmonotonic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intractability of resolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On lengths of proofs in non-classical logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the admissible rules of intuitionistic propositional logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissible Rules of Modal Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frege systems for extensible modal logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of admissible rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution Frege and extended Frege proof systems in non-classical logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissible Rules of Lukasiewicz Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bases of Admissible Rules of Lukasiewicz Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tools and techniques in modal logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tautologies from Pseudo-Random Generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual weak pigeonhole principle, pseudo-surjective functions, and provability of circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional proof systems, the consistency of first order theories and the complexity of computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of cryptographical conjectures for \(S_2^1\) and EF / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonmonotonic reasoning, preferential models and cumulative logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Carnap, Goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Provability in Systems of Modal Propositional Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5460922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: What is a logic translation? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tautologies with a unique Craig interpolant, uniform vs. nonuniform complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4215637 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4375799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the polynomial calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4152212 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for default reasoning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tableau-based characterization and theorem proving for default logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Machine-Oriented Logic Based on the Resolution Principle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissibility of logical inference rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Propositional Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem concerning the notion of definability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation for extended modal languages / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:37, 5 July 2024

scientific article; zbMATH DE number 6101110
Language Label Description Also known as
English
Proof Complexity of Non-classical Logics
scientific article; zbMATH DE number 6101110

    Statements

    Proof Complexity of Non-classical Logics (English)
    0 references
    0 references
    0 references
    1 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references