This paper proposes a reformulation of the treatment of boundaries, at parts and aggregates of entities in Basic Formal Ontology. These are currently treated as mutually exclusive, which is inadequate for biological representation since some entities may simultaneously be at parts, boundaries and/or aggregates. We introduce functions which map entities to their boundaries, at parts or aggregations. We make use of time, space and spacetime projection functions which, along the way, allow us to develop a simple temporal theory.

This is an attempt to axiomatise the natural laws. Note especially axiom 4, which is expressed in third order predicate logic, and which permits a solution to the problem of causation in nature without stating that “everything has a cause”. The undefined term “difference” constitutes the basic element and each difference is postulated to have an exact position and to have a discrete cause. The set of causes belonging to a natural set of dimensions is defined as a law. This (...) means that a natural law is determined by the discrete causes tied to a natural set of dimensions. A law is defined as “defined” in a point if a difference there has a cause. Given that there is a point for which the law is not defined it is shown that a difference is caused that connects two points in two separate sets of dimensions. (shrink)

We study the first-order theories of some natural and important classes of coloured trees, including the four classes of trees whose paths have the order type respectively of the natural numbers, the integers, the rationals, and the reals. We develop a technique for approximating a tree as a suitably coloured linear order. We then present the first-order theories of certain classes of coloured linear orders and use them, along with the approximating technique, to establish complete axiomatisations of the four classes (...) of trees mentioned above. (shrink)

In a lot of domains in metaphysics the tacit assumption has been that whichever metaphysical principles turn out to be true, these will be necessarily true. Let us call necessitarianism about some domain the thesis that the right metaphysics of that domain is necessary. Necessitarianism has flourished. In the philosophy of maths we find it held that if mathematical objects exist, then they do of necessity. Mathematical Platonists affirm the necessary existence of mathematical objects (see for instance Hale and Wright (...) 1992 and 1994; Wright 1983 and 1988; Schiffer 1996; Resnik 1997; Shapiro 1997 and Zalta 1988) while mathematical nominalists, usually in the form of fictionalists, hold that necessarily such objects fail to exist (see for instance Balaguer 1996 and 1998; Rosen 2001 and Yablo 2005). In metaphysics more generally, until recently it was more or less assumed that whatever the right account of composition—the account of under what conditions some xs compose a y—that account will be necessarily true (for a discussion of theories of composition see Simons 1987 and van Inwagen 1987 and 1990; the modal status of the composition relation is explicitly addressed in Schaffer 2007; Parsons 2006 and Cameron 2007). Similarly, it has generally been assumed that whatever the right account is of the nature of properties, whether they be universals, tropes, or whether nominalism is true, that account will be necessarily true (though see Rosen 2006 for a recent suggestion to the contrary). In considering theories of persistence it has been widely held that whether objects endure or perdure through time is a matter of necessity (Sider 2001; though see Lewis 1999 p227 who defends contingent perdurantism). And with respect to theories of time it is frequently held that whichever of the A- or B-theory is true is necessarily true. A-theorists often argue that there is time in a world only if the A-theory is true at that world (see for instance McTaggart 1903; Markosian 2004; Bigelow 1996; Craig 2001) while B-theorists often argue that the A-theory is internally inconsistent (Smart 1987; Mellor 1998; Savitt 2000 and Le Poidevin 1991). Once again, we find a few recent contingentist dissenters. Bourne (2006) suggests that it is a contingent feature of time that it is tensed, and thus that the A-theory is contingently true. Worlds in which there exist only B-theoretic properties are worlds with time, it is just that time in those worlds time is radically different to the way it is actually. Other defenders of the B-theory, though not expressly contingentists, do offer arguments against versions of the A-theory that try to show that such A-theories theories are inconsistent with the actual laws of nature (see for instance Saunders 2002 and Callender 2000); these arguments, at least, leave room for the possibility that the A-theories in question are contingently false (at least on the assumption that the laws of nature are themselves contingent, an assumption that not everyone accepts). Despite some notable exceptions, necessitarianism has flourished in many, if not most, domains in metaphysics. One such exception is Lewis’ famous defence of Humean supervenience as a contingent claim about our world. Lewis does not argue that necessarily, the supervenience base for all matters of fact in a world is nothing but a vast mosaic of local matters of particular fact. Rather, he thinks that we have reason to think that our world is one in which Humean supervenience holds (see Lewis 1986 p9-10 and 1994). Another exception to the necessitarian orthodoxy is to be found in the lively debate about the modal status of the laws of nature. Here, if anything, contingentism has been the dominating force, with it generally being held that there are possible worlds in which different laws of nature hold (this view is defended by, among others, Lewis 1986 and 2010; Schaffer 2005 and Sidelle 2002). Necessitarian dissenters hold that the laws of nature are necessary, frequently because they think it is necessary that fundamental properties have the causal or nomic profiles they do (see for instance Shoemaker 1980 and 1988; Swoyer 1982; Bird 1995; Ellis and Lierse 1994). Nevertheless, when it comes to thinking about the nature of the laws themselves, the necessitarian presumption is back on firm footing. Though there is disagreement about whether the laws are generalisations that feature in the most virtuous true axiomatisation of all the particular matters of fact (often known as the Humean view of laws and defended by Ramsey 1978; Lewis 1986 and Beebee 2000) or whether laws are relations of necessity that hold between universals (a view defended by Armstrong 1983; Dretske 1977; Tooley 1977 and Carroll 1990) no one has seriously suggested that it might be a contingent matter which of these is the right account of laws. The necessitarian orthodoxy is not surprising since metaphysics is largely an a priori process. While a priori reasoning may be used to determine whether a proposition is necessary or contingent, it is not well placed (in the absence of a posteriori evidence) to determine whether a contingent proposition is actually true or false. Since metaphysicians aim to tell us which principles are true in which worlds, on the face of it the discovery that metaphysical principles are contingent seems to make part of the task of metaphysics epistemically intractable. In what follows I consider two reasons one might end up embracing contingentism and whether this would lead one into epistemic difficulty. The following section considers a route to contingent metaphysical truths that proceeds via a combination of conceptual necessities and empirical discoveries. Section 3 considers whether there might be synthetic contingent metaphysical truths, and the final section raises the question of whether if there were such truths we would be well placed to come to know them. (shrink)

