The paper presents a uniform proof-theoretic treatment of several kinds of free logic, including the logics of existence and definedness applied in constructive mathematics and computer science, and called here quasi-free logics. All free and quasi-free logics considered are formalised in the framework of sequent calculus, the latter for the first time. It is shown that in all cases remarkable simplifications of the starting systems are possible due to the special rule dealing with identity and existence predicate. Cut elimination is (...) proved in a constructive way for sequent calculi adequate for all logics under consideration. (shrink)

Investiga-se a possibilidade de uma abordagem do fenômeno do pluralismo lógico a partir de uma perspectiva inspirada no pensamento de Quine. A matematização da lógica termina por levar à flexibilização da teoria lógica, logo surgindo, não apenas sistemas complementares e alternativos à lógica clássica, mas também a questão da admissibilidade de mais do que um sistema lógico. A tal posição se dá o nome “pluralismo lógico”. Quine foi um destacado defensor da lógica clássica a partir de uma perspectiva monista, ainda (...) que admitisse em princípio a possibilidade de sua revisão. Pode-se, contudo, investigar se as linhas gerais do pensamento quineano são compatíveis com uma perspectiva pluralista. Algumas possibilidades são levantadas tomando em consideração propostas como as teorias pluralistas de Carlo Dalla Pozza e Richard Epstein. Conclui-se que, embora Quine não concebesse a possibilidade de apoiar o pluralismo lógico, a sua filosofia ajuda a enquadrar e avaliar as maneiras de estudar o assunto. (shrink)

This thesis extends Kit Fine's truthmaker semantics for counterfactuals to indicative conditionals. First, I provide Fine's truthmaker semantics and his extension to counterfactuals. Then I introduce a notion of context state into the semantics and provide the verification-conditions for indicative conditionals by employing this notion of context state. Afterwards, I turn to the logic of indicative conditionals under exact semantics and discuss the principles and inference rules which raise disagreements between variably strict and strict conditionals accounts. The account I provide (...) shows its promise by validating a plausible combination of principles and strikes a balance between variably strict and strict conditional theories. I discuss certain principles in logic of indicative conditionals under exact semantics in detail and show how the present account validates the plausible combination of them. In the end, I draw comparisons between the viable theories for indicatives and the present one, and argue that the present account takes the advantage in several respects. (shrink)

I argue there are some objects which do not respect the Law of the Excluded Middle, i.e., which are such that, for some property F, the disjunction Fo v ~Fo fails to be true. I call such objects “odd objects” and present three examples—fictional objects, nonsort objects, and quantum objects. I argue that each of these objects is best understood as violating LEM. I, then, discuss Jessica Wilson’s account of metaphysical indeterminacy. I show how the indeterminacy which arises with odd (...) objects can be accounted for on Wilson’s account. I, then, argue that my Wilson-inspired, but non-LEM-respecting, account of metaphysical indeterminacy is superior to Wilson’s in terms of costs and benefits. (shrink)

The Genuine Process Logic described here (abbreviation: GPL) places the object-bound process itself at the center of formalism. It should be suitable for everyday use, i.e. it is not primarily intended for the formalization of computer programs, but instead, as a counter-conception to the classical state logics. The new and central operator of the GPL is an action symbol replacing the classical state symbols, e.g. of equivalence or identity. The complete renunciation of object-language state expressions also results in a completely (...) new metalinguistic framework, both regarding the axioms and the expressive possibilities of this system. A mixture with state logical terms is readily possible. (shrink)

This paper deals with a collection of concerns that, over a period of time, led the author away from the Routley–Meyer semantics, and towards proof- theoretic approaches to relevant logics, and indeed to the weak relevant logic MC of meaning containment.

It is widely accepted by formal and informal logicians alike that a formal logic which, by the lights of English, gets the connectives wrong, nevertheless conspires to get entailment right—right that is, modulo English. There is a vexing problem occasioned by this semantic alienation of formal logic. It is next to impossible for formal logic to meet the expectations of realism. What, then, of informal logic?

