- 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
A finite relation algebra with undecidable network satisfaction problem
Logic Journal of the IGPL 7 (4):547-554 (1999)
Abstract
We define a finite relation algebra and show that the network satisfaction problem is undecidable for this algebraLinks
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
An Undecidable Property of Recurrent Double Sequences.Mihai Prunescu - 2008 - Notre Dame Journal of Formal Logic 49 (2):143-151.
Undecidability of representability as binary relations.Robin Hirsch & Marcel Jackson - 2012 - Journal of Symbolic Logic 77 (4):1211-1244.
Undecidable semiassociative relation algebras.Roger D. Maddux - 1994 - Journal of Symbolic Logic 59 (2):398-418.
An Undecidable Problem in the Algebra of Truth-Tables.Jan Kalicki - 1955 - Journal of Symbolic Logic 20 (3):283-284.
An undecidable problem in the algebra of truth-tables.Jan Kalicki - 1954 - Journal of Symbolic Logic 19 (3):172-176.
On the equational theory of projection lattices of finite von Neumann factors.Christian Herrmann - 2010 - Journal of Symbolic Logic 75 (3):1102-1110.
Undecidability of Algebras of Binary Relations.Robin Hirsch, Ian Hodkinson & Marcel Jackson - 2021 - In Judit Madarász & Gergely Székely (eds.), Hajnal Andréka and István Németi on Unity of Science: From Computing to Relativity Theory Through Algebraic Logic. Springer. pp. 267-287.
Kalicki Jan. An undecidable problem in the algebra of truth-tables. [REVIEW]Gene F. Rose - 1955 - Journal of Symbolic Logic 20 (3):283-284.
Review: Jan Kalicki, An Undecidable Problem in the Algebra of Truth-Tables. [REVIEW]Gene F. Rose - 1955 - Journal of Symbolic Logic 20 (3):283-284.
The Constraint Satisfaction Problem and Universal Algebra.Libor Barto - 2015 - Bulletin of Symbolic Logic 21 (3):319-337.
Analytics
Added to PP
2014-01-21
Downloads
79 (#216,255)
6 months
7 (#491,733)
2014-01-21
Downloads
79 (#216,255)
6 months
7 (#491,733)
Historical graph of downloads
Citations of this work
Qualitative constraint satisfaction problems: An extended framework with landmarks.Sanjiang Li, Weiming Liu & Shengsheng Wang - 2013 - Artificial Intelligence 201 (C):32-58.
An initial study of time complexity in infinite-domain constraint satisfaction.Peter Jonsson & Victor Lagerkvist - 2017 - Artificial Intelligence 245 (C):115-133.
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-68866f4b87-hhxx8 uwo