Interaction graphs: Graphings

Annals of Pure and Applied Logic 168 (2):278-320 (2017)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2016.10.007

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

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: Additives.Thomas Seiller - 2016 - Annals of Pure and Applied Logic 167 (2):95-154.
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Interaction graphs: Multiplicatives.Thomas Seiller - 2012 - Annals of Pure and Applied Logic 163 (12):1808-1837.
Small universal families for graphs omitting cliques without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
Remarks on the iconicity and interpretation of existential graphs.Risto Hilpinen - 2011 - Semiotica 2011 (186):169-187.
Relational treatment of term graphs with bound variables.W. Kahl - 1998 - Logic Journal of the IGPL 6 (2):259-303.
On the finiteness of the recursive chromatic number.William I. Gasarch & Andrew C. Y. Lee - 1998 - Annals of Pure and Applied Logic 93 (1-3):73-81.
Duplication of directed graphs and exponential blow up of proofs.A. Carbone - 1999 - Annals of Pure and Applied Logic 100 (1-3):1-67.
Game-theoretical semantics for Peirce's existential graphs.Robert W. Burch - 1994 - Synthese 99 (3):361 - 375.
Bar and Line Graph Comprehension: An Interaction of Top‐Down and Bottom‐Up Processes.Priti Shah & Eric G. Freedman - 2011 - Topics in Cognitive Science 3 (3):560-578.
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
Graphs with ∏ 1 0 (K)Y-sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.
Twilight graphs.J. C. E. Dekker - 1981 - Journal of Symbolic Logic 46 (3):539-571.
.Jay Zeman - unknown
Reachability is harder for directed than for undirected finite graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.

Analytics

Added to PP
2016-10-18

Downloads
18 (#814,090)

6 months
7 (#418,426)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

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.
On the Computational Meaning of Axioms.Alberto Naibo, Mattia Petrolo & Thomas Seiller - 2016 - In Ángel Nepomuceno Fernández, Olga Pombo Martins & Juan Redmond (eds.), Epistemology, Knowledge and the Impact of Interaction. Cham, Switzerland: Springer Verlag.
Interaction graphs: Multiplicatives.Thomas Seiller - 2012 - Annals of Pure and Applied Logic 163 (12):1808-1837.
Interaction graphs: Additives.Thomas Seiller - 2016 - Annals of Pure and Applied Logic 167 (2):95-154.

Add more references