Interaction graphs: Additives

Annals of Pure and Applied Logic 167 (2):95-154 (2016)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2015.10.001

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,219

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Interaction graphs: Graphings.Thomas Seiller - 2017 - Annals of Pure and Applied Logic 168 (2):278-320.
A-computable graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2016 - Annals of Pure and Applied Logic 167 (3):235-246.
The monadic second-order logic of graphs IV: Definability properties of equational graphs.Bruno Courcelle - 1990 - Annals of Pure and Applied Logic 49 (3):193.
Recursive coloration of countable graphs.Hans-Georg Carstens & Peter Päppinghaus - 1983 - Annals of Pure and Applied Logic 25 (1):19-45.
Reducts of the Henson graphs with a constant.András Pongrácz - 2017 - Annals of Pure and Applied Logic 168 (7):1472-1489.
Universal graphs and functions on ω1.Saharon Shelah & Juris Steprāns - 2021 - Annals of Pure and Applied Logic 172 (8):102986.
Forcing with copies of the Rado and Henson graphs.Osvaldo Guzmán & Stevo Todorcevic - 2023 - Annals of Pure and Applied Logic 174 (8):103286.
The computational strength of matchings in countable graphs.Stephen Flood, Matthew Jura, Oscar Levin & Tyler Markkanen - 2022 - Annals of Pure and Applied Logic 173 (8):103133.
On universal graphs without instances of CH.Saharon Shelah - 1984 - Annals of Pure and Applied Logic 26 (1):75-87.
Universal graphs at ℵ ω 1 + 1.Jacob Davis - 2017 - Annals of Pure and Applied Logic 168 (10):1878-1901.

Analytics

Added to PP
2015-11-25

Downloads
32 (#710,116)

6 months
8 (#597,840)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Interaction graphs: Graphings.Thomas Seiller - 2017 - Annals of Pure and Applied Logic 168 (2):278-320.

Add more citations

References found in this work

Typed lambda-calculus in classical Zermelo-Frænkel set theory.Jean-Louis Krivine - 2001 - Archive for Mathematical Logic 40 (3):189-205.
Interaction graphs: Multiplicatives.Thomas Seiller - 2012 - Annals of Pure and Applied Logic 163 (12):1808-1837.
Multiplicatives.Jean-Yves Girard - 1987 - In G. Lolli (ed.), Logic and Computer Science: New Trends and Applications. Rosenberg & Sellier. pp. 11--34.
Between logic and quantic: a tract.Jean-Yves Girard - 2004 - In Thomas Ehrhard (ed.), Linear logic in computer science. New York: Cambridge University Press. pp. 316--346.

Add more references