Zobrazeno 1 - 10
of 77
pro vyhledávání: '"Hampson, Christopher"'
Autor:
Hampson, Christopher D.1, Katz, Jeffrey A.2
Publikováno v:
George Washington Law Review. Aug2024, Vol. 92 Issue 4, p851-907. 57p.
Autor:
Alzamel, Mai, Hampson, Christopher, Iliopoulos, Costas S., Lim, Zara, Pissis, Solon, Vlachakis, Dimitrios, Watts, Steven
Publikováno v:
In Theoretical Computer Science 2 November 2023 978
Our concern is the axiomatisation problem for modal and algebraic logics that correspond to various fragments of two-variable first-order logic with counting quantifiers. In particular, we consider modal products with Diff, the propositional unimodal
Externí odkaz:
http://arxiv.org/abs/1905.09536
Autor:
Hampson, Christopher
This paper explores the computational complexity of various natural one-variable fragments of first-order modal logics with the addition of counting quantifiers, over both constant and varying domains. The addition of counting quantifiers provides us
Externí odkaz:
http://arxiv.org/abs/1812.06341
Autor:
Hampson, Christopher Samuel
In this thesis, we explore various computational and axiomatisation problems relating to two-dimensional modal logics that exhibit some modest capacity to count. In particular, we consider modal products in which at least one component is the logic o
Externí odkaz:
http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.682201
Publikováno v:
ABI Journal. Jul2024, Vol. 43 Issue 7, p26-53. 3p.
In the propositional modal (and algebraic) treatment of two-variable first-order logic equality is modelled by a `diagonal' constant, interpreted in square products of universal frames as the identity (also known as the `diagonal') relation. Here we
Externí odkaz:
http://arxiv.org/abs/1509.02060
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Hampson, Christopher, Kurucz, Agi
Publikováno v:
ACM TOCL vol. 16(3) (2015), 27:1-27:36
First-order temporal logics are notorious for their bad computational behaviour. It is known that even the two-variable monadic fragment is highly undecidable over various linear timelines, and over branching time even one-variable fragments might be
Externí odkaz:
http://arxiv.org/abs/1407.1386
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.