We investigate a recently devised polyhedral semantics for intermediate logics, in which formulas are interpreted in n-dimensional polyhedra. An intermediate logic is polyhedrally complete if it is complete with respect to some class of polyhedra. The first main result of this paper is a necessary and sufficient condition for the polyhedral completeness of a logic. This condition, which we call the Nerve Criterion, is expressed in terms of Alexandrov’s notion of the nerve of a poset. It affords a purely combinatorial (...) characterisation of polyhedrally complete logics. Using the Nerve Criterion we show, easily, that there are continuum many intermediate logics that are not polyhedrally complete but which have the finite model property. We also provide, at considerable combinatorial labour, a countably infinite class of logics axiomatised by the Jankov–Fine formulas of ‘starlike trees’ all of which are polyhedrally complete. The polyhedral completeness theorem for these ‘starlike logics’ is the second main result of this paper. (shrink)

A detailed axiomatisation of diagrams (in affine geometry) is presented, which supports typing of geometric objects, calculation of geometric quantities and automated proof of theorems.

In their paper Nothing but the Truth Andreas Pietz and Umberto Rivieccio present Exactly True Logic, an interesting variation upon the four-valued logic for first-degree entailment FDE that was given by Belnap and Dunn in the 1970s. Pietz & Rivieccio provide this logic with a Hilbert-style axiomatisation and write that finding a nice sequent calculus for the logic will presumably not be easy. But a sequent calculus can be given and in this paper we will show that a calculus (...) for the Belnap-Dunn logic we have defined earlier can in fact be reused for the purpose of characterising ETL, provided a small alteration is made—initial assignments of signs to the sentences of a sequent to be proved must be different from those used for characterising FDE. While Pietz & Rivieccio define ETL on the language of classical propositional logic we also study its consequence relation on an extension of this language that is functionally complete for the underlying four truth values. On this extension the calculus gets a multiple-tree character—two proof trees may be needed to establish one proof. (shrink)

