Zobrazeno 1 - 10
of 18
pro vyhledávání: '"Hughes, Dominic J. D."'
Autor:
Pavlovic, Dusko, Hughes, Dominic J. D.
While any infimum in a poset can also be computed as a supremum, and vice versa, categorical limits and colimits do not always approximate each other. If I approach a point from below, and you approach it from above, then we will surely meet if we li
Externí odkaz:
http://arxiv.org/abs/2204.09285
Autor:
Pavlovic, Dusko, Hughes, Dominic J. D.
Recommender systems build user profiles using concept analysis of usage matrices. The concepts are mined as spectra and form Galois connections. Descent is a general method for spectral decomposition in algebraic geometry and topology which also lead
Externí odkaz:
http://arxiv.org/abs/2004.07353
Autor:
Hughes, Dominic J. D.
Proofs are traditionally syntactic, inductively generated objects. This paper reformulates first-order logic (predicate calculus) with proofs which are graph-theoretic rather than syntactic. It defines a combinatorial proof of a formula $\phi$ as a l
Externí odkaz:
http://arxiv.org/abs/1906.11236
Autor:
Hughes, Dominic J. D.
Proof nets for MLL (unit-free Multiplicative Linear Logic) are concise graphical representations of proofs which are canonical in the sense that they abstract away syntactic redundancy such as the order of non-interacting rules. We argue that Girard'
Externí odkaz:
http://arxiv.org/abs/1802.03224
Autor:
Hughes, Dominic J. D.
Wolfram [2, p. 707] and Cook [1, p. 3] claim to prove that a (2,5) Turing machine (2 states, 5 symbols) is universal, via a universal cellular automaton known as Rule 110. The first part of this paper points out a critical gap in their argument. The
Externí odkaz:
http://arxiv.org/abs/1208.6342
Autor:
Hughes, Dominic J. D.
Linking diagrams with path composition are ubiquitous, for example: Temperley-Lieb and Brauer monoids, Kelly-Laplaza graphs for compact closed categories, and Girard's multiplicative proof nets. We construct the category Link=Span(iRel), where iRel i
Externí odkaz:
http://arxiv.org/abs/0805.1441
Autor:
Hughes, Dominic J. D.
This paper presents proof nets for multiplicative-additive linear logic (MALL), called conflict nets. They are efficient, since both correctness and translation from a proof are p-time (polynomial time), and abstract, since they are invariant under t
Externí odkaz:
http://arxiv.org/abs/0801.2421
Publikováno v:
FSCD 2022
FSCD 2022, Aug 2022, Haifa, Israel
Heijltjes, W, Hughes, D & Strassburger, L 2022, Normalization Without Syntax . in A P Felty (ed.), 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 : FSCD 2022 . 2022 edn, vol. 228, 19, Leibniz International Proceedings in Informatics, LIPIcs, vol. 228, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, Germany, pp. 19:1-19:19 . https://doi.org/10.4230/LIPIcs.FSCD.2022.19
FSCD 2022, Aug 2022, Haifa, Israel
Heijltjes, W, Hughes, D & Strassburger, L 2022, Normalization Without Syntax . in A P Felty (ed.), 7th International Conference on Formal Structures for Computation and Deduction, FSCD 2022 : FSCD 2022 . 2022 edn, vol. 228, 19, Leibniz International Proceedings in Informatics, LIPIcs, vol. 228, Schloss Dagstuhl-Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, Germany, pp. 19:1-19:19 . https://doi.org/10.4230/LIPIcs.FSCD.2022.19
We present normalization for intuitionistic combinatorial proofs (ICPs) and relate it to the simply-typed lambda-calculus. We prove confluence and strong normalization. Combinatorial proofs, or "proofs without syntax", form a graphical semantics of p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::617975127fa8cd596475eb88add245ef
https://inria.hal.science/hal-03654060/document
https://inria.hal.science/hal-03654060/document
Autor:
Hughes, Dominic J. D.
Publikováno v:
Annals of Mathematics, 2006 Nov 01. 164(3), 1065-1076.
Externí odkaz:
https://www.jstor.org/stable/20160016
Autor:
Pavlovic, Dusko, Hughes, Dominic J. D.
An adjunction is a pair of functors related by a pair of natural transformations, and relating a pair of categories. It displays how a structure, or a concept, projects from each category to the other, and back. Adjunctions are the common denominator
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::26e007f2f30af0749bd64b0ac26258ff