How Hard Is Positive Quantification? (Q5278190): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: seL4 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1145/2981544 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2547321601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Translations on a context free grammar / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Brief Overview of Agda – A Functional Language with Dependent Types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvariables, bracketing and the decidability of positive minimal predicate logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Four Colour Theorem: Engineering of a Formal Proof / rank
 
Normal rank
Property / cites work
 
Property / cites work: Advances in the Formalization of the Odd Order Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory of computation. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive characterizations of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sovability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Isabelle/HOL. A proof assistant for higher-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Mints Hierarchy in First-Order Intuitionistic Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on the Curry-Howard isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof Search and Counter Model of Positive Minimal Predicate Logic / rank
 
Normal rank

Latest revision as of 03:32, 14 July 2024

scientific article; zbMATH DE number 6744575
Language Label Description Also known as
English
How Hard Is Positive Quantification?
scientific article; zbMATH DE number 6744575

    Statements

    How Hard Is Positive Quantification? (English)
    0 references
    0 references
    0 references
    0 references
    13 July 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    intuitionistic logic
    0 references
    automata
    0 references
    complexity
    0 references
    positive quantification
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references