In The Chances of Explanation, Paul Humphreys presents a metaphysical analysis of causation. In this paper, I argue that this analysis is flawed. Humphreys' model of Causality incorporates three completeness requirements. I show that these completeness requirements, when applied in the world, force us to take causally irrelevant factors to be causally relevant. On this basis, I argue that Humphreys' analysis should be rejected.

It is a celebrated result of McKinsey and Tarski [28] thatS4is the logic of the closure algebraΧ+over any dense-in-itself separable metrizable space. In particular,S4is the logic of the closure algebra over the realsR, the rationalsQ, or the Cantor spaceC. By [5], each logic aboveS4that has the finite model property is the logic of a subalgebra ofQ+, as well as the logic of a subalgebra ofC+. This is no longer true forR, and the main result of [5] states that each connected (...) logic aboveS4with the finite model property is the logic of a subalgebra of the closure algebraR+.In this paper we extend these results to all logics aboveS4. Namely, for a normal modal logicL, we prove that the following conditions are equivalent: (i)Lis aboveS4, (ii)Lis the logic of a subalgebra ofQ+, (iii)Lis the logic of a subalgebra ofC+. We introduce the concept of a well-connected logic aboveS4and prove that the following conditions are equivalent: (i)Lis a well-connected logic, (ii)Lis the logic of a subalgebra of the closure algebra$\xi _2^ + $over the infinite binary tree, (iii)Lis the logic of a subalgebra of the closure algebra${\bf{L}}_2^ + $over the infinite binary tree with limits equipped with the Scott topology. Finally, we prove that a logicLaboveS4is connected iffLis the logic of a subalgebra ofR+, and transfer our results to the setting of intermediate logics.Proving these general completeness results requires new tools. We introduce the countable general frame property (CGFP) and prove that each normal modal logic has the CGFP. We introduce general topological semantics forS4, which generalizes topological semantics the same way general frame semantics generalizes Kripke semantics. We prove that the categories of descriptive frames forS4and descriptive spaces are isomorphic. It follows that every logic aboveS4is complete with respect to the corresponding class of descriptive spaces. We provide several ways of realizing the infinite binary tree with limits, and prove that when equipped with the Scott topology, it is an interior image of bothCandR. Finally, we introduce gluing of general spaces and prove that the space obtained by appropriate gluing involving certain quotients ofL2is an interior image ofR. (shrink)

Amodal completion is the representation of occluded parts of perceived objects. We argue for the following three claims: First, at least some amodal completion-involved experiences can ground knowledge about the occluded portions of perceived objects. Second, at least some instances of amodal completion-grounded knowledge are not sensitive, that is, it is not the case that in the nearest worlds in which the relevant claim is false, that claim is not believed true. Third, at least some instances of amodal completion-grounded knowledge (...) are not safe, that is, it is not the case that in all or nearly all near worlds where the relevant claim is believed true, that claim is in fact true. Thus, certain instances of amodal completion-grounded knowledge refute both the view that knowledge is necessarily sensitive and the view that knowledge is necessarily safe. (shrink)

This is Daoist philosophy’s central tenet, espoused by the person—or group of people—known as Zhuangzi (369?-286? B.C.E.) in a text by the same name.

This is one of the most justly celebrated texts of the Chinese tradition - impressive for both its bold philosophical imagination and its striking literary style. Accepting the challenge of translating this captivating classic in its entirety, Burton Watson has expertly rendered into English both the profound thought and the literary brilliance of the text.

Amodal completion is usually characterized as the representation of those parts of the perceived object that we get no sensory stimulation from. In the case of the visual sense modality, for example, amodal completion is the representation of occluded parts of objects we see. I argue that relationalism about perception, the view that perceptual experience is constituted by the relation to the perceived object, cannot give a coherent account of amodal completion. The relationalist has two options: construe the perceptual relation (...) as the relation to the entire perceived object or as the relation to the unoccluded parts of the perceived object. I argue that neither of these options are viable. (shrink)