How can different individuals' probability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events -- the agenda -- is a sigma-algebra and is thus closed under disjunction (union) and conjunction (intersection). We drop this demanding assumption and explore probabilistic opinion pooling on general agendas. One might be interested in the probability of rain and that of an interest-rate increase, but not in the probability of rain or (...) an interest-rate increase. We characterize linear pooling and neutral pooling for general agendas, with classic results as special cases for agendas that are sigma-algebras. As an illustrative application, we also consider probabilistic preference aggregation. Finally, we compare our results with existing results on binary judgment aggregation and Arrovian preference aggregation. This paper is the first of two self-contained, but technically related companion papers inspired by binary judgment-aggregation theory. (shrink)

The purpose of this paper is to develop a class of semantic tableau systems for some counterfactual logics. All in all I will discuss 1024 systems. Possible world semantics is used to interpret our formal languages. Soundness results are obtained for every tableau system and completeness results for a large subclass of these.

This thesis is concerned with the challenge truth-value gaps pose to the principle of bivalence. The central question addressed is: are truth-value gaps counterexamples to bivalence and is the supposition of counterexamples coherent? My aim is to examine putative cases of truth-value gaps against an argument by Timothy Williamson, which shows that the supposition of counterexamples to bivalence is contradictory. The upshot of his argument is that either problematic utterances say nothing, or they cannot be neither true nor false. I (...) start by identifying truth-bearers: an utterance, for instance, is a truth-bearer if it says that something is the case. Truth-bearers are evaluable items, with truth- and falsity-conditions statable in corresponding instances of schemas for truth and falsehood. A genuine case of a truth-value gap should be an utterance that is neither true nor false but says something to be the case. But it is inconsistent to accept the schemas for truth and falsehood and the existence of genuine cases of truth-value gaps. Secondly, I expound Williamson’s argument, which explores this inconsistency, and I identify two kinds of strategy to disarm his argument: those that preserve the schemas for truth and falsehood, and those that do not. Neither strategy is found to be persuasive. Thirdly, I argue that cases of reference failure causing truth-value gaps illustrate the upshot of Williamson’s argument. Fourthly, I examine Scott Soames’s account of liar sentences as counterexamples to bivalence. Soames adopts a strategy of the first kind to avoid contradictions. I argue that his solution allows some contradictions to be true, and that he fails to show that liar sentences are truth-bearers. Finally, I examine Charles Travis’s case for isostheneia: an equal balancing of reasons to evaluate a statement as true or as false, in which case a statement is neither. Travis avoids contradictions by adopting a strategy of the second kind. I argue that the schemas for truth and falsehood are immune to Travis’s objections, and that isostheneia fails to identify evaluable items. The cases examined confirm that utterances that are neither true nor false say nothing. My claim is thus that truth-value gaps are not counterexamples to bivalence. (shrink)

According to the naive theory of vagueness, the vagueness of an expression consists in the existence of both positive and negative cases of application of the expression and in the non- existence of a sharp cut-off point between them. The sorites paradox shows the naive theory to be inconsistent in most logics proposed for a vague language. The paper explores the prospects of saving the naive theory by revising the logic in a novel way, placing principled restrictions on the transitivity (...) of the consequence relation. A lattice-theoretical framework for a whole family of “tolerant logics” is proposed and developed. Particular care is devoted to the relation between the salient features of the formal apparatus and the informal logical and semantic notions they are supposed to model. A suitable non-transitive counterpart to classical logic is defined. Some of its properties are studied, and it is eventually shown how an appropriate regimentation of the naive theory of vagueness is consistent in such a logic. (shrink)

Performing an inference involves irreducibly dynamic cognitive procedures. The article proposes that a non-associative information frame, corresponding to a residuated pogroupoid, underpins the information structure involved. The argument proceeds by expounding the informational turn in logic, before outlining the cognitive actions at work in deductive inference. The structural rules of Weakening, Contraction, Commutation, and Association are rejected on the grounds that they cause us to lose track of the information flow in inferential procedures. By taking the operation of information application (...) as the primary operation, the fusion connective is retained, with commutative failure generating a double implication. The other connectives are rejected. (shrink)

Logic, in one of the many sense of that term, is a theory about what follows from what and why. Arguably, the correct theory has to be determined by abduction. Over recent years, so called logical anti-exceptionalists have investigated this matter. Current discussions have been restricted to deductive logic. However, there are also, of course, various forms of non-deductive reasoning. Indeed, abduction itself is one of these. What is to be said about the way of choosing the best theory of (...) non-deductive inferences? It would seem clear that an anti-exceptionalist should hold that essentially the same method of choice should apply to non-deductive logic. A number of issues need to be faced in the process, not the least of which is the circularity involved in an abductive justification for a theory of abduction. This paper discusses matters. (shrink)

