UCL Discovery
UCL home » Library Services » Electronic resources » UCL Discovery

Representability is not decidable for finite relation algebras

Hirsch, R; Hodkinson, I; (2001) Representability is not decidable for finite relation algebras. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY , 353 (4) pp. 1403-1425. 10.1090/S0002-9947-99-02264-3. Green open access

[img]
Preview
PDF
13344.pdf

Download (344kB)
Type: Article
Title: Representability is not decidable for finite relation algebras
Open access status: An open access version is available from UCL Discovery
DOI: 10.1090/S0002-9947-99-02264-3
Keywords: Science & Technology, Physical Sciences, Mathematics, relation algebra, representation, undecidability, tiling problem, games, algebraic logic, REPRESENTATIONS, LOGIC
UCL classification: UCL
UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: https://discovery.ucl.ac.uk/id/eprint/13344
Downloads since deposit
139Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item