The causal ladder and the strength of K-causality. I

A unifying framework for the study of causal relations is presented. The causal relations are regarded as subsets of M x M and the role of the corresponding antisymmetry conditions in the construction of the causal ladder is stressed. The causal hierarchy of spacetime is built from chronology up to K-causality and new characterizations of the distinction and strong causality properties are obtained. The closure of the causal future is not transitive, as a consequence its repeated composition leads to an infinite causal subladder between strong causality and K-causality - the A-causality subladder. A spacetime example is given which proves that K-causality differs from infinite A-causality.Comment: 16 pages, one figure. Old title: ``On the relationship between K-causality and infinite A-causality''. Some typos fixed; small change in the proof of lemma 4.

Relational Galois connections between transitive fuzzy digraphs

Fuzzy-directed graphs are often chosen as the data structure to model and implement solutions to several problems in the applied sciences. Galois connections have also shown to be useful both in theoretical and in practical problems. In this paper, the notion of relational Galois connection is extended to be applied between transitive fuzzy directed graphs. In this framework, the components of the connection are crisp relations satisfying certain reasonable properties given in terms of the so-called full powering

Suszko's Problem: Mixed Consequence and Compositionality

Suszko's problem is the problem of finding the minimal number of truth values needed to semantically characterize a syntactic consequence relation. Suszko proved that every Tarskian consequence relation can be characterized using only two truth values. Malinowski showed that this number can equal three if some of Tarski's structural constraints are relaxed. By so doing, Malinowski introduced a case of so-called mixed consequence, allowing the notion of a designated value to vary between the premises and the conclusions of an argument. In this paper we give a more systematic perspective on Suszko's problem and on mixed consequence. First, we prove general representation theorems relating structural properties of a consequence relation to their semantic interpretation, uncovering the semantic counterpart of substitution-invariance, and establishing that (intersective) mixed consequence is fundamentally the semantic counterpart of the structural property of monotonicity. We use those to derive maximum-rank results proved recently in a different setting by French and Ripley, as well as by Blasio, Marcos and Wansing, for logics with various structural properties (reflexivity, transitivity, none, or both). We strengthen these results into exact rank results for non-permeable logics (roughly, those which distinguish the role of premises and conclusions). We discuss the underlying notion of rank, and the associated reduction proposed independently by Scott and Suszko. As emphasized by Suszko, that reduction fails to preserve compositionality in general, meaning that the resulting semantics is no longer truth-functional. We propose a modification of that notion of reduction, allowing us to prove that over compact logics with what we call regular connectives, rank results are maintained even if we request the preservation of truth-functionality and additional semantic properties.Comment: Keywords: Suszko's thesis; truth value; logical consequence; mixed consequence; compositionality; truth-functionality; many-valued logic; algebraic logic; substructural logics; regular connective

Local description of generalized forms on transitive Lie algebroids and applications

In this paper we study the local description of spaces of forms on transitive Lie algebroids. We use this local description to introduce global structures like metrics, $\ast$-Hodge operation and integration along the algebraic part of the transitive Lie algebroid (its kernel). We construct a \v{C}ech-de Rham bicomplex with a Leray-Serre spectral sequence. We apply the general theory to Atiyah Lie algebroids and to derivations on a vector bundle

Constructing continuum many countable, primitive, unbalanced digraphs

AbstractWe construct continuum many non-isomorphic countable digraphs which are highly arc transitive, have finite out-valency and infinite in-valency, and whose automorphism groups are primitive

Questions on transitivity

This handout (it isn’t a paper) presents phenomena and questions, rather than conclusions, related to the concept of transitivity. The idea is to return to these questions at the end of the Workshop to see if we can have a clearer consensus about the best general analysis of phenomena associated with transitivity. Section 2 presents alternative analyses of transitivity and questions about transitivity in three languages I have worked on. Section 3 discusses a few of the different conceptualisations of transitivity that might be relevant to our thinking about the questions related to these languages or that bring up further questions. Section 4 presents some general questions that might be asked of individual languages

Generalized Effective Reducibility

We introduce two notions of effective reducibility for set-theoretical statements, based on computability with Ordinal Turing Machines (OTMs), one of which resembles Turing reducibility while the other is modelled after Weihrauch reducibility. We give sample applications by showing that certain (algebraic) constructions are not effective in the OTM-sense and considerung the effective equivalence of various versions of the axiom of choice