A Logical Characterization of Constraint-Based Causal Discovery

We present a novel approach to constraint-based causal discovery, that takes the form of straightforward logical inference, applied to a list of simple, logical statements about causal relations that are derived directly from observed (in)dependencies. It is both sound and complete, in the sense that all invariant features of the corresponding partial ancestral graph (PAG) are identified, even in the presence of latent variables and selection bias. The approach shows that every identifiable causal relation corresponds to one of just two fundamental forms. More importantly, as the basic building blocks of the method do not rely on the detailed (graphical) structure of the corresponding PAG, it opens up a range of new opportunities, including more robust inference, detailed accountability, and application to large models

Logical relations for coherence of effect subtyping

A coercion semantics of a programming language with subtyping is typically defined on typing derivations rather than on typing judgments. To avoid semantic ambiguity, such a semantics is expected to be coherent, i.e., independent of the typing derivation for a given typing judgment. In this article we present heterogeneous, biorthogonal, step-indexed logical relations for establishing the coherence of coercion semantics of programming languages with subtyping. To illustrate the effectiveness of the proof method, we develop a proof of coherence of a type-directed, selective CPS translation from a typed call-by-value lambda calculus with delimited continuations and control-effect subtyping. The article is accompanied by a Coq formalization that relies on a novel shallow embedding of a logic for reasoning about step-indexing

A System of Interaction and Structure II: The Need for Deep Inference

This paper studies properties of the logic BV, which is an extension of multiplicative linear logic (MLL) with a self-dual non-commutative operator. BV is presented in the calculus of structures, a proof theoretic formalism that supports deep inference, in which inference rules can be applied anywhere inside logical expressions. The use of deep inference results in a simple logical system for MLL extended with the self-dual non-commutative operator, which has been to date not known to be expressible in sequent calculus. In this paper, deep inference is shown to be crucial for the logic BV, that is, any restriction on the ``depth'' of the inference rules of BV would result in a strictly less expressive logical system

A System of Interaction and Structure

This paper introduces a logical system, called BV, which extends multiplicative linear logic by a non-commutative self-dual logical operator. This extension is particularly challenging for the sequent calculus, and so far it is not achieved therein. It becomes very natural in a new formalism, called the calculus of structures, which is the main contribution of this work. Structures are formulae submitted to certain equational laws typical of sequents. The calculus of structures is obtained by generalising the sequent calculus in such a way that a new top-down symmetry of derivations is observed, and it employs inference rules that rewrite inside structures at any depth. These properties, in addition to allow the design of BV, yield a modular proof of cut elimination.Comment: This is the authoritative version of the article, with readable pictures, in colour, also available at . (The published version contains errors introduced by the editorial processing.) Web site for Deep Inference and the Calculus of Structures at <http://alessio.guglielmi.name/res/cos

Thick 2D Relations for Document Understanding

We use a propositional language of qualitative rectangle relations to detect the reading order from document images. To this end, we define the notion of a document encoding rule and we analyze possible formalisms to express document encoding rules such as LATEX and SGML. Document encoding rules expressed in the propositional language of rectangles are used to build a reading order detector for document images. In order to achieve robustness and avoid brittleness when applying the system to real life document images, the notion of a thick boundary interpretation for a qualitative relation is introduced. The framework is tested on a collection of heterogeneous document images showing recall rates up to 89%

Kant, Bolzano, and the Formality of Logic

In §12 of his 1837 magnum opus, the Wissenschaftslehre, Bolzano remarks that “In the new logic textbooks one reads almost constantly that ‘in logic one must consider not the material of thought but the mere form of thought, for which reason logic deserves the title of a purely formal science’” (WL §12, 46).1 The sentence Bolzano quotes is his own summary of others’ philosophical views; he goes on to cite Jakob, Hoffbauer, Metz, and Krug as examples of thinkers who held that logic abstracts from the matter of thought and considers only its form. Although Bolzano does not mention Kant by name here, Kant does of course hold that “pure general logic”, what Bolzano would consider logic in the traditional sense (the theory of propositions, representations, inferences, etc.), is formal. As Kant remarks in the Introduction to the 2nd edition of Kritik der reinen Vernunft , (pure general) logic is “justified in abstracting – is indeed obliged to abstract – from all objects of cognition and all of their differences; and in logic, therefore, the understanding has to do with nothing further than itself and its own form” (KrV, Bix).

Language Idling and Language in Use Wittgenstein on Following Rules

This paper has a simple goal: it aims to present the difference between static logic and dynamic grammar. At the same time I will stress another difference which traverses logic and grammar: the difference between language idling and language in use. There is a development from static logic to dynamic grammar in Wittgenstein"s philosophy from early to late, whereas the difference between language idling and language in use pervades the whole oeuvre. Therefore I shall distinguish between four different conditions pertaining to the attempt to render the relations that hold language together. We find in early Wittgenstein "idle static logic" and "static logic in use," and in late Wittgenstein "idle dynamic grammar" and "dynamic grammar in use." This four-fold distinction serves to emphasize that the crucial shift to "use," which is usually claimed to be a feature of the Philosophical Investigations, already takes place in the Tractatus. A negligence of this "double shift" from logic to grammar and from idle language to language in use brought about a vast amount of misapprehensions of Wittgenstein"s philosophy, especially of the account of rule following

Logical Step-Indexed Logical Relations

Appel and McAllester's "step-indexed" logical relations have proven to be a simple and effective technique for reasoning about programs in languages with semantically interesting types, such as general recursive types and general reference types. However, proofs using step-indexed models typically involve tedious, error-prone, and proof-obscuring step-index arithmetic, so it is important to develop clean, high-level, equational proof principles that avoid mention of step indices. In this paper, we show how to reason about binary step-indexed logical relations in an abstract and elegant way. Specifically, we define a logic LSLR, which is inspired by Plotkin and Abadi's logic for parametricity, but also supports recursively defined relations by means of the modal "later" operator from Appel, Melli\`es, Richards, and Vouillon's "very modal model" paper. We encode in LSLR a logical relation for reasoning relationally about programs in call-by-value System F extended with general recursive types. Using this logical relation, we derive a set of useful rules with which we can prove contextual equivalence and approximation results without counting steps