- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Descriptive complexity of modularity problems on graphs
Bulletin of the Section of Logic 34 (2):61-75 (2005)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
On the descriptive complexity of two disjoint paths problem over undirected graphs.Haroldo G. Benatti & Ruy Jgb de Queiroz - 2006 - Bulletin of the Section of Logic 35 (4):195-214.
19th workshop on logic, language, information and computation (wollic 2012).Luke Ong, Carlos Areces, Santiago Figueira & Ruy de Queiroz - forthcoming - Association for Symbolic Logic: The Bulletin of Symbolic Logic.
The collapse of the descriptive complexity of truth definitions. Completions of Heyting and Boolean algebras.A. G. Dragalin - 1991 - Bulletin of the Section of Logic 20 (3/4):94-95.
On some games played on finite graphs.Bakhadyr Khoussainov - 2002 - Bulletin of the Section of Logic 31 (2):71-79.
On the degree of matrix complexity of Johansson's minimal logic.Jacek Hawranek - 1984 - Bulletin of the Section of Logic 13 (1):50-52.
Time complexity of a proof–search procedure for k4.Toshimasa Matsumoto - 2003 - Bulletin of the Section of Logic 32 (4):201-211.
G. Birkhoff's theorems for regular varieties.Ewa Graczynska - 1997 - Bulletin of the Section of Logic 26 (4).
On problems of definability of propositional connectives.Jacek Kabzinski - 1973 - Bulletin of the Section of Logic 2 (2):127.
Some natural decision problems in automatic graphs.Dietrich Kuske & Markus Lohrey - 2010 - Journal of Symbolic Logic 75 (2):678-710.
Analytics
Added to PP
2013-10-30
Downloads
40 (#565,712)
6 months
4 (#1,263,115)
2013-10-30
Downloads
40 (#565,712)
6 months
4 (#1,263,115)
Historical graph of downloads
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-648784bb4d-xlp8h uwo