1.1 In standard modal logics, the worlds are 2-valued in the following sense: there are 2 values that a sentence may take at a world. Technically, however, there is no reason why this has to be the case. The worlds could be many-valued. This paper presents one simple approach to a major family of many-valued modal logics, together with an illustration of why this family is philosophically interesting.

How can different individuals' probability functions on a given sigma-algebra of events be aggregated into a collective probability function? Classic approaches to this problem often require 'event-wise independence': the collective probability for each event should depend only on the individuals' probabilities for that event. In practice, however, some events may be 'basic' and others 'derivative', so that it makes sense first to aggregate the probabilities for the former and then to let these constrain the probabilities for the latter. We formalize (...) this idea by introducing a 'premise-based' approach to probabilistic opinion pooling, and show that, under a variety of assumptions, it leads to linear or neutral opinion pooling on the 'premises'. This paper is the second of two self-contained, but technically related companion papers inspired by binary judgment-aggregation theory. (shrink)

The main rationale for adopting the epistemological approach to argumentation seems to take the form of a criticism of the consensus theory. This criticism says that some instances of clearly bad argumentation count as acceptable instances of argumentation on the consensus theory. Supposedly, the epistemological approach does not have this problem. I suggest that the kind of normativity argumentation theorists should be concerned with is the normativity associated with giving real-world advice on how to partake in a critical discussion. I (...) try to show that when we understand the normativity of argumentative standards in this way, the main criticism of the consensus theory falls short, and the epistemological approach does not really have the advantages over the consensus theory that it is purported to have. If I am right, then the main reason offered for adopting the epistemological approach fails, and we should stick with the consensus theory. (shrink)

Philip Pettit (2001) has suggested that there are parallels between his republican account of freedom and Amartya Sen's (1970) account of freedom as decisive preference. In this paper, I discuss these parallels from a social-choice-theoretic perspective. I sketch a formalization of republican freedom and argue that republican freedom is formally very similar to freedom as defined in Sen's “minimal liberalism” condition. In consequence, the republican account of freedom is vulnerable to a version of Sen's liberal paradox, an inconsistency between universal (...) domain, freedom, and the weak Pareto principle. I argue that some standard escape routes from the liberal paradox – those via domain restriction – are not easily available to the republican. I suggest that republicans need to take seriously the challenge of the impossibility of a Paretian republican. Footnotes1 I am grateful to Luc Bovens, Geoffrey Brennan, Keith Dowding, Philip Pettit, and Wlodek Rabinowicz for very helpful comments and discussion. (shrink)

. I give a systematic presentation of a fairly large family of multiple-conclusion modal logics that are paraconsistent and/or paracomplete. After providing motivation for studying such systems, I present semantics and tableau-style proof theories for them. The proof theories are shown to be sound and complete with respect to the semantics. I then show how the “standard” systems of classical, single-conclusion modal logics fit into the framework constructed.

The paper shows how we can add a truth predicate to arithmetic (or formalized syntactic theory), and keep the usual truth schema Tr( ) ↔ A (understood as the conjunction of Tr( ) → A and A → Tr( )). We also keep the full intersubstitutivity of Tr(>A>)) with A in all contexts, even inside of an →. Keeping these things requires a weakening of classical logic; I suggest a logic based on the strong Kleene truth tables, but with → (...) as an additional connective, and where the effect of classical logic is preserved in the arithmetic or formal syntax itself. Section 1 is an introduction to the problem and some of the difficulties that must be faced, in particular as to the logic of the →; Section 2 gives a construction of an arithmetically standard model of a truth theory; Section 3 investigates the logical laws that result from this; and Section 4 provides some philosophical commentary. (shrink)

What does it mean that some proposition follows from others? The standard way of spelling out the notion proceeds in modal terms: x follows from y iff necessarily, if y is true, so is x. But although this yields a useful and manageable account of consequence, it fails to capture certain aspects of our pre-theoretical understanding of consequence. In this paper, an alternative notion of logical consequence, based on the idea of grounding, is developed.

