On counting propositional logic and Wagner's hierarchy (Q6100184): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: On measure quantifiers in first-order arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proceedings of the 37th Annual ACM/IEEE Symposium on Logic in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Relational Hoare Logics for Computer-Aided Security Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503674 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Suppes-style sequent calculus for probability logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reduced forms for stochastic sequential machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Chains as Random Input Automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning about knowledge and probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about probabilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5214813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4133135 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform labelled calculi for conditional and counterfactual logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of first-order logics of probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4451078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logic for reasoning about time and reliability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5089025 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate counting in bounded arithmetic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4323294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions of MSO and the monadic counting hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A logical characterization of the counting hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata Studies. (AM-34) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reasoning with time and chance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic extension of intuitionistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Lower Bounds for Satisfiability and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4131648 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic logic revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games against nature / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel computation with threshold functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximin automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximin sequential-like machines and chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Turing Machines and Computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability by Probabilistic Turing Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: On tape-bounded probabilistic Turing machine acceptors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on the Curry-Howard isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: The polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity classes defined by counting quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of computing the permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217604 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some observations on the connection between counting and recursion / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of combinatorial problems with succinct input representation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complete sets and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic quantifiers and games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decisive characterization of BPP / rank
 
Normal rank

Revision as of 11:38, 1 August 2024

scientific article; zbMATH DE number 7699965
Language Label Description Also known as
English
On counting propositional logic and Wagner's hierarchy
scientific article; zbMATH DE number 7699965

    Statements

    On counting propositional logic and Wagner's hierarchy (English)
    0 references
    0 references
    0 references
    0 references
    21 June 2023
    0 references
    quantified propositional logic
    0 references
    counting quantifiers
    0 references
    counting hierarchy
    0 references
    computational complexity
    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

    Identifiers