The Oxford Translation of Aristotle was originally published in 12 volumes between 1912 and 1954. It is universally recognized as the standard English version of Aristotle. This revised edition contains the substance of the original Translation, slightly emended in light of recent scholarship three of the original versions have been replaced by new translations and a new and enlarged selection of Fragments has been added. The aim of the translation remains the same: to make the surviving works of Aristotle readily (...) accessible to English speaking readers. (shrink)

Outstanding translations by leading contemporary scholars--many commissioned especially for this volume--are presented here in the first single edition to include the entire surviving corpus of works attributed to Plato in antiquity. In his introductory essay, John Cooper explains the presentation of these works, discusses questions concerning the chronology of their composition, comments on the dialogue form in which Plato wrote, and offers guidance on approaching the reading and study of Plato's works. Also included are concise introductions by Cooper and Hutchinson (...) to each translation, meticulous annotation designed to serve both scholar and general reader, and a comprehensive index. This handsome volume offers fine paper and a high-quality Smyth-sewn cloth binding in a sturdy, elegant edition. (shrink)

The type of completeness Whitehead and Russell aimed for in their Principia Mathematica was what I call descriptive completeness. This is completeness with respect to the propositions that have been proved in traditional mathematics. The notion of completeness addressed by Gödel in his famous work of 1930 and 1931 was completeness with respect to the truths expressible in a given language. What are the relative significances of these different conceptions of completeness for traditional mathematics? (...) What, if any, effects does incompleteness of the type Gödel had in mind have for the evaluation of the Principia Mathematica project and other projects like it? (shrink)

A new characterization of tabularity in tense logic is established, namely, a tense logic L is tabular if and only if $\mathsf {tab}_n^T\in L$ for some $n\geq 1$. Two characterization theorems for the Post-completeness in tabular tense logics are given. Furthermore, a characterization of the Post-completeness in the lattice of all tense logics is established. Post numbers of some tense logics are shown.

Structural completeness properties are investigated for a range of popular t-norm based fuzzy logics—including Łukasiewicz Logic, Gödel Logic, Product Logic, and Hájek's Basic Logic—and their fragments. General methods are defined and used to establish these properties or exhibit their failure, solving a number of open problems.

Classic, influential study of Greek tragedy.

Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...) solution for the so-called NP-complete problems will also be a solution for any other such problems. Its artificial-intelligence analogue is the class of AI-complete problems, for which a complete mathematical formalization still does not exist. In this chapter we will focus on analysing computational classes to better understand possible formalizations of AI-complete problems, and to see whether a universal algorithm, such as a Turing test, could exist for all AI-complete problems. In order to better observe how modern computer science tries to deal with computational complexity issues, we present several different deep-learning strategies involving optimization methods to see that the inability to exactly solve a problem from a higher order computational class does not mean there is not a satisfactory solution using state-of-the-art machine-learning techniques. Such methods are compared to philosophical issues and psychological research regarding human abilities of solving analogous NP-complete problems, to fortify the claim that we do not need to have an exact and correct way of solving AI-complete problems to nevertheless possibly achieve the notion of strong AI. (shrink)

The claim defended in the paper is that the mechanistic account of explanation can easily embrace idealization in big-scale brain simulations, and that only causally relevant detail should be present in explanatory models. The claim is illustrated with two methodologically different models: Blue Brain, used for particular simulations of the cortical column in hybrid models, and Eliasmith’s SPAUN model that is both biologically realistic and able to explain eight different tasks. By drawing on the mechanistic theory of computational explanation, I (...) argue that large-scale simulations require that the explanandum phenomenon is identified; otherwise, the explanatory value of such explanations is difficult to establish, and testing the model empirically by comparing its behavior with the explanandum remains practically impossible. The completeness of the explanation, and hence of the explanatory value of the explanatory model, is to be assessed vis-à-vis the explanandum phenomenon, which is not to be conflated with raw observational data and may be idealized. I argue that idealizations, which include building models of a single phenomenon displayed by multi-functional mechanisms, lumping together multiple factors in a single causal variable, simplifying the causal structure of the mechanisms, and multi-model integration, are indispensable for complex systems such as brains; otherwise, the model may be as complex as the explanandum phenomenon, which would make it prone to so-called Bonini paradox. I conclude by enumerating dimensions of empirical validation of explanatory models according to new mechanism, which are given in a form of a “checklist” for a modeler. (shrink)