We here propose a solution to the problem we have raised. Basically, the mathematical notion of entailment seems to be connected to the inferential rules from Classical Logic, so that if we have P: x belongs to the reals, and Q: x+2=5 => x=3, P |= Q. Notwithstanding, we would also have that if P: x belongs to the interval (7,10), and Q: x+2=5 => x=3, P |= Q. The second instance of entailment does not seem to be justifiable if (...) our intuition is consulted: Even though we could say that absurdity implies anything in Classical Logic, entailment should be a concept that belongs to the metalogic, not to the logic of the system, so that we should not be inside of the Classical Logic World by the time we assess things in what regards entailment. As another point, our discussions in Entailment led us to choose the sense has as a consequence for entailment, so that it is not really acceptable that we have, as a consequence, using normal language, of x being inside of the real interval (7,10) that if x+2=5, then x=3. If x is in that interval, x+2 should not be 5, unless we are talking about moduli of vectors. However, when we transfer to Classical Logic, in having the antecedent false, and the consequent false as well, we have that the implication, which some call material, is true. We here discuss this sort of matter in detail, and hope to get to the bottom of the issue, and perhaps to a universal solution. (shrink)

The volume includes twenty-five research papers presented as gifts to John L. Bell to celebrate his 60th birthday by colleagues, former students, friends and admirers. Like Bell’s own work, the contributions cross boundaries into several inter-related fields. The contributions are new work by highly respected figures, several of whom are among the key figures in their fields. Some examples: in foundations of maths and logic ; analytical philosophy, philosophy of science, philosophy of mathematics and decision theory and foundations of economics. (...) Most articles are contributions to current philosophical debates, but contributions also include some new mathematical results, important historical surveys, and a translation by Wilfrid Hodges of a key work of arabic logic. (shrink)

Noneism a is form of Meinongianism, proposed by Richard Routley and developed and improved by Graham Priest in his widely discussed book Towards Non-Being. Priest's noneism is based upon the double move of building a worlds semantics including impossible worlds, besides possible ones, and admitting a new comprehension principle for objects, differerent from the ones proposed in other kinds of neo-Meinongian theories, such as Parsons' and Zalta's. The new principle has no restrictions on the sets of properties that can deliver (...) objects, but parameterizes the having of properties by objects to worlds. Modality is therefore explicitly built in - so the approach can be conveniently labeled as "modal noneism". In this paper, I put modal noneism to work by testing it against classical issues in modal logic and semantics. It turns out that - perhaps surprisingly - the theory performs well in problems of transworld identity, which are frequently considered to be the difficult ones in the literature; faces a limitation, albeit not a severe one, when one comes to transworld individuation, which is often taken as an easy issue, if not a pseudo-problem; and may stumble upon a real trouble when dealing with what I shall call 'extensionally indiscernible entities' - particular nonexistent objects modal noneism is committed to. (shrink)

The paper reviews a number of approaches for handling restricted quantification in relevant logic, and proposes a novel one. This proceeds by introducing a novel kind of enthymematic conditional.

In this paper, I will characterize a new class of inconsistency-adaptive logics, namely inconsistency-adaptive modal logics. These logics cope with inconsistencies in a modal context. More specifically, when faced with inconsistencies, inconsistency-adaptive modal logics avoid explosion, but still allow the derivation of sufficient consequences to adequately explicate the part of human reasoning they are intended for.

A discussion on this so debatable and debated concept, Higher Order Vagueness. After going through the issues that make Higher Order Vagueness an object of scientific attention, we conclude that vagueness is undesirable in logical systems but desirable in language, and the Semiotics Universe splits into three other universes inside of the universe of the Computer Science Systems. We create a new way of addressing problems with sigmatoids, and define vagueness in an almost mathematical fashion.

The paper argues that metaphysical thought, or thought in whose context our general framework of sense is under scrutiny, involves, legitimates, and requires a variety of informal analogues of the ‘true contradictions’ supported in some paraconsistent formal logics. These are what we can call informal ‘legitimate logical inadequacies’. These paradoxical logical structures also occur in deeply pluralist contexts, where more than one, conflicting general framework for sense is relevant. The paper argues further that these legitimate logical inadequacies are real or (...) inherent in sense itself rather than conventional, shows how they can feature in argumentative practice in these metaphysical and pluralist contexts, and discusses some of their implications for metaphysical truth and for philosophical inquiry and disagreement. (shrink)

