A PSPACE-complete first-order fragment of computability logic (Q5410328): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1201.4856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game semantics for linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691485 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to computability logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: From truth to computability. I. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Cirquent Calculus and Abstract Resource Semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional computability logic I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional computability logic II / rank
 
Normal rank
Property / cites work
 
Property / cites work: From truth to computability. II. / rank
 
Normal rank
Property / cites work
 
Property / cites work: In the beginning was game semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to clarithmetic. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to clarithmetic. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to clarithmetic. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: First-order linear logic without modalities is NEXPTIME-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392275 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Soundness and completeness of the Cirquent calculus system CL6 for computability logic / rank
 
Normal rank

Latest revision as of 09:39, 8 July 2024

scientific article; zbMATH DE number 6285707
Language Label Description Also known as
English
A PSPACE-complete first-order fragment of computability logic
scientific article; zbMATH DE number 6285707

    Statements

    A PSPACE-complete first-order fragment of computability logic (English)
    0 references
    0 references
    16 April 2014
    0 references
    computability logic
    0 references
    computational complexity
    0 references
    game semantics
    0 references
    interactive computation
    0 references

    Identifiers