This paper attempts an historical analysis of a dream of the physicist George Gamow recorded shortly before his death in 1968. The dream is contextualized through Gamow's extended scientific work and popular scientific efforts, and in light of enduring preoccupations with the notion of a complete science. The analysis extends to an examination of the relationship of the dream to dreaming practices and deliberations apart from Gamow’s, as evident in the relationship and collaboration between the physicist Wolfgang Pauli and C. (...) G. Jung. (shrink)

We systematically study the completion of choice problems in the Weihrauch lattice. Choice problems play a pivotal rôle in Weihrauch complexity. For one, they can be used as landmarks that characterize important equivalences classes in the Weihrauch lattice. On the other hand, choice problems also characterize several natural classes of computable problems, such as finite mind change computable problems, non-deterministically computable problems, Las Vegas computable problems and effectively Borel measurable functions. The closure operator of completion generates the concept of total (...) Weihrauch reducibility, which is a variant of Weihrauch reducibility with total realizers. Logically speaking, the completion of a problem is a version of the problem that is independent of its premise. Hence, studying the completion of choice problems allows us to study simultaneously choice problems in the total Weihrauch lattice, as well as the question which choice problems can be made independent of their premises in the usual Weihrauch lattice. The outcome shows that many important choice problems that are related to compact spaces are complete, whereas choice problems for unbounded spaces or closed sets of positive measure are typically not complete. (shrink)

Investigation of a puzzle concerning complete yet authorless artworks.

One of the most important Stoic philosophers is Epictetus. Epictetus (c. 50 - 135 CE) was a Greek enslaved person who established an important school of Stoic philosophy in Rome. Epictetus is appreciated for his clear, good-humored way of explaining difficult ideas and his focus on daily life rather than metaphysics. This may be because he did not write down his lectures and discourses, as Marcus and Seneca did-rather, he delivered them aloud and they were carefully recorded by his students. (...) Thus we should not refer to them as "writings" but as "works." The complete oeuvre consists of his popular handbook on virtue (enchiridion), also known as "The Art of Living," a set of discourses, and a number of fragments. This set of translations, framed by an introduction and notes, is geared expressly to general readers and students, though it will be enormously helpful to scholars as well. (shrink)

Response to Gover (2015) on Trogdon and Livingston (2015) on artwork completion.

In previous articles, it has been shown that the deductive system developed by Aristotle in his "second logic" is a natural deduction system and not an axiomatic system as previously had been thought. It was also stated that Aristotle's logic is self-sufficient in two senses: First, that it presupposed no other logical concepts, not even those of propositional logic; second, that it is (strongly) complete in the sense that every valid argument expressible in the language of the system is deducible (...) by means of a formal deduction in the system. Review of the system makes the first point obvious. The purpose of the present article is to prove the second. Strong completeness is demonstrated for the Aristotelian system. (shrink)

This paper is the first in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic (...) semantics so as to shed new light on the relevant strengths and limits of higher-order logic. (shrink)

This paper is the first in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic (...) semantics so as to shed new light on the relevant strengths and limits of higher-order logic. (shrink)

Halldén completeness closely resembles the relevance property. To prove Halldén completeness in terms of Kripke-style semantics, the van Benthem–Humberstone theorem is often used. In relevant modal logics, the Halldén completeness of Meyer–Fuhrmann logics has been obtained using the van Benthem–Humberstone theorem. However, there remain a number of Halldén-incomplete relevant modal logics. This paper discusses the Halldén completeness of a wider class of relevant modal logics, namely, those with some Sahlqvist axioms.

Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to have a model completion, extending a characterization provided by Wheeler. For varieties of algebras that have equationally definable principal congruences and the compact intersection property, these conditions yield a more elegant characterization obtained (in a slightly more restricted setting) by Ghilardi and Zawadowski. Moreover, it is shown that under certain further assumptions on congruence lattices, the existence of a model completion implies (...) that the variety has equationally definable principal congruences. This result is then used to provide necessary and sufficient conditions for the existence of a model completion for theories of Hamiltonian varieties of pointed residuated lattices, a broad family of varieties that includes lattice-ordered abelian groups and MV-algebras. Notably, if the theory of a Hamiltonian variety of pointed residuated lattices has a model completion, it must have equationally definable principal congruences. In particular, the theories of lattice-ordered abelian groups and MV-algebras do not have a model completion, as first proved by Glass and Pierce, and Lacava, respectively. Finally, it is shown that certain varieties of pointed residuated lattices generated by their linearly ordered members, including lattice-ordered abelian groups and MV-algebras, can be extended with a binary operation to obtain theories that do have a model completion. (shrink)