I provide an interpretation of Wittgenstein's much criticized remarks on Gödel's First Incompleteness Theorem in the light of paraconsistent arithmetics: in taking Gödel's proof as a paradoxical derivation, Wittgenstein was right, given his deliberate rejection of the standard distinction between theory and metatheory. The reasoning behind the proof of the truth of the Gödel sentence is then performed within the formal system itself, which turns out to be inconsistent. I show that the models of paraconsistent arithmetics (obtained via the Meyer-Mortensen (...) collapsing filter on the standard model) match with many intuitions underlying Wittgensteins philosophy of mathematics, such as its strict finitism and the insistence on the decidability of any meaningful mathematical question. (shrink)

Jaina philosophy provides a very distinctive account of logic, based on the theory of ?sevenfold predication?. This paper provides a modern formalisation of the logic, using the techniques of many-valued and modal logic. The formalisation is applied, in turn, to some of the more problematic aspects of Jaina philosophy, especially its relativism.

There is a phenomenon that often arises when a philosophy argues that there are limits to thought/language, and tries to justify this view by giving reasons as to why there are things about which one cannot think/talk---in the process appearing to give the lie to the claim. I will be concerned with that phenomenon. We will look at some of philosophies that fall into this camp (those of Wittgenstein, Heidegger, and Mahayana Buddhism). We will then see that Buddhist philosophy has (...) resources to address this kind of issue not present in Western traditions, namely the catuskoti and its developments. The catuskoti is a principle to the effect that claims can be true, false, both, or neither. Later developments add a fifth possibility: ineffability. Of course, one might be skeptical that such ideas can be made logically respectable. I will show how to do so with some simple tools from contemporary non-classical logic. (shrink)

In this paper I present a range of substructural logics for a conditional connective ↦. This connective was original introduced semantically via restriction on the ternary accessibility relation R for a relevant conditional. I give sound and complete proof systems for a number of variations of this semantic definition. The completeness result in this paper proceeds by step-by-step improvements of models, rather than by the one-step canonical model method. This gradual technique allows for the additional control, lacking in the canonical (...) model method, that is required. (shrink)

This paper extends the defense of a simple theory of indicative conditionals previously proposed by the author, in which the truth conditions are material, and Grice-style assertability conditions are given to explain the paradoxes of material implication. The paper discusses various apparent counter-examples to the material account in which conditionals are not asserted, and so the original theory cannot be applied; it is argued that, nevertheless, the material theory can be defended.

World semantics for relevant logics include so-called non-normal or impossible worlds providing model-theoretic counterexamples to such irrelevant entailments as (A ∧ ¬A) → B, A → (B∨¬B), or A → (B → B). Some well-known views interpret non-normal worlds as information states. If so, they can plausibly model our ability of conceiving or representing logical impossibilities. The phenomenon is explored by combining a formal setting with philosophical discussion. I take Priest’s basic relevant logic N4 and extend it, on the syntactic (...) side, with a representation operator, (R), and on the semantic side, with particularly anarchic non-normal worlds. This combination easily invalidates unwelcome “logical omniscience” in- ferences of standard epistemic logic, such as belief-consistency and closure under entailment. Some open questions are then raised on the best strategies to regiment (R) in order to express more vertebrate kinds of conceivability. (shrink)

A vagueza é comumente representada pela adoção de significados imprecisos na linguagem natural. Ela é analisada como um caso limítrofe e formalizada de diversas maneiras pelas suas teorias “clássicas”. Este trabalho propõe uma abordagem diferente do tema através da adoção do conceito de Racionalidade Soft ( Soft Rationality ), elaborado por Marcelo Dascal, e da sua interpretação como o uso da “semelhança” ao invés da “análise” para a compreensão dos termos da linguagem natural. Aqui será feita a sugestão de que (...) a Racionalidade Soft (branda), enquanto teoria sobre a vagueza, permanece no domínio da ‘intensionalidade’ ao invés de buscar uma explicação formalizada e ‘extensional’ para o tema. DOI:10.5007/1808-1711.2011v15n2p349. (shrink)

