Complexity issues for Preorders on finite labeled forests

&
In Dieter Spreen, Hannes Diener & Vasco Brattka (eds.), Logic, Computation, Hierarchies. De Gruyter. pp. 165-190 (2014)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1515/9781614518044.165

Links

PhilArchive



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

External links

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

Through your library

My notes

Chapters

Complexity issues for Preorders on finite labeled forests.  (pages 165-190)Victor Selivanov & Peter Hertling

Similar books and articles

Definability in the h -quasiorder of labeled forests.Oleg V. Kudinov, Victor L. Selivanov & Anton V. Zhukov - 2009 - Annals of Pure and Applied Logic 159 (3):318-332.
Labeled calculi and finite-valued logics.Matthias Baaz, Christian G. Fermüller, Gernot Salzer & Richard Zach - 1998 - Studia Logica 61 (1):7-33.
Special Problems of Forests as Ecologic-Economic Systems.J. Barkley Rosser - unknown
Infinite Versions of Some Problems from Finite Complexity Theory.Jeffry L. Hirst & Steffen Lempp - 1996 - Notre Dame Journal of Formal Logic 37 (4):545-553.
Critical environmental hermeneutics.John van Buren - 1995 - Environmental Ethics 17 (3):259-275.
Elements of Finite Model Theory.Leonid Libkin - 2004 - Springer.
Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances.James D. Mitchell, Michal Morayne, Yann Péresse & Martyn Quick - 2010 - Annals of Pure and Applied Logic 161 (12):1471-1485.
Syntax for split preorders.Kosta Došen & Zoran Petrić - 2013 - Annals of Pure and Applied Logic 164 (4):443-481.
A direct independence proof of Buchholz's Hydra Game on finite labeled trees.Masahiro Hamano & Mitsuhiro Okada - 1998 - Archive for Mathematical Logic 37 (2):67-89.
Topological complexity of locally finite ω-languages.Olivier Finkel - 2008 - Archive for Mathematical Logic 47 (6):625-651.
Computational complexity and Godel's incompleteness theorem. McGraw-Hill - unknown
Computational complexity of some Ramsey quantifiers in finite models.Marcin Mostowski & Jakub Szymanik - 2007 - Bulletin of Symbolic Logic 13:281--282.
A Brauerian representation of split preorders.Z. Petric & K. Dosen - 2003 - Mathematical Logic Quarterly 49 (6):579.
Generalizations of the Kruskal-Friedman theorems.L. Gordeev - 1990 - Journal of Symbolic Logic 55 (1):157-181.
Computational model theory: an overview.M. Vardi - 1998 - Logic Journal of the IGPL 6 (4):601-624.

Analytics

Added to PP
2015-03-31

Downloads
10 (#1,192,632)

6 months
6 (#518,648)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

No references found.

Add more references