We have synthesized a 582,970-base pair Mycoplasma genitalium genome. This synthetic genome, named M. genitalium JCVI-1.0, contains all the genes of wild-type M. genitalium G37 except MG408, which was disrupted by an antibiotic marker to block pathogenicity and to allow for selection. To identify the genome as synthetic, we inserted "watermarks" at intergenic sites known to tolerate transposon insertions. Overlapping "cassettes" of 5 to 7 kilobases (kb), assembled from chemically synthesized oligonucleotides, were joined by in vitro recombination to produce intermediate (...) assemblies of approximately 24 kb, 72 kb ("1/8 genome"), and 144 kb ("1/4 genome"), which were all cloned as bacterial artificial chromosomes in Escherichia coli. Most of these intermediate clones were sequenced, and clones of all four 1/4 genomes with the correct sequence were identified. The complete synthetic genome was assembled by transformation-associated recombination cloning in the yeast Saccharomyces cerevisiae, then isolated and sequenced. A clone with the correct sequence was identified. The methods described here will be generally useful for constructing large DNA molecules from chemically synthesized pieces and also from combinations of natural and synthetic DNA segments. 10.1126/science.1151721. (shrink)

It is proved that the relevance logic \ has no structurally complete consistent axiomatic extension, except for classical propositional logic. In fact, no other such extension is even passively structurally complete.

We investigate a lattice of conditional logics described by a Kripke type semantics, which was suggested by Chellas and Segerberg – Chellas–Segerberg (CS) semantics – plus 30 further principles. We (i) present a non-trivial frame-based completeness result, (ii) a translation procedure which gives one corresponding trivial frame conditions for arbitrary formula schemata, and (iii) non-trivial frame conditions in CS semantics which correspond to the 30 principles.

The complete surviving works of Epictetus, the most influential Stoic philosopher from antiquity. “Some things are up to us and some are not.” Epictetus was born into slavery around the year 50 CE, and, upon being granted his freedom, he set himself up as a philosophy teacher. After being expelled from Rome, he spent the rest of his life living and teaching in Greece. He is now considered the most important exponent of Stoicism, and his surviving work comprises a series (...) of impassioned discourses, delivered live and recorded by his student Arrian, and the Handbook, Arrian’s own take on the heart of Epictetus’s teaching. In Discourses, Epictetus argues that happiness depends on knowing what is in our power to affect and what is not. Our internal states and our responses to events are up to us, but the events themselves are assigned to us by the benevolent deity, and we should treat them—along with our bodies, possessions, and families—as matters of indifference, simply making the best use of them we can. Together, the Discourses and Handbook constitute a practical guide to moral self-improvement, as Epictetus explains the work and exercises aspirants need to do to enrich and deepen their lives. Edited and translated by renowned scholar Robin Waterfield, this book collects the complete works of Epictetus, bringing to modern readers his insights on how to cope with death, exile, the people around us, the whims of the emperor, fear, illness, and much more. (shrink)

The first aim of this paper is to prove a topological completeness theorem for a weak version of Stalnaker’s logic KB of knowledge and belief. The weak version of KB is characterized by the assumption that the axioms and rules of KB have to be satisfied with the exception of the axiom (NI) of negative introspection. The proof of a topological completeness theorem for weak KB is based on the fact that nuclei (as defined in the framework of (...) point-free topology) give rise to a profusion of topological belief operators that are compatible with the familiar topological knowledge operator. Thereby a canonical topological model for weak KB can be constructed. For this canonical model a truth lemma for the K and B holds such that a completeness theorem for KB can be proved in the familiar way. The second aim of this paper is to show that the topological interpretation of knowledge K comes along with a complete Heyting algebra of belief operators B that all fit the knowledge operator K in the sense that the pairs (K, B) satisfy all axioms of weak KB. This amounts to a pluralistic relation between knowledge and belief: Knowledge does not fully determine belief, rather it designs a conceptual space for belief operators where different (competing) belief operators coexist. (shrink)