This thesis is the attempt to find a logical model for, and trace the history of, the catuṣkoṭi as it developed in the Indo-Tibetan milieu and spread, via China, to Japan. After an introduction to the history and key-concepts of Buddhist philosophy, I will finish the first chapter with some methodological considerations about the general viability of comparative philosophy. Chapter §2 is devoted to a logical analysis of the catuṣkoṭi. Several attempts to model this fascinating piece of Buddhist philosophy with (...) the tools of classical logic shall be debunked. A paraconsistent alternative will be discussed but eventually dismissed. As a rejoinder, I shall propose a model for the catuṣkoṭi with the help of speech-acts. The remainder of this chapter will look at Chinese and Japanese forms of the catuṣkoṭi which I shall model in a quasi-recursive system. The third and final chapter will look at the Kyoto School's soku-hi dialectics which ties together the different threads of this essay. I will criticise an established, classical model of the soku-hi dialectics and offer an alternative with a second-order paraconsistent semantics. (shrink)

The paper tries to demonstrate the validity of Aristotle’s sea-battle argument, which is still considered as invalid by many authors. The first part presents the usual reconstruction of Aristotle’s argument and the reason for its rejection. It presents the late antique adoption of the argument as valid and strong by Ammonios and Boethius as well as its modern defence. In the second part, the elements that together assure the validity of the argument are combined and cast in the form of (...) two premisses, namely fact-correspondence and the unchangeability of facts. It is shown that these two presuppositions together assure the conclusion, i. e. the negation of bivalence for future contingents, and that they are explicitly stated in several of Aristotle’s texts and in Peri Hermeneias 9 in particular. (shrink)

Change is endemic in nature yet scientists seek stability amidst change. When proposals fail scientists shift their focus and look for stability elsewhere. Scholars who study the development of science also seek stability in the scientific process. Here I explore the interaction between stability and change in nature as we understand it through the sciences and in the practice of scientific research. The concluding part argues that the search for stability meets a human intellectual need but this is compatible with (...) our finding what is actually there. Cases in which a previously accepted part of science is rejected or revised in response to contrary data indicates that we do not predetermine outcomes of observations and experiments. Still, the belief that there are loci of stability in nature is a working hypothesis. While it has been fruitful, only future scientific developments can determine if this will continue to hold. (shrink)

The aim of this text is show how Borges, in his story Tigres azules, develops several interesting ideas about logic, language and mathematics. The starting point is Borgesian skepticism about the ability of classical logic to take the problem of truth and impossible worlds. It is defended that inconsistent and even self-contradictory objects do not necessarily give rise to physically or logically impossible worlds. It is suggested that the paradoxes that Borges constructs in the story are not paradoxes of self-reference, (...) but variants of Moore’s paradox and paradoxes of material implication, so to overcome them requires a non-classical approach that neutralizes ECQ, this is, a paraconsistent logic system. (shrink)

This note explains an error in Restall’s ‘Simplified Semantics for Relevant Logics (and some of their rivals)’ (Restall, J Philos Logic 22(5):481–511, 1993 ) concerning the modelling conditions for the axioms of assertion A → (( A → B ) → B ) (there called c 6) and permutation ( A → ( B → C )) → ( B → ( A → C )) (there called c 7). We show that the modelling conditions for assertion and permutation proposed (...) in ‘Simplified Semantics’ overgenerate. In fact, they overgenerate so badly that the proposed semantics for the relevant logic R validate the rule of disjunctive syllogism. The semantics provides for no models of R in which the “base point” is inconsistent. This problem is not restricted to ‘Simplified Semantics.’ The techniques of that paper are used in Graham Priest’s textbook An Introduction to Non-Classical Logic (Priest, 2001 ), which is in wide circulation: it is important to find a solution. In this article, we explain this result, diagnose the mistake in ‘Simplified Semantics’ and propose two different corrections. (shrink)

Towards NonBeing (Priest, 2005) gives a noneist account of the semantics of intentional operators and predicates. The semantics for intentional operators are modelled on those for the , is given and assessed.

This paper aims to distinguish and classify sixteen versions of the Necker cube. In particular, it is shown how to describe inconsistent and incomplete theories which correspond in a systematic way to these sixteen diagrams. Concerning two of these sixteen cubes, there is a natural intuition that there is a sense in which they inconsistent. It is seen that this intuition is vindicated by an analysis in which their corresponding theories turn out to be globally inconsistent but not locally inconsistent, (...) while various other cubes of the sixteen are merely locally inconsistent. The Routley functor is seen to be useful in classifying the relations between these diagrams. (shrink)