An approach to innocent strategies as graphs (Q418201): 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 / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68Q10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03B70 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 91A80 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03F52 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6038315 / rank
 
Normal rank
Property / zbMATH Keywords
 
innocent strategies
Property / zbMATH Keywords: innocent strategies / rank
 
Normal rank
Property / zbMATH Keywords
 
graph strategies
Property / zbMATH Keywords: graph strategies / rank
 
Normal rank
Property / zbMATH Keywords
 
L-nets
Property / zbMATH Keywords: L-nets / rank
 
Normal rank
Property / zbMATH Keywords
 
concurrent interaction
Property / zbMATH Keywords: concurrent interaction / rank
 
Normal rank
Property / zbMATH Keywords
 
ludics
Property / zbMATH Keywords: ludics / rank
 
Normal rank
Property / zbMATH Keywords
 
L-forests
Property / zbMATH Keywords: L-forests / 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.1016/j.ic.2011.12.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027731833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: CONCUR 2004 - Concurrency Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2849886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous games. II: The true concurrency of innocence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asynchronous Games: Innocence Without Alternation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On full abstraction for PCF: I, II and III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Science Logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locus Solum: From the rules of logic to the logic of rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ludics with repetitions (Exponentials, Interactive types and Completeness) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract Böhm trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5062636 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Games and full completeness for multiplicative linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4222034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof nets for unit-free multiplicative-additive linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial Orders, Event Structures and Linear Strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jump from Parallel to Sequential Proofs: Multiplicatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4896506 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focussing and proof construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263837 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Blind Spot / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ludics is a Model for the Finitary Linear Pi-Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2778815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4809081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4355684 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intuitionistic Dual-intuitionistic Nets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof nets sequentialisation in multiplicative linear logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petri nets, event structures and domains. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Typed event structures and the linear \(\pi \)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the meaning of logical completeness / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:13, 5 July 2024

scientific article
Language Label Description Also known as
English
An approach to innocent strategies as graphs
scientific article

    Statements

    An approach to innocent strategies as graphs (English)
    0 references
    0 references
    0 references
    24 May 2012
    0 references
    innocent strategies
    0 references
    graph strategies
    0 references
    L-nets
    0 references
    concurrent interaction
    0 references
    ludics
    0 references
    L-forests
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references