Some of the most important developments of symbolic logic took place in the 1920s. Foremost among them are the distinction between syntax and semantics and the formulation of questions of completeness and decidability of logical systems. David Hilbert and his students played a very important part in these developments. Their contributions can be traced to unpublished lecture notes and other manuscripts by Hilbert and Bernays dating to the period 1917-1923. The aim of this paper is to describe these results, (...) focussing primarily on propositional logic, and to put them in their historical context. It is argued that truth-value semantics, syntactic ("Post-") and semantic completeness, decidability, and other results were first obtained by Hilbert and Bernays in 1918, and that Bernays's role in their discovery and the subsequent development of mathematical logic is much greater than has so far been acknowledged. (shrink)

: In the first edition of his book on the completeness of Kant’s table of judgments, Klaus Reich shortly indicates that the B-version of the metaphysical exposition of space in the Critique of pure reason is structured following the inverse order of the table of categories. In this paper, I develop Reich’s claim and provide further evidence for it. My argumentation is as follows: Through analysis of our actually given representation of space as some kind of object, the metaphysical (...) exposition will show that this representation is secondary to space considered as an original, undetermined and as such unrepresentable intuitive manifold. Now, following Kant, the representation of any kind of object involves diversity, synthesis and unity. In the case of our representation of space as formal intuition, this involves, firstly, a manifold a priori, i.e. space as pure form, delivered by the transcendental Aesthetic, secondly, a figurative, productive synthesis of that manifold, and, thirdly, the unity provided by the categories. Analysing our given representation of space – the task of the metaphysical exposition – amounts to dismantling its unity and determine its characteristics with respect to the categories. (shrink)

This paper presents a formalization of the classical proof of completeness in Henkin-style developed by Troelstra and van Dalen for intuitionistic logic with respect to Kripke models. The completeness proof incorporates their insights in a fresh and elegant manner that is better suited for mechanization. We discuss details of our implementation in the Lean theorem prover with emphasis on the prime extension lemma and construction of the canonical model. Our implementation is restricted to a system of intuitionistic propositional (...) logic with implication, conjunction, disjunction, and falsity given in terms of a Hilbert-style axiomatization. As far as we know, our implementation is the first verified Henkin-style proof of completeness for intuitionistic logic following Troelstra and van Dalen's method in the literature. (shrink)

The only complete edition in English of Baruch Spinoza's works, this volume features Samuel Shirley’s preeminent translations, distinguished at once by the lucidity and fluency with which they convey the flavor and meaning of Spinoza’s original texts. Michael L. Morgan provides a general introduction that places Spinoza in Western philosophy and culture and sketches the philosophical, scientific, religious, moral and political dimensions of Spinoza’s thought. Morgan’s brief introductions to each work give a succinct historical, biographical, and philosophical overview. A chronology (...) and index are included. (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)

Each had met his match, and happily, in the other. This book is the story of an elective affinity.

Steve Awodey and Erich H. Reck. Completeness and Categoricity: 19th Century Axiomatics to 21st Century Senatics.

We show that early vision can use monocular cues to rapidly complete partially-occluded objects. Visual search for easily detected fragments becomes difficult when the completed shape is similar to others in the display; conversely, search for fragments that are difficult to detect becomes easy when the completed shape is distinctive. Results indicate that completion occurs via the occlusion-triggered removal of occlusion edges and linking of associated regions. We fail to find evidence for a visible filling-in of contours or surfaces, but (...) do find evidence for a "functional" filling-in that prevents the constituent fragments from being rapidly accessed. As such, it is only the completed structures—and not the fragments themselves—that serve as the basis for rapid recognition. (shrink)

Hereditary structural completeness is established for a range of substructural logics, mainly without the weakening rule, including fragments of various relevant or many-valued logics. Also, structural completeness is disproved for a range of systems, settling some previously open questions.