On abstract resource semantics and computability logic (Q980944): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Degrees of indeterminacy of games / rank
 
Normal rank
Property / cites work
 
Property / cites work: A game semantics for linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411816 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to computability logic / 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 II / rank
 
Normal rank
Property / cites work
 
Property / cites work: The intuitionistic fragment of computability logic at the propositional level / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential operators in computability logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Many concepts and two logics of algorithmic reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: In the beginning was game semantics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4774021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Game Semantics of the Affine and Intuitionistic Logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propositional Calculus and Realizability / rank
 
Normal rank

Revision as of 23:44, 2 July 2024

scientific article
Language Label Description Also known as
English
On abstract resource semantics and computability logic
scientific article

    Statements

    On abstract resource semantics and computability logic (English)
    0 references
    0 references
    8 July 2010
    0 references
    The paper consists of two sections, focused on Japaridze's abstract resource semantics and computability logic, respectively. The first section introduces a formal definition of a semantics for the ``logic of resources'' based on the notion of \textit{accomplishable formula}; this semantics coincides with \textit{G. Japaridze}'s semantics defined in [Ann. Pure Appl. Logic 117, No.~1--3, 261--293 (2002; Zbl 1013.03017)] and later extended to the abstract resource semantics. The relation between accomplishable formulae and, firstly, affine logic and, secondly, with intuitionistic propositional logic is presented. The second part of the paper focuses on computability logic, whose semantics is given in terms of the notions of static games and \textit{winnable formula}. The main result of this section is that the notions of accomplishability and winnability coincide. Moreover, a partial answer to a conjecture in [\textit{G. Japaridze}, Ann. Pure Appl. Logic 123, No.~1--3, 1--99 (2003; Zbl 1028.03025)] is given, by proving that uniform winnability coincides with non-uniform winnability; however, the initial conjecture ``computable winnability coincides with uniform computable winnability'' remains open.
    0 references
    abstract resource semantics
    0 references
    logic of tasks
    0 references
    game semantics
    0 references
    linear logic
    0 references
    computability logic
    0 references
    positive fragment of intuitionistic logic
    0 references

    Identifiers