That the Laws be Faithfully Executed: The Perils of the Government Legal Advisor

Suppose you practice business law. Your client comes to you and says We have a major deal in the works. It is aggressive and cutting edge, and we need an opinion from you saying that it is legal. Obviously, you cannot promise that. First, you need to know what the deal is. So, you examine the documents and carefully analyze the law. Unfortunately, you have only bad news to report: the deal is illegal, and there is no way to fix it. But with a little creative stretching of the law and some body English you could make a case for it that might, just might, pass the laugh test-but only barely. What do you do? Should you stretch the law and write the opinion that your client dearly wants

Representation, Interpretation, and Surrogative Reasoning

In this paper, I develop Mauricio Suárez’s distinction between denotation, epistemic representation, and faithful epistemic representation. I then outline an interpretational account of epistemic representation, according to which a vehicle represents a target for a certain user if and only if the user adopts an interpretation of the vehicle in terms of the target, which would allow them to perform valid (but not necessarily sound) surrogative inferences from the model to the system. The main difference between the interpretational conception I defend here and Suárez’s inferential conception is that the interpretational account is a substantial account—interpretation is not just a “symptom” of representation; it is that in virtue of what something is an epistemic representation of a something else

A 2D model of Causal Set Quantum Gravity: The emergence of the continuum

Non-perturbative theories of quantum gravity inevitably include configurations that fail to resemble physically reasonable spacetimes at large scales. Often, these configurations are entropically dominant and pose an obstacle to obtaining the desired classical limit. We examine this "entropy problem" in a model of causal set quantum gravity corresponding to a discretisation of 2D spacetimes. Using results from the theory of partial orders we show that, in the large volume or continuum limit, its partition function is dominated by causal sets which approximate to a region of 2D Minkowski space. This model of causal set quantum gravity thus overcomes the entropy problem and predicts the emergence of a physically reasonable geometry.Comment: Corrections and clarifications. Conclusions unchange

The Information-Flow Approach to Ontology-Based Semantic Integration

In this article we argue for the lack of formal foundations for ontology-based semantic alignment. We analyse and formalise the basic notions of semantic matching and alignment and we situate them in the context of ontology-based alignment in open-ended and distributed environments, like the Web. We then use the mathematical notion of information flow in a distributed system to ground three hypotheses that enable semantic alignment. We draw our exemplar applications of this work from a variety of interoperability scenarios including ontology mapping, theory of semantic interoperability, progressive ontology alignment, and situated semantic alignment

Faithful Hermeneutics

This article was presented at the Annual Meeting of the Association of American Law Schools on January 9, 2009 as part of a panel on Scriptural and Constitutional Hermeneutics. The panel was co-sponsored by the Law and Religion Section, Section on Jewish Law, and Section on Islamic Law, and the papers will be published by the Michigan State Law Review. My article compares legal and religious hermeneutics by exploring the dual nature of what I term faithful hermeneutics. The ambiguity evoked by this phrase is intentional. On one hand, it suggests an investigation of the relationship between legal and religious interpretation by comparing hermeneutical activities undertaken by faithful adherents to these two different textual traditions. In this first sense, it is to compare how these practices are the hermeneutics of the faithful. On the other hand, the phrase suggests an analysis of how interpreters in these two traditions remain faithful to the nature of their practice. In this second sense, it is to compare how hermeneutics can be faithfully accomplished. My thesis is that these two senses of faithful hermeneutics are connected. The fact that it is faithful adherents who engage in the interpretive practice in large part defines how they can, and should, remain faithful to the interpretive enterprise. I anchor my argument in Hans-Georg Gadamer\u27s critique of historicism, in which he references the practices of legal and religious hermeneutics. Gadamer\u27s philosophical hermeneutics explains how faith is a prerequisite of understanding, even as understanding revitalizes and reshapes the faith one brings to a textual tradition. I then unfold the critical dimensions of faithful hermeneutics by comparing the work of Cardinal Joseph Ratzinger (later Pope Benedict XVI) and Gianni Vattimo on the Catholic tradition. I argue that these two thinkers display both the broad range and the non-methodological character of the critical insights of faithful hermeneutics. I conclude by suggesting that the parallels between religious and legal hermeneutics are instructive, but that we remember that it would be a mistake to conflate these two instances of faithful hermeneutics in our secular age

Nested Term Graphs (Work In Progress)

We report on work in progress on 'nested term graphs' for formalizing higher-order terms (e.g. finite or infinite lambda-terms), including those expressing recursion (e.g. terms in the lambda-calculus with letrec). The idea is to represent the nested scope structure of a higher-order term by a nested structure of term graphs. Based on a signature that is partitioned into atomic and nested function symbols, we define nested term graphs both in a functional representation, as tree-like recursive graph specifications that associate nested symbols with usual term graphs, and in a structural representation, as enriched term graph structures. These definitions induce corresponding notions of bisimulation between nested term graphs. Our main result states that nested term graphs can be implemented faithfully by first-order term graphs. keywords: higher-order term graphs, context-free grammars, cyclic lambda-terms, higher-order rewrite systemsComment: In Proceedings TERMGRAPH 2014, arXiv:1505.0681