Expressive power of digraph solvability

Annals of Pure and Applied Logic 163 (3):200-213 (2012)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 100,752

External links

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

Through your library

Similar books and articles

Reducts of the generic digraph.Lovkush Agarwal - 2016 - Annals of Pure and Applied Logic 167 (3):370-391.
The expressive power of k-ary exclusion logic.Raine Rönnholm - 2019 - Annals of Pure and Applied Logic 170 (9):1070-1099.
Computation paths logic: An expressive, yet elementary, process logic.David Harel & Eli Singerman - 1999 - Annals of Pure and Applied Logic 96 (1-3):167-186.
Power set recursion.Lawrence S. Moss - 1995 - Annals of Pure and Applied Logic 71 (2):247-306.
Blowing up the power of a singular cardinal.Moti Gitik - 1996 - Annals of Pure and Applied Logic 80 (1):17-33.
Mild parametrizations of power-subanalytic sets.Siegfried Van Hille - 2022 - Annals of Pure and Applied Logic 173 (6):103105.

Analytics

Added to PP
2013-10-27

Downloads
52 (#416,569)

6 months
12 (#289,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Resolving infinitary paradoxes.Michał Walicki - 2017 - Journal of Symbolic Logic 82 (2):709-723.
The Elimination of Direct Self-reference.Qianli Zeng & Ming Hsiung - 2023 - Studia Logica 111 (6):1037-1055.
Extensions in graph normal form.Michał Walicki - 2022 - Logic Journal of the IGPL 30 (1):101-123.

Add more citations

References found in this work

Paradox without Self-Reference.Stephen Yablo - 1993 - Analysis 53 (4):251-252.
Patterns of paradox.Roy T. Cook - 2004 - Journal of Symbolic Logic 69 (3):767-774.

Add more references