Quasi-Nelson logic (QNL) was recently introduced as a common generalisation of intuitionistic logic and Nelson's constructive logic with strong negation. Viewed as a substructural logic, QNL is the axiomatic extension of the Full Lambek Calculus with Exchange and Weakening by the Nelson axiom, and its algebraic counterpart is a variety of residuated lattices called quasi-Nelson algebras. Nelson's logic, in turn, may be obtained as the axiomatic extension of QNL by the double negation (or involutivity) axiom, and intuitionistic logic as the (...) extension of QNL by the contraction axiom. A recent series of papers by the author and collaborators initiated the study of fragments of QNL, which correspond to subreducts of quasi-Nelson algebras. In the present paper we focus on fragments that contain the connectives forming a residuated pair (the monoid conjunction and the so-called strong Nelson implication), these being the most interesting ones from a substructural logic perspective. We provide quasi-equational (whenever possible, equational) axiomatisations for the corresponding classes of algebras, obtain twist representations for them, study their congruence properties and take a look at a few notable subvarieties. Our results specialise to the involutive case, yielding characterisations of the corresponding fragments of Nelson's logic and their algebraic counterparts. (shrink)

We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new logics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite logical (...) matrix. We show that the last logic of the chain is not finitely axiomatisable. (shrink)

Informal rigour is the process by which we come to understand particular mathematical structures and then manifest this rigour through axiomatisations. Structural relativity is the idea that the kinds of structures we isolate are dependent upon the logic we employ. We bring together these ideas by considering the level of informal rigour exhibited by our set-theoretic discourse, and argue that different foundational programmes should countenance different underlying logics (intermediate between first- and second-order) for formulating set theory. By bringing considerations of (...) perturbations in modal space to bear on the debate, we will suggest that a promising option for representing current set-theoretic thought is given by formulating set theory using quasi-weak second-order logic. These observations indicate that the usual division of structures into \particular (e.g. the natural number structure) and general (e.g. the group structure) is perhaps too coarse grained; we should also make a distinction between intentionally and unintentionally general structures. (shrink)

Possible worlds models of belief have difficulties accounting for unawareness, the inability to entertain (and hence believe) certain propositions. Accommodating unawareness is important for adequately modelling epistemic states, and representing the informational content to which agents have in principle access given their explicit beliefs. In this paper, I develop a model of explicit belief, awareness, and informational content, along with an sound and complete axiomatisation. I furthermore defend the model against the seminal impossibility result of Dekel, Lipman and Rustichini, (...) according to which three intuitive conditions preclude non-trivial unawareness on any possible worlds model of belief. (shrink)

The topic of this thesis is axiological uncertainty – the question of how you should evaluate your options if you are uncertain about which axiology is true. As an answer, I defend Expected Value Maximisation (EVM), the view that one option is better than another if and only if it has the greater expected value across axiologies. More precisely, I explore the axiomatic foundations of this view. I employ results from state-dependent utility theory, extend them in various ways and interpret (...) them accordingly, and thus provide axiomatisations of EVM as a theory of axiological uncertainty. (shrink)

Reichenbach’s early solution to the scientific problem of how abstract mathematical representations can successfully express real phenomena is rooted in his view of coordination. In this paper, I claim that a Reichenbach-inspired, ‘layered’ view of coordination provides us with an effective tool to systematically analyse some epistemic and conceptual intricacies resulting from a widespread theorising strategy in evolutionary biology, recently discussed by Okasha (2018) as ‘endogenization’. First, I argue that endogenization is a form of extension of natural selection theory that (...) comprises three stages: quasi-axiomatisation, functional extension, and semantic extension. Then, I argue that the functional extension of one core principle of natural selection theory, namely, the principle of heritability, requires the semantic extension of the concept of inheritance. This is because the semantic extension of ‘inheritance’ is necessary to establish a novel form of coordination between the principle of heritability and the extended domain of phenomena that it is supposed to represent. Finally, I suggest that – despite the current lack of consensus on the right semantic extension of ‘inheritance’ – we can fruitfully understand the reconceptualization of ‘inheritance’ provided by niche construction theorists as the result of a novel form of coordination. (shrink)

