Zobrazeno 1 - 10
of 131
pro vyhledávání: '"GABBAY, MURDOCH J."'
Autor:
Gabbay, Murdoch J., Losa, Giuliano
We introduce semitopologies, a generalisation of point-set topology that removes the restriction that intersections of open sets need necessarily be open. The intuition is that points are participants in some distributed system, and an open set is a
Externí odkaz:
http://arxiv.org/abs/2402.03253
Autor:
Dowek, Gilles, Gabbay, Murdoch J.
Publikováno v:
Proceedings of the 9th Italian Convention on Computational Logic (CILC 2012), pages 104-118, CEUR Workshop Proceedings Volume 857, ISSN 1613-0073 (urn:nbn:de:0074-857-8). https://nbn-resolving.org/urn:nbn:de:0074-857-8
We define a model of predicate logic in which every term and predicate, open or closed, has an absolute denotation independently of a valuation of the variables. For each variable a, the domain of the model contains an element [[a]] which is the deno
Externí odkaz:
http://arxiv.org/abs/2312.16487
Autor:
Dowek, Gilles, Gabbay, Murdoch J.
Publikováno v:
ACM Transactions on Computational Logic, Volume 13, Number 3, Article 20, Publication date: August 2012
Permissive-Nominal Logic (PNL) is an extension of first-order predicate logic in which term-formers can bind names in their arguments. This allows for direct axiomatisations with binders, such as of the lambda-binder of the lambda-calculus or the for
Externí odkaz:
http://arxiv.org/abs/2312.16480
Autor:
Dowek, Gilles, Gabbay, Murdoch J.
Publikováno v:
Theoretical Computer Science, Volume 451, 14 September 2012, Pages 38-69
Permissive-Nominal Logic (PNL) extends first-order predicate logic with term-formers that can bind names in their arguments. It takes a semantics in (permissive-)nominal sets. In PNL, the forall-quantifier or lambda-binder are just term-formers satis
Externí odkaz:
http://arxiv.org/abs/2312.16239
Publikováno v:
Logic Journal of the IGPL, Volume 18, Issue 6, December 2010, Pages 769-822
Nominal terms extend first-order terms with binding. They lack some properties of first- and higher-order terms: Terms must be reasoned about in a context of 'freshness assumptions'; it is not always possible to 'choose a fresh variable symbol' for a
Externí odkaz:
http://arxiv.org/abs/2312.15651
Autor:
Gabbay, Murdoch J.
We condense the theory of blockchains down to a simple and compact set of four type equations (Idealised EUTxO), and to an algebraic characterisation (abstract chunk systems), and exhibit an adjoint pair of functors between them. This gives a novel a
Externí odkaz:
http://arxiv.org/abs/2007.12404
Autor:
Brunjes, Lars, Gabbay, Murdoch J.
We implement two versions of a simple but illustrative smart contract: one in Solidity on the Ethereum blockchain platform, and one in Plutus on the Cardano platform, with annotated code excerpts and with source code attached. We get a clearer view o
Externí odkaz:
http://arxiv.org/abs/2003.14271
Autor:
Gabbay, Murdoch J.
We propose Equivariant ZFA with Choice as a foundation for nominal techniques that is stronger than ZFC and weaker than FM, and why this may be particularly helpful in the context of automated reasoning.
Comment: In ARW 2018
Comment: In ARW 2018
Externí odkaz:
http://arxiv.org/abs/1803.08727
Autor:
Gabbay, Murdoch J.
We give an accessible presentation to the foundations of nominal techniques, lying between Zermelo-Fraenkel set theory and Fraenkel-Mostowski set theory, and which has several nice properties including being consistent with the Axiom of Choice. We gi
Externí odkaz:
http://arxiv.org/abs/1801.09443
Autor:
Gabbay, Murdoch J.
Publikováno v:
Logical Methods in Computer Science, Volume 14, Issue 2 (May 23, 2018) lmcs:3681
We study the properties of the language of Stratified Sets (first-order logic with $\in$ and a stratification condition) as used in TST, TZT, and (with stratifiability instead of stratification) in Quine's NF. We find that the syntax forms a nominal
Externí odkaz:
http://arxiv.org/abs/1705.07767