In this paper we give an analytic tableau calculus P L 1 6 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t, ⊧ f, ⊧ i, and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first three entailment (...) relations will in general require developing four tableaux, while proving that they are in the ⊧ relation may require six. (shrink)

There is a long tradition of logic, from Aristotle to Gödel, of understanding a proof from the concepts of necessity and causality. Gödel's attempts to define provability in terms of necessity led him to the distinction of formal and absolute (abstract) provability. Turing's definition of mechanical procedure by means of a Turing machine (TM) and Gödel's definition of a formal system as a mechanical procedure for producing formulas prompt us to understand formal provability as a mechanical causality. We propose a (...) formalism which makes explicit the mechanical causal nature of a TM's work. We claim that Gödel's axiomatised ontotheology and his ontological proof give a clue for the understanding of the concept of absolute provability and the pattern of the corresponding absolute completeness proof, respectively. (shrink)

This paper calls for a re-appraisal of McGee's analysis of the semantics, logic and probabilities of indicative conditionals presented in his 1989 paper Conditional probabilities and compounds of conditionals. The probabilistic measures introduced by McGee are given a new axiomatisation built on the principle that the antecedent of a conditional is probabilistically independent of the conditional and a more transparent method of constructing such measures is provided. McGee's Dutch book argument is restructured to more clearly reveal that it introduces (...) a novel contribution to the epistemology of semantic indeterminacy, and shows that its more controversial implications are unavoidable if we want to maintain the Ramsey Test along with the standard laws of probability. Importantly, it is shown that the counterexamples that have been levelled at McGee's analysis|generating a rather wide consensus that it yields `unintuitive' or `wrong' probabilities for compounds |fail to strike at their intended target; for to honour the intuitions of the counterexamples one must either give up the Ramsey Test or the standard laws of probability. It will be argued that we need to give up neither if we take the counterexamples as further evidence that the indicative conditional sometimes allows for a non-epistemic `causal' interpretation alongside its usual epistemic interpretation. (shrink)

This article presents modal versions of resource-conscious logics. We concentrate on extensions of variants of linear logic with one minimal non-normal modality. In earlier work, where we investigated agency in multi-agent systems, we have shown that the results scale up to logics with multiple non-minimal modalities. Here, we start with the language of propositional intuitionistic linear logic without the additive disjunction, to which we add a modality. We provide an interpretation of this language on a class of Kripke resource models (...) extended with a neighbourhood function: modal Kripke resource models. We propose a Hilbert-style axiomatisation and a Gentzen-style sequent calculus. We show that the proof theories are sound and complete with respect to the class of modal Kripke resource models. We show that the sequent calculus admits cut elimination and that proof-search is in PSPACE. We then show how to extend the results when non-commutative connectives are added to the language. Finally, we put the l.. (shrink)

John von Neumann's proof that quantum mechanics is logically incompatible with hidden varibales has been the object of extensive study both by physicists and by historians. The latter have concentrated mainly on the way the proof was interpreted, accepted and rejected between 1932, when it was published, and 1966, when J.S. Bell published the first explicit identification of the mistake it involved. What is proposed in this paper is an investigation into the origins of the proof rather than the aftermath. (...) In the first section, a brief overview of the his personal life and his proof is given to set the scene. There follows a discussion on the merits of using here the historical method employed elsewhere by Andrew Warwick. It will be argued that a study of the origins of von Neumann's proof shows how there is an interaction between the following factors: the broad issues within a specific culture, the learning process of the theoretical physicist concerned, and the conceptual techniques available. In our case, the ‘conceptual technology’ employed by von Neumann is identified as the method of axiomatisation. (shrink)

The paper re-expresses arguments against the normative validity of expected utility theory in Robin Pope (1983, 1991a, 1991b, 1985, 1995, 2000, 2001, 2005, 2006, 2007). These concern the neglect of the evolving stages of knowledge ahead (stages of what the future will bring). Such evolution is fundamental to an experience of risk, yet not consistently incorporated even in axiomatised temporal versions of expected utility. Its neglect entails a disregard of emotional and financial effects on well-being before a particular risk is (...) resolved. These arguments are complemented with an analysis of the essential uniqueness property in the context of temporal and atemporal expected utility theory and a proof of the absence of a limit property natural in an axiomatised approach to temporal expected utility theory. Problems of the time structure of risk are investigated in a simple temporal framework restricted to a subclass of temporal lotteries in the sense of David Kreps and Evan Porteus (1978). This subclass is narrow but wide enough to discuss basic issues. It will be shown that there are serious objections against the modification of expected utility theory axiomatised by Kreps and Porteus (1978, 1979). By contrast the umbrella theory proffered by Pope that she has now termed SKAT, the Stages of Knowledge Ahead Theory, offers an epistemically consistent framework within which to construct particular models to deal with particular decision situations. A model by Caplin and Leahy (2001) will also be discussed and contrasted with the modelling within SKAT (Pope, Leopold and Leitner 2007). (shrink)

In the paper we examine the method of axiomatic rejection used to describe the set of nonvalid formulae of Aristotle's syllogistic. First we show that the condition which the system of syllogistic has to fulfil to be ompletely axiomatised, is identical to the condition for any first order theory to be used as a logic program. Than we study the connection between models used or refutation in a first order theory and rejected axioms for that theory. We show that any (...) formula of syllogistic enriched with classical connectives is decidable using models in the domain with three members. (shrink)

We study the representation of sets of desirable gambles by sets of probability mass functions. Sets of desirable gambles are a very general uncertainty model, that may be non-Archimedean, and therefore not representable by a set of probability mass functions. Recently, Cozman (2018) has shown that imposing the additional requirement of even convexity on sets of desirable gambles guarantees that they are representable by a set of probability mass functions. Already more that 20 years earlier, Seidenfeld et al. (1995) gave (...) an axiomatisation of binary preferences—on horse lotteries, rather than on gambles—that also leads to a unique representation in terms of sets of probability mass functions. To reach this goal, they use two devices, which we will call ‘SSK–Archimedeanity’ and ‘SSK–extension’. In this paper, we will make the arguments of Seidenfeld et al. (1995) explicit in the language of gambles, and show how their ideas imply even convexity and allow for conservative reasoning with evenly convex sets of desirable gambles, by deriving an equivalence between the SSK–Archimedean natural extension, the SSK–extension, and the evenly convex natural extension. (shrink)

We look at extensions (i.e., stronger logics in the same language) of the Belnap–Dunn four-valued logic. We prove the existence of a countable chain of logics that extend the Belnap–Dunn and do not coincide with any of the known extensions (Kleene’s logics, Priest’s logic of paradox). We characterise the reduced algebraic models of these new log- ics and prove a completeness result for the first and last element of the chain stating that both logics are determined by a single finite (...) logical matrix. We show that the last logic of the chain is not finitely axiomatisable. (shrink)

A collection of papers presented at the First International Summer Institute in Cognitive Science, University at Buffalo, July 1994, including the following papers: ** Topological Foundations of Cognitive Science, Barry Smith ** The Bounds of Axiomatisation, Graham White ** Rethinking Boundaries, Wojciech Zelaniec ** Sheaf Mereology and Space Cognition, Jean Petitot ** A Mereotopological Definition of 'Point', Carola Eschenbach ** Discreteness, Finiteness, and the Structure of Topological Spaces, Christopher Habel ** Mass Reference and the Geometry of Solids, Almerindo E. (...) Ojeda ** Defining a 'Doughnut' Made Difficult, N .M. Gotts ** A Theory of Spatial Regions with Indeterminate Boundaries, A.G. Cohn and N.M. Gotts ** Mereotopological Construction of Time from Events, Fabio Pianesi and Achille C. Varzi ** Computational Mereology: A Study of Part-of Relations for Multi-media Indexing, Wlodek Zadrozny and Michelle Kim. (shrink)