A famous result of Hausdorff states that a sphere with countably many points removed can be partitioned into three pieces A, B, C such that A is congruent to B, B is congruent to C, and A is congruent to B ∪ C; this result was the precursor of the Banach–Tarski paradox. Later, R. Robinson characterized the systems of congruences like this which could be realized by partitions of the sphere with rotations witnessing the congruences. The pieces involved were nonmeasurable. (...) In the present paper, we consider the problem of which systems of congruences can be satisfied using open subsets of the sphere ; of course, these open sets cannot form a partition of the sphere, but they can be required to cover "most of" the sphere in the sense that their union is dense. Various versions of the problem arise, depending on whether one uses all isometries of the sphere or restricts oneself to a free group of rotations, or whether one omits the requirement that the open sets have dense union, and so on. While some cases of these problems are solved by simple geometrical dissections, others involve complicated iterative constructions and/or results from the theory of free groups. Many interesting questions remain open. (shrink)

In the following we show that general property S considered by Cowen [1], Cowen and Kolany in [3] and earlier by Cowen in [2] and Kolany in [4] as hypergraph satisfiability, can be constructively reduced to (3, 2) · SAT , that is to satisfiability of (at most) triples with two-element forbidden sets. This is an analogue of the“classical” result on the reduction of SAT to 3 · SAT.

The still unsettled decision problem for the restricted purely universal formulae 0-formulae) of the first order set-theoretic language based over =, ∈ is discussed in relation with the adoption or rejection of the axiom of foundation. Assuming the axiom of foundation, the related finite set-satisfiability problem for the very significant subclass of the 0-formulae consisting of the formulae involving only nested variables of level 1 is proved to be semidecidable on the ground of a reflection property over the (...) hereditarily finite sets, and various extensions of this result are obtained. When variables are restricted to range only over sets, in universes with infinitely many urelements the set-satisfiability problem is shown to be solvable provided the axiom of foundation is assumed; if it is not, then the decidability of a related derivability problem still holds. That, in turn, suggests the alternative adoption of an antifoundation axiom under which the set-satisfiability problem is also solvable . Turning to set theory without urelements, assuming a form of Boffa's antifoundation axiom, the complement of the set-satisfiability problem for the full class of Δ0-formulae is shown to be semidecidable; a result that is known not to hold, for the set-satisfiability problem itself, even for a very restricted subclass of the Δ0-formulae. (shrink)

Set-theoretic pluralism is an increasingly influential position in the philosophy of set theory (Balaguer [1998], Linksy and Zalta [1995], Hamkins [2012]). There is considerable room for debate about how best to formulate set-theoretic pluralism, and even about whether the view is coherent. But there is widespread agreement as to what there is to recommend the view (given that it can be formulated coherently). Unlike set-theoretic universalism, set-theoretic pluralism affords an answer to Benacerraf’s epistemological challenge. The purpose of this paper is (...) to determine what Benacerraf’s challenge could be such that this view is warranted. I argue that it could not be any of the challenges with which it has been traditionally identified by its advocates, like of Benacerraf and Field. Not only are none of the challenges easier for the pluralist to meet. None satisfies a key constraint that has been placed on Benacerraf’s challenge. However, I argue that Benacerraf’s challenge could be the challenge to show that our set-theoretic beliefs are safe – i.e., to show that we could not have easily had false ones. Whether the pluralist is, in fact, better positioned to show that our set-theoretic beliefs are safe turns on a broadly empirical conjecture which is outstanding. If this conjecture proves to be false, then it is unclear what the epistemological argument for set-theoretic pluralism is supposed to be. (shrink)

This article investigates the weak distributivity of Boolean σ-algebras satisfying the countable chain condition. It addresses primarily the question when such algebras carry a σ-additive measure. We use as a starting point the problem of John von Neumann stated in 1937 in the Scottish Book. He asked if the countable chain condition and weak distributivity are sufficient for the existence of such a measure.Subsequent research has shown that the problem has two aspects: one set theoretic and one combinatorial. (...) Recent results provide a complete solution of both the set theoretic and the combinatorial problems. We shall survey the history of von Neumann's Problem and outline the solution of the set theoretic problem. The technique that we describe owes much to the early work of Dorothy Maharam to whom we dedicate this article.§1. Complete Boolean algebras and weak distributivity. ABoolean algebrais a setBwith Boolean operationsa˅b,a˄b and −a, partial orderinga≤bdefined bya˄b=aand the smallest and greatest element,0and1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty setS, under operationsa∪b,a∩b,S−a, ordered by inclusion, with0= ∅ and1=S.Complete Boolean algebras and weak distributivity.A Boolean algebrais a setBwith Boolean operationsa˅b,a˄b and -a, partial orderinga≤bdefined bya˄b=aand the smallest and greatest element.0and1. By Stone's Representation Theorem, every Boolean algebra is isomorphic to an algebra of subsets of some nonempty setS, under operationsa∪b,a∩b,S-a, ordered by inclusion, with0= ϕ and1=S. (shrink)

In quantum logic, introduced by Birkhoff and von Neumann, De Morgan's Laws play an important role in the projection-valued truth value assignment of observational propositions in quantum mechanics. Takeuti's quantum set theory extends this assignment to all the set-theoretical statements on the universe of quantum sets. However, Takeuti's quantum set theory has a problem in that De Morgan's Laws do not hold between universal and existential bounded quantifiers. Here, we solve this problem by introducing a new truth value (...) assignment for bounded quantifiers that satisfies De Morgan's Laws. To justify the new assignment, we prove the Transfer Principle, showing that this assignment of a truth value to every bounded ZFC theorem has a lower bound determined by the commutator, a projection-valued degree of commutativity, of constants in the formula. We study the most general class of truth value assignments and obtain necessary and sufficient conditions for them to satisfy the Transfer Principle, to satisfy De Morgan's Laws, and to satisfy both. For the class of assignments with polynomially definable logical operations, we determine exactly 36 assignments that satisfy the Transfer Principle and exactly 6 assignments that satisfy both the Transfer Principle and De Morgan's Laws. (shrink)

As is well-known, the Bernays-Schönfinkel-Ramsey class of all prenex ∃*∀* -sentences which are valid in classical first-order logic is decidable. This paper paves the way to an analogous result which the authors deem to hold when the only available predicate symbols are ∈ and =, no constants or function symbols are present, and one moves inside a (rather generic) Set Theory whose axioms yield the well-foundedness of membership and the existence of infinite sets. Here semi-decidability of the satisfiability problem (...) for the BSR class is proved by following a purely semantic approach, the remaining part of the decidability result being postponed to a forthcoming paper. (shrink)

The -logic of Terwijn is a variant of first-order logic with the same syntax in which the models are equipped with probability measures and the quantifier is interpreted as ‘there exists a set A of a measure such that for each,...’. Previously, Kuyper and Terwijn proved that the general satisfiability and validity problems for this logic are, i) for rational, respectively -complete and -hard, and ii) for, respectively decidable and -complete. The adjective ‘general’ here means ‘uniformly over all languages’. We (...) extend these results in the scenario of finite models. In particular, we show that the problems of satisfiability and validity with respect to finite models in E-logic are, i) for rational, respectively -complete and -complete, and ii) for, respectively decidable and -complete. Although partial results toward the countable case are also achieved, the computability of E-logic over countable models still remains largely unsolved. In addition, most o... (shrink)

In this paper some of the history of the development of arithmetic in set theory is traced, particularly with reference to the problem of avoiding the assumption of an infinite set. Although the standard method of singling out a sequence of sets to be the natural numbers goes back to Zermelo, its development was more tortuous than is generally believed. We consider the development in the light of three desiderata for a solution and argue that they can probably not (...) all be satisfied simultaneously. (shrink)

In the context of propositional logics, we apply semantics modulo satisfiability—a restricted semantics which comprehends only valuations that satisfy some specific set of formulas—with the aim to efficiently solve some computational tasks. Three possible such applications are developed.We begin by studying the possibility of implicitly representing rational McNaughton functions in Łukasiewicz Infinitely-valued Logic through semantics modulo satisfiability. We theoretically investigate some approaches to such representation concept, called representation modulo satisfiability, and describe a polynomial algorithm that builds representations in the newly (...) introduced system. An implementation of the algorithm, test results and ways to randomly generate rational McNaughton functions for testing are presented. Moreover, we propose an application of such representations to the formal verification of properties of neural networks by means of the reasoning framework of Łukasiewicz Infinitely-valued Logic.Then, we move to the investigation of the satisfiability of joint probabilistic assignments to formulas of Łukasiewicz Infinitely-valued Logic, which is known to be an NP-complete problem. We provide an exact decision algorithm derived from the combination of linear algebraic methods with semantics modulo satisfiability. Also, we provide an implementation for such algorithm for which the phenomenon of phase transition is empirically detected.Lastly, we study the game theory situation of observable games, which are games that are known to reach a Nash equilibrium, however, an external observer does not know what is the exact profile of actions that occur in a specific instance; thus, such observer assigns subjective probabilities to players actions. We study the decision problem of determining if a set of these probabilistic constraints is coherent by reducing it to the problems of satisfiability of probabilistic assignments to logical formulas both in Classical Propositional Logic and Łukasiewicz Infinitely-valued Logic depending on whether only pure equilibria or also mixed equilibria are allowed. Such reductions rely upon the properties of semantics modulo satisfiability. We provide complexity and algorithmic discussion for the coherence problem and, also, for the problem of computing maximal and minimal probabilistic constraints on actions that preserves coherence.prepared by Sandro Márcio da Silva Preto.E-mail: [email protected]:https://doi.org/10.11606/T.45.2021.tde-17062021-163257. (shrink)

There is a family of questions in relativized complexity theory--weak analogs of the Friedberg Jump-Inversion Theorem--that are resolved by 1-generic sets but which cannot be resolved by essentially any weaker notion of genericity. This paper defines aw2-generic sets. i.e., sets which meet every dense set of strings that is r.e. in some incomplete r.e. set. Aw2-generic sets are very close to 1-generic sets in strength, but are too weak to resolve these questions. In particular, it is shown that for any (...) set X there is an aw2-generic set G such that $\mathbf{NP}^G \cap co-\mathbf{NP}^G \nsubseteq \mathbf{P}^{G \oplus X}$ . (On the other hand, if G is 1-generic, then $\mathbf{NP}^G \cap co-\mathbf{NP}^G \subseteq \mathbf{P}^{G \oplus \mathrm{SAT}}$ . where SAT is the NP-complete satisfiability problem [6].) This result runs counter to the fact that most finite extension constructions in complexity theory can be made effective. These results imply that any finite extension construction that ensures any of the Friedberg analogs must be noneffective, even relative to an arbitrary incomplete r.e. set. It is then shown that the recursion theoretic properties of aw2-generic sets differ radically from those of 1-generic sets: every degree above O' contains an aw2-generic set: no aw2-generic set exists below any incomplete r.e. set; there is an aw2-generic set which is the join of two Turing equivalent aw2-generic sets. Finally, a result of Shore is presented [30] which states that every degree above 0' is the jump of an aw2-generic degree. (shrink)

Answer set programming (ASP) is a form of declarative programming oriented towards difficult search problems. As an outgrowth of research on the use of nonmonotonic reasoning in knowledge representation, it is particularly useful in knowledge-intensive applications. ASP programs consist of rules that look like Prolog rules, but the computational mechanisms used in ASP are different: they are based on the ideas that have led to the creation of fast satisfiability solvers for propositional logic.

Transitive extensional well founded relations provide an intuitionistic notion of ordinals which admits transfinite induction. However these ordinals are not directed and their successor operation is poorly behaved, leading to problems of functoriality. We show how to make the successor monotone by introducing plumpness, which strengthens transitivity. This clarifies the traditional development of successors and unions, making it intuitionistic; even the (classical) proof of trichotomy is made simpler. The definition is, however, recursive, and, as their name suggests, the plump ordinals (...) grow very rapidly. Directedness must be defined hereditarily. It is orthogonal to the other four conditions, and the lower powerdomain construction is shown to be the universal way of imposing it. We treat ordinals as order-types, and develop a corresponding set theory similar to Osius' transitive set objects. This presents Mostowski's theorem as a reflection of categories, and set-theoretic union is a corollary of the adjoint functor theorem. Mostowski's theorem and the rank for some of the notions of ordinal are formulated and proved without the axiom of replacement, but this seems to be unavoidable for the plump rank. The comparison between sets and toposes is developed as far as the identification of replacement with completeness, and there are some suggestions for further work in this area. Each notion of set or ordinal defines a free algebra for one of the theories discussed by Joyal and Moerdijk, namely joins of a family of arities together with an operation s satisfying conditions such as x ≤ sx, monotonicity or s(x ∨ y) ≤ sx ∨ sy. Finally we discuss the fixed point theorem for a monotone endofunction s of a poset with least element and directed joins. This may be proved under each of a variety of additional hypotheses. We explain why it is unlikely that any notion of ordinal obeying the induction scheme for arbitrary predicates will prove the pure result. (shrink)

Recall that [Formula: see text] is the lattice of Muchnik degrees of nonempty effectively compact sets in Euclidean space. We solve a long-standing open problem by proving that [Formula: see text] is dense, i.e. satisfies [Formula: see text]. Our proof combines an oracle construction with hyperarithmetical theory.

An information recovery problem is the problem of constructing a proposition containing the information dropped in going from a given premise to a given conclusion that folIows. The proposition(s) to beconstructed can be required to satisfy other conditions as well, e.g. being independent of the conclusion, or being “informationally unconnected” with the conclusion, or some other condition dictated by the context. This paper discusses various types of such problems, it presents techniques and principles useful in solving them, and (...) it develops algorithmic methods for certain classes of such problems. The results are then applied to classical number theory, in particular, to questions concerning possible refinements of the 1931 Gödel Axiom Set, e.g. whether any of its axioms can be analyzed into “informational atoms”. Two propositions are “informationally unconnected” [with each other] if no informative (nontautological) consequence of one also follows from the other. A proposition is an “informational atom” if it is informative but no information can be dropped from it without rendering it uninformative (tautological). Presentation, employment, and investigation of these two new concepts are prominent features of this paper. (shrink)

Russellian physicalism is a promising answer to the mind–body problem which attempts to satisfy the motivating epistemic and metaphysical concerns of non-physicalists with regards to consciousness, while also maintaining a physicalist commitment to the non-existence of fundamental mentality. Chan (_Philosophical Studies, 178_:2043–62, 2021) has recently described a challenge to Russellian physicalism he deems the ‘difference-maker problem’, which is a Russellian-physicalism-specific version of the more well-known ‘combination problem’ for Russellian monism generally. The problem is to determine how (...) a relatively small set of fundamental categorical property types can ground the large variety of phenomenal properties that exist. To answer this problem, a Russellian physicalist can say that there is strong emergence from fundamental categorical properties to phenomenal properties, or she can say that there is only weak emergence from fundamental categorical properties to phenomenal properties. Chan argues that neither of these routes are viable for Russellian physicalism. This paper constitutes a response to Chan, arguing that Russellian physicalists can embrace either weak or strong emergence to explain phenomenal variety. (shrink)

An information recovery problem is the problem of constructing a proposition containing the information dropped in going from a given premise to a given conclusion that folIows. The proposition(s) to beconstructed can be required to satisfy other conditions as well, e.g. being independent of the conclusion, or being “informationally unconnected” with the conclusion, or some other condition dictated by the context. This paper discusses various types of such problems, it presents techniques and principles useful in solving them, and (...) it develops algorithmic methods for certain classes of such problems. The results are then applied to classical number theory, in particular, to questions concerning possible refinements of the 1931 Gödel Axiom Set, e.g. whether any of its axioms can be analyzed into “informational atoms”. Two propositions are “informationally unconnected” [with each other] if no informative (nontautological) consequence of one also follows from the other. A proposition is an “informational atom” if it is informative but no information can be dropped from it without rendering it uninformative (tautological). Presentation, employment, and investigation of these two new concepts are prominent features of this paper. (shrink)

Scientific naturalism—the conception according to which the natural sciences, and possibly physics alone, set the limits of ontology and epistemology—is characterized by a strong monistic tendency. For this reason, all versions of scientific naturalism face the so-called “placement problem”, which concerns the features of the ordinary view of the world that, at least prima facie, do not fit into the scientific view of the world (think of consciousness, moral properties, free will, and intentionality). To address this problem, scientific (...) naturalists use three strategies: reductionism, eliminativism, and mysterianism—none of which, it is argued, produces satisfying results. Liberal naturalism opts instead for a pluralistic attitude in both ontology and epistemology but accepts a constraint according to which one should accept no entity or explanation that is incompatible with the scientific worldview. Liberal naturalism faces the “reconciliation problem”, which concerns the relationship between the scientific and the ordinary views of the world once one denies ontological and epistemological priority to either of them. Three strategies for addressing this problem are presented: according to the first, the ordinary worldview and the scientific world are categorically distinct; according to the second, the former emerges from the latter; according to the third, between them there is a relation of global supervenience. Other objections to liberal naturalism are finally presented and addressed. (shrink)

The CMI Millennium “P vs NP Problem” can be resolved e.g. if one shows at least one counterexample to the "P = NP" conjecture. A certain class of problems being such counterexamples will be formulated. This implies the rejection of the hypothesis that "P = NP" for any conditions satisfying the formulation of the problem. Thus, the solution "P is different from NP" of the problem in general is proved. The class of counterexamples can be interpreted as (...) any quantum superposition of any finite set of quantum states. The Kochen-Specker theorem is involved. Any fundamentally random choice among a finite set of alternatives belong to "NP" but not to "P". The conjecture that the set complement of "P" to "NP" can be described by that kind of choice exhaustively is formulated. (shrink)

We prove that the sets of standard tautologies of predicate Product Logic and of predicate Basic Logic, as well as the set of standard-satisfiable formulas of predicate Basic Logic are not arithmetical, thus finding a rather satisfactory solution to three problems proposed by Hájek in [H01].

Lawyers and philosophers have found it challenging to construct an account of when an act causes harm that is broad enough to address multiple agent problems but not so broad that it fails to distinguish between genuinely harming a person and imposing a condition on a person that we deem undesirable. Thus, we may think an act causes harm only if it makes a difference to a person and, more specifically, makes things worse for that person. If the effect is (...) the same whatever the one agent does in virtue of what a second agent does or is prepared to do, it may seem that what the one agent does makes no difference. Multiple agent problems are endemic. Legal hypotheticals include the example of two fires, each ‘tortiously’ set, converging on a single barn. The physician faces a multiple agent problem when he or she understands that refusing to provide the fertility treatment a patient demands will just lead to another physician providing the treatment instead. And corporations face the problem when they project that conscientiously refraining from drilling for oil at a particular site will not safeguard that site but rather open the door to equally deleterious activities of still other corporations. This paper argues that a useful first step in developing an account of harm in the multiple agent context is to recognize that often, even if the individual agent cannot make things better for a person, the group can. It seems, however, that a fully adequate account will also show how and when the harm that the group imposes on a person devolves to the agent. This paper proposes such an account. Requirements include: that the agent is a member of a group implicated in the harm; that the agent participate in the bringing about of that harm; and that the agent’s non-participation would not have made things worse for the person. To avoid the charge of harm, then, and still participate in the harm that is done by the group, the agent’s participation must make things better for the person; simply not making things worse, once the other conditions are satisfied, is not enough to avoid the charge of harm. Advantages of the proposed account include its ability to discern as an exception cases in which the agent’s non-participation would have made things worse for the person and to distinguish cases involving a mix of natural and man-made causes. (shrink)

A few years ago, believing that human thinking is nonmonotonic, I tried to reconstruct a nonmonotonic reasoning by application of two monotonic procedures. I called them “step forward” and “step backward” . The first procedure is just a consequence operation responsible for an extension of the set of beliefs. The second one, defined on the base of the logic of falsehood reconstructed for the given logic of truthfulness, is responsible for a reduction of the set of beliefs. Both procedures taken (...) together were successfully verified by using so-called AGM , postulates for expansion, contraction and revision formulated by Alchourrón, Gärdenfors and Makinson . Reasoning composed of the mutual application of both procedures seemed to be quite natural for modeling our thinking. At that time, I supposed that it should be nonmonotonic but I was wrong. It turned out impossible to satisfy a definition of the nonmonotonic inference by reasoning composed both steps. To understand why this is impossible, I began to analyze how nonmonotonicity is obtainable in some well-known cases in the literature. I analyzed the problem from two points of view: non-formal examples for nonmonotonicity and formal constructions of nonmonotonic operations/relations. The result of those investigations was astonishing: none of the considered by me cases of nonmonotonicity belonging to point and almost none belonging to satisfies the definition of nonmonotonic inference. Arguments against the nonmonotonic character of well-known examples for nonmonotonicity of human thinking are more precisely presented in [6]. I present them below an abbreviated version of them. (shrink)

Norman Daniels’ theory of justice and health faces a serious practical problem: his theory can ground the special moral importance of health and allows distinguishing just from unjust health inequalities, but it provides little practical guidance for allocating resources when they are especially scarce. Daniels’ solution to this problem is a fair process that he specifies as "accountability for reasonableness". Daniels claims that accountability for reasonableness makes limit-setting decisions in healthcare not only legitimate, but also fair. This paper (...) assesses the latter claim. Does accountability for reasonableness result in fair limit-setting decisions? It is argued that the answer to this question is not a clear yes. Daniels is remarkably unclear about the criterion of fairness that accountability for reasonableness satisfies. The paper discusses different options for resolving this lack of clarity and examines how they apply to Daniels’ accountability for reasonableness framework. It is concluded, first, that accountability for reasonableness is not a paradigm case of any of the classic notions of procedural justice; second, that what might be called "constrained pure procedural justice" best reflects how accountability for reasonableness results in fair limit-setting decisions; and third, that the procedural conditions of accountability for reasonableness must be further specified and amended to better achieve a fair process, and hence fair limit-setting decisions. (shrink)

An allocation problem is a type of aggregation problem in which the values of individuals' opinions on some set of variables (canonically a set of mutually exclusive and exhaustive possibilities) sum to a constant. This paper shows that for realistic allocation problems, namely ones in which the set of possible opinion values is finite, the only universal aggregation methods that satisfy two commonly invoked conditions are the dictatorial ones. The two conditions are, first, that the aggregate opinion on (...) any variable depends only on the individuals' opinions on that variable and not on their opinions on any other variable and, secondly, that the aggregate opinion minimally preserves unanimous individual opinion. Connections between this result and similar ones in the literature on judgment aggregation are explored and their significance assessed. (shrink)

It is well known that for all recursively enumerable sets X 1 , X 2 there are disjoint recursively enumerable sets Y 1 , Y 2 such that $Y_1 \subseteq X_1, Y_2 \subseteq X_2$ and Y 1 ∪ Y 2 = X 1 ∪ X 2 . Alistair Lachlan called distributive lattices satisfying this property separated. He proved that the first-order theory of finite separated distributive lattices is decidable. We prove here that the first-order theory of all separated distributive lattices (...) is undecidable. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Journal of the History of Ideas 63.2 (2002) 239-259 [Access article in PDF] Original Sin and the Problem of Knowledge in Early Modern Europe Peter Harrison It is not the philosophy received from Adam that teaches these things; it is that received from the serpent; for since Original Sin, the mind of man is quite pagan. It is this philosophy that, together with the errors of the senses, (...) made men adore the sun, and that today is still the universal cause of the disorder of men's minds and the corruption of men's hearts. Nicolas Malebranche 1In his Éloge du Pere Malebranche, delivered to the Parisian Academy of Sciences on 22 April 1716, Bernard Fontenelle recounted the story of Nicolas Malebranche's somewhat controversial conversion to Cartesianism. When friends and colleagues had taken him to task over his new-found commitment to the doctrines of Descartes, Malebranche responded with this question: "Did Adam have the perfect science?" It was agreed that this was the common view. Malebranche responded that he, too, aspired to the perfect science, and that his quest for this knowledge could not be satisfied by following the historical or critical pursuits of his colleagues, but by adopting the procedures set out by Descartes. 2 For Malebranche, the Cartesian method offered a means of overcoming the limitations of the fallen intellectual faculties of Adam's seventeenth-century descendents, and thus of restoring the fabled encyclopedic knowledge of the first man. [End Page 239]Aspirations to recover the science of Adam provided a common motivation for a number of early-modern philosophical projects. Earlier in the seventeenth century Francis Bacon had famously observed in his Novum Organum (1620) that the human dominion over nature which Adam had lost at the Fall could be restored in some measure by the sciences: "For man by the fall fell at the same time from this state of innocency and from his dominion over creation." The moral losses of the human race were to be restored in some measure by "religion and faith"; Adam's lost knowledge, and the dominion which it made possible, by "arts and sciences." 3 Bacon's vision of a reconstructed knowledge of nature during the period which he regarded (somewhat prematurely) as "the last times" clearly played an important role in legitimizing the goals and methods of the new natural philosophy. Indeed the program of the Royal Society of London from its inception in 1660 explicitly relied upon a Baconian rhetoric of the restoration of that human knowledge and dominion over nature which Adam had once enjoyed.While historians such as Charles Webster have alluded to the ways in which the myth of an original perfect philosophy motivated projects for the advancement of learning in a rather general way, little attention has been paid to the manner in which early-modern views of the nature of the original fall from knowledge directly informed the methods of the new sciences, determined the scope of their enquiry, and provided ammunition for use against traditional learning. 4 Moreover, most commentators, following Webster's lead, have restricted their attention to Francis Bacon, and to the Baconian aspirations of subsequent reformers of knowledge in seventeenth-century England. In this paper I shall suggest that the biblical narrative of the Fall played a far more direct role in the development of early modern knowledge—both in England and on the Continent—than has often been assumed, and that competing strategies for the advancement of knowledge in the seventeenth century were closely related to different assessments of the Fall and of its impact upon the human mind. While confirmation of this claim would require a more comprehensive study than space here permits, this paper will set out a number of preliminary considerations which establish the plausibility of such a thesis, showing how the biblical narrative of the Fall directly informed the epistemological projects of the seventeenth century, and prompted various rationalist and empiricist solutions. [End Page 240] The Mind of Adam There was an almost universal consensus in the sixteenth... (shrink)

The Three Papers comprising this series, together with my earlier [34] also published in this journal, constitute an attempt to set out the major issues in the theoretical domain of reduction and to develop a general theory of theory reduction. The fourth paper, [34], though published separately from this trio, is integral to the presentation and should be read in conjunction with these papers. Even so, the presentation is limited in scope – roughly, to intertheoretic reduction among empirical theories – (...) and informal in presentation – not least because a satisfying formal account of theories has yet to be offered. And despite the length, the treatment is still condensed; often corroborating and/or intuitively helpful detail has had to be consigned to footnotes or omitted. I approach the problem from within my own naturalistic realist philosophy of science and formal analysis of abstract hierarchy in theory. The sources for the former are [25], [29], [31], and [32] and those for the latter essentially [27] and [30]. Hierarchical notions played a significant role in the already published [34]. (shrink)

Aristotle’s On generation and corruption raises a vital question: how is mixture, or what we would now call chemical combination, possible? It also offers an outline of a solution to the problem and a set of criteria that a successful solution must meet. Understanding Aristotle’s solution and developing a viable peripatetic theory of chemical combination has been a source of controversy over the last two millennia. We describe seven criteria a peripatetic theory of mixture must satisfy: uniformity, recoverability, potentiality, (...) equilibrium, alteration, incompleteness, and the ability to distinguish mixture from generation, corruption, juxtaposition, augmentation, and alteration. After surveying the theories of Philoponus , Avicenna , Averroes , and John M. Cooper , we argue for the merits of Richard Rufus of Cornwall’s theory. Rufus was a little known scholastic philosopher who became a Franciscan theologian in 1238, after teaching Aristotelian natural philosophy as a secular master in Paris. Lecturing on Aristotle’s De generatione et corruptione, around the year 1235, he offered his students a solution to the problem of mixture that we believe satisfies Aristotle’s seven criteria.Author Keywords: Mixture; Mixt; Chemical combination; Accidental potential; Potential; Elements; Medieval chemistry; Peripatetic chemistry; Aristotelian science; Richardus Rufus; Averroes ; Avicenna ; Philoponus ; John M. Cooper. (shrink)

As proved recently, the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Shönfinkel-Ramsey class is semi-decidable over von Neumann's cumulative hierarchy. Here that semi-decidability result is strengthened into a decidability result for the same collection of formulae.

Background Rapid Ethical Assessment is a form of rapid ethnographic assessment conducted at the beginning of research project to guide the consent process with the objective of reconciling universal ethical guidance with specific research contexts. The current study is conducted to assess the perceived relevance of introducing REA as a mainstream tool in Ethiopia. Methods Mixed methods research using a sequential explanatory approach was conducted from July to September 2012, including 241 cross-sectional, self-administered and 19 qualitative, in-depth interviews among health (...) researchers and regulators including ethics committee members in Ethiopian health research institutions and universities. Results In their evaluation of the consent process, only 40.2% thought that the consent process and information given were adequately understood by study participants; 84.6% claimed they were not satisfied with the current consent process and 85.5% thought the best interests of study participants were not adequately considered. Commonly mentioned consent-related problems included lack of clarity, inadequate information, language barriers, cultural differences, undue expectations and power imbalances. About 95.4% believed that consent should be contextualized to the study setting and 39.4% thought REA would be an appropriate approach to improve the perceived problems. Qualitative findings helped to further explore the gaps identified in the quantitative findings and to map-out concerns related to the current research consent process in Ethiopia. Suggestions included, conducting REA during the pre-test phase of studies when applicable. The need for clear guidance for researchers on issues such as when and how to apply the REA tools was stressed. Conclusion The study findings clearly indicated that there are perceived to be correctable gaps in the consent process of medical research in Ethiopia. REA is considered relevant by researchers and stakeholders to address these gaps. Exploring further the feasibility and applicability of REA is recommended. (shrink)

Addressing “wicked” socio-ecological problems necessitate the integration of knowledge and methods from multiple disciplines. Transdisciplinarity (TD) is one such strategy; its focus is to enhance the comprehensiveness, robustness, and relevance of science via cross-disciplinary team science (CDTS). What separates TD from other forms of CDTS (e.g., multidisciplinary, interdisciplinary) is the meaningful inclusion of a diverse set of nonacademic stakeholders. In collaboration, the TD team draws on tacit and explicit knowledge to co-develop new understandings of vexing “real-world” problems. However, guidance for (...) TD is scant and it leaves open, for instance, questions about how to develop an appropriate team, acquire essential team-based skills, manage the costs of participation, develop individual and group readiness, and satisfy organization expectations, while also attempting to build the trust-based relationships that are fundamental to the approach. Needed are “boundary players” with multi-dimensional skills who transcend the science, facilitate cooperation, and reduce transaction costs. (shrink)

The question of whether the idealized models of theoretical economics are explanatory has been the subject of intense philosophical debate. It is sometimes presupposed that either a model provides the actual explanation or it does not provide an explanation at all. Yet, two sets of issues are relevant to the evaluation of model-based explanation: what conditions should a model satisfy in order to count as explanatory and does the model satisfy those conditions. My aim in this paper is to unpack (...) this distinction and show that separating the first set of issues from the second is crucial to an accurate diagnosis of the distinctive challenges that economic models pose. Along the way I sketch a view of model-based explanation in economics that focuses on the role that non-empirical and empirical strategies play in increasing confidence in the adequacy of a given model-based explanation. (shrink)

Aristotle’s On generation and corruption raises a vital question: how is mixture, or what we would now call chemical combination, possible? It also offers an outline of a solution to the problem and a set of criteria that a successful solution must meet. Understanding Aristotle’s solution and developing a viable peripatetic theory of chemical combination has been a source of controversy over the last two millennia. We describe seven criteria a peripatetic theory of mixture must satisfy: uniformity, recoverability, potentiality, (...) equilibrium, alteration, incompleteness, and the ability to distinguish mixture from generation, corruption, juxtaposition, augmentation, and alteration. After surveying the theories of Philoponus (d. 574), Avicenna(d. 1037), Averroes (d. 1198), and John M. Cooper (fl. circa2000), we argue for the merits of Richard Rufus of Cornwall’s theory. Rufus (fl. 1231–1256) was a little known scholastic philosopher who became a Franciscan theologian in 1238, after teaching Aristotelian natural philosophy as a secular master in Paris. Lecturing on Aristotle’s De generatione et corruptione, around the year 1235, he offered his students a solution to the problem of mixture that we believe satisfies Aristotle’s seven criteria. # 2004 Elsevier Ltd. All rights reserved. (shrink)

The set of all words in the alphabet {l, r} forms the full binary tree T. If x ∈ T then xl and xr are the left and the right successors of x respectively. We consider the monadic second-order language of the full binary tree with the two successor relations. This language allows quantification over elements of T and over arbitrary subsets of T. We prove that there is no monadic second-order formula φ * (X, y) such that for every (...) nonempty subset X of T there is a unique y ∈ X that satisfies φ * (X, y) in T. (shrink)

In program synthesis, we transform a specification into a system that is guaranteed to satisfy the specification. When the system is open, then at each moment it reads input signals and writes output signals, which depend on the input signals and the history of the computation so far. The specification considers all possible input sequences. Thus, if the specification is linear, it should hold in every computation generated by the interaction, and if the specification is branching, it should hold in (...) the tree that embodies all possible input sequences. Often, the system cannot read all the input signals generated by its environment. For example, in a distributed setting, it might be that each process can read input signals of only part of the underlying processes. Then, we should transform a specification into a system whose output depends only on the readable parts of the input signals and the history of the computation. This is called synthesis with incomplete information. In this work we solve the problem of synthesis with incomplete information in its full generality. We consider linear and branching settings with complete and incomplete information. We claim that alternation is a suitable and helpful mechanism for coping with incomplete information. Using alternating tree automata, we show that incomplete information does not make the synthesis problem more complex, in both the linear and the branching paradigm. In particular, we prove that independently of the presence of incomplete information, the synthesis problems for CTL and CTL * are complete for EXPTIME and 2EXPTIME, respectively. (shrink)

Lin and Kelly :957–981, 2012) and Leitgeb :1338–1389, 2013, Philos Rev 123:131–171, 2014), offer similar solutions to the Lottery Paradox, defining acceptance rules which determine a rational agent’s beliefs in terms of broader features of her credal state than just her isolated credences in individual propositions. I express each proposal as a method for obtaining an ordering over a partition from a credence function, and then a belief set from the ordering. Although these proposals avoid the original Lottery Paradox, I (...) raise a diachronic case which illustrates that neither satisfies both Lin and Kelly’s constraint that the update on orderings track the update on credence functions, and the intuitive constraint that credence of at least 0.5 is necessary for rational belief. I conclude by suggesting that we reformulate these proposals in terms of orderings over entire algebras based on partitions rather than orderings just over the partitions themselves. Reformulating both rules in this way yields acceptance rules which avoid the Lottery Paradox while satisfying both the tracking and likeliness constraints. (shrink)

This paper criticizes the dominant approaches to presupposition projection and proposes an alternative. Both the update semantics of Heim and the discourse representation theory of van der Sandt have problems in explicating the presuppositions of disjunctions. Moreover, Heim's approach is committed to a conception of accommodation that founders on the problem of informative presuppositions, and van der Sandt's approach is committed to a conception of accommodation that generates over-interpretations of utterances. The present approach borrows Karttunen's idea that instead of (...) associating presuppositions with sentences, we should define the conditions that contexts must meet in order to satisfy-the-presuppositions-of a sentence. However, in place of Karttunen's conception of contexts in terms of common ground, the present theory substitutes a conception of contexts as objective entities that are independent of the attitudes of the interlocutors. Contexts, so conceived, may be defined as containing sets of relevant possibilities. This allows us to define the conditions under which a context satisfies-the-presuppositions-of a disjunction. (shrink)

In a recent paper, John Wigglesworth explicates the notion of a set's being grounded in or ontologically depending on its members by the modal statement that in any world, that a set exists in that world entails that its members exist as well. After suggesting that variable-domain S5 captures an appropriate account of metaphysical necessity, Wigglesworth purports to prove that in any set theory satisfying the axiom Extensionality this condition holds, that is, that sets ontologically depend on their members with (...) respect to extraordinarily weak notions of set. This paper diagnoses a number of problems concerning Wigglesworth's formal argument. For one, we will show that Wigglesworth's argument is invalid as it requires an appeal to hidden, extralogical theses concerning rigid designation and the persistence of sets across possible worlds. Having demonstrated the indispensability of these principles to Wigglesworth's argument, we will then show that even granted the enthymematic premises, the argument only proves the ontological dependence of singletons on their members and does not extend to sets in general. Finally, we will consider strengthenings of Wigglesworth's reasoning and suggest that even the weakest generalization will bear undesirable consequences. (shrink)

In this article I analyse and discuss guidelines for priority setting in crisis management at a regional level in Sweden. The guidelines concern three types of crises: pandemics, large losses of electric power and interruptions in water supply. Pandemics are typical public health issues. Large losses of electric power and interruptions in water supply are in themselves not, but may have serious public health consequences. These guidelines are compared with guidelines for priority setting in health care. This is done because (...) of the central position of health care in the management of many different types of crises. The comparison shows clear differences. In the analysis, I use a distinction between substantive principles of priority setting and process-oriented principles. Regarding substantive principles, I have found that the guidelines point in different directions. This seems acceptable, however, since they focus on different problems. Moreover, it seems possible to integrate the various context-dependent principles by relating them to higher order principles. Regarding process-oriented principles, I have found that how and to what extent these principles are applied in the guidelines vary. If we want to apply these principles in a more satisfying way, this would require a more systematic approach. (shrink)

Artificial intelligence and robotic technologies have become nearly ubiquitous. In some ways, the developments have likely helped us, but in other ways sophisticated technologies set back our interests. Among the latter sort is what has been dubbed the ‘severance problem’—the idea that technologies sever our connection to the world, a connection which is necessary for us to flourish and live meaningful lives. I grant that the severance problem is a threat we should mitigate and I ask: how can (...) we stave it off? In particular, the fact that some technologies exhibit behavior that is unclear to us seems to constitute a kind of severance. Building upon contemporary work on moral responsibility, I argue for a mechanism I refer to as ‘technological answerability’, namely the capacity to recognize human demands for answers and to respond accordingly. By designing select devices—such as robotic assistants and personal AI programs—for increased answerability, we see at least one way of satisfying our demands for answers and thereby retaining our connection to a world increasingly occupied by technology. (shrink)

We study generalizations of shortest programs as they pertain to Schaefer’s problem. We identify sets of -minimal and -minimal indices and characterize their truth-table and Turing degrees. In particular, we show , , and that there exists a Kolmogorov numbering ψ satisfying both and . This Kolmogorov numbering also achieves maximal truth-table degree for other sets of minimal indices. Finally, we show that the set of shortest descriptions, , is 2-c.e. but not co-2-c.e. Some open problems are left for (...) the reader. (shrink)

Methods of machine learning (ML) are gradually complementing and sometimes even replacing methods of classical statistics in science. This raises the question whether ML faces the same methodological problems as classical statistics. This paper sheds light on this question by investigating a long-standing challenge to classical statistics: the reference class problem (RCP). It arises whenever statistical evidence is applied to an individual object, since the individual belongs to several reference classes and evidence might vary across them. Thus, the (...) class='Hi'>problem consists in choosing a suitable reference class for the individual. I argue that deep neural networks (DNNs) are able to overcome specific instantiations of the RCP. Whereas the criteria of narrowness, reliability, and homogeneity, that have been proposed to determine a suitable reference class, pose an inextricable tradeoff to classical statistics, DNNs are able to satisfy them in some situations. On the one hand, they can exploit the high dimensionality in big-data settings. I argue that this corresponds to the criteria of narrowness and reliability. On the other hand, ML research indicates that DNNs are generally not susceptible to overfitting. I argue that this property is related to a particular form of homogeneity. Taking both aspects together reveals that there are specific settings in which DNNs can overcome the RCP. (shrink)

We prove that any speedable computably enumerable set may be split into a disjoint pair of speedable computably enumerable sets. This solves a longstanding question of J.B. Remmel concerning the behavior of computably enumerable sets in Blum's machine independent complexity theory. We specify dynamic requirements and implement a novel way of detecting speedability-by embedding the relevant measurements into the substage structure of the tree construction. Technical difficulties in satisfying the dynamic requirements lead us to implement "local" strategies that only look (...) down the tree. The (obvious) problems with locality are then resolved by placing an isomorphic copy of the entire priority tree below each strategy (yielding a self-similar tree). This part of the construction could be replaced by an application of the Recursion Theorem, but shows how to achieve the same effect with a more direct construction. (shrink)

The dispute over the viability of various theories of relativistic, dissipative fluids is analyzed. The focus of the dispute is identified as the question of determining what it means for a theory to be applicable to a given type of physical system under given conditions. The idea of a physical theory's regime of propriety is introduced, in an attempt to clarify the issue, along with the construction of a formal model trying to make the idea precise. This construction involves a (...) novel generalization of the idea of a field on spacetime, as well as a novel method of approximating the solutions to partial-differential equations on relativistic spacetimes in a way that tries to account for the peculiar needs of the interface between the exact structures of mathematical physics and the inexact data of experimental physics in a relativistically invariant way. It is argued, on the basis of these constructions, that the idea of a regime of propriety plays a central role in attempts to understand the semantical relations between theoretical and experimental knowledge of the physical world in general, and in particular in attempts to explain what it may mean to claim that a physical theory models or represents a kind of physical system. This discussion necessitates an examination of the initial-value formulation of the partial-differential equations of mathematical physics, which suggests a natural set of conditions---by no means meant to be canonical or exhaustive---one may require a mathematical structure, in conjunction with a set of physical postulates, satisfy in order to count as a physical theory. Based on the novel approximating methods developed for solving partial-differential equations on a relativistic spacetime by finite-difference methods, a technical result concerning a peculiar form of theoretical under-determination is proved, along with a technical result purporting to demonstrate a necessary condition for the self-consistency of a physical theory. (shrink)

In a school choice problem, each school has a priority ordering over the set of students. These orderings depend on criteria such as whether a student lives within walking distance or has a sibling at the school. A priority ordering provides a ranking of students but nothing more. I argue that this information is sufficient when priority is based on merit but not when priority is based on criteria such as walking distance. I propose an extended formulation of the (...) problem wherein a ‘priority matrix’, indicating which criteria are satisfied by each student-school pair, replaces the usual priority orderings. (shrink)

For a quasi variety of algebras K, the Higman Theorem is said to be true if every recursively presented K-algebra is embeddable into a finitely presented K-algebra; the Generalized Higman Theorem is said to be true if any K-algebra which is recursively presented over its finitely generated subalgebra is embeddable into a K-algebra which is finitely presented over this subalgebra. We suggest certain general conditions on K under which the Higman Theorem implies the Generalized Higman Theorem; a finitely generated K-algebra (...) A is embeddable into every existentially closed K-algebra containing a finitely generated K-algebra B if and only if the word problem for A is Q-reducible to the word problem for B. The quasi varieties of groups, torsion-free groups, and semigroups satisfy these conditions. (shrink)

Let U be a well-founded model of ZFC whose class of ordinals has uncountable cofinality, such that U has a Σ n end extension for each n ∈ ω. It is shown in Theorem 1.1 that there is such a model which has no elementary end extension. In the process some interesting facts about topless end extensions (those with no least new ordinal) are uncovered, for example Theorem 2.1: If U is a well-founded model of ZFC, such that U has (...) uncountable cofinality and U has a topless Σ 3 end extension, then U has a topless elementary end extension and also a well-founded elementary end extension, and contains ordinals which are (in U) highly hyperinaccessible. In § 3 related results are proved for κ-like models (κ any regular cardinal) which need not be well founded. As an application a soft proof is given of a theorem of Schmerl on the model-theoretic relation κ → λ. (The author has been informed that Silver had earlier, independently, found a similar unpublished proof of that theorem.) Also, a simpler proof is given of (a generalization of) a characterization by Keisler and Silver of the class of well-founded models which have a Σ n end extension for each n ∈ ω. The case κ = ω 1 is investigated more deeply in § 4, where the problem solved by Theorem 1.1 is considered for non-well-founded models. In Theorems 4.1 and 4.4, ω 1 -like models of ZFC are constructed which have a Σ n end extension for all n ∈ ω but have no elementary end extension. ω 1 -like models of ZFC which have no Σ 3 end extension are produced in Theorem 4.2. The proof uses a notion of satisfaction class, which is also applied in the proof of Theorem 4.6: No model of ZFC has a definable end extension which satisfies ZFC. Finally, Theorem 5.1 generalizes results of Keisler and Morley, and Hutchinson, by asserting that every model of ZFC of countable cofinality has a topless elementary end extension. This contrasts with the rest of the paper, which shows that for well-founded models of uncountable cofinality and for κ-like models with κ regular, topless end extensions are much rarer than blunt end extensions. (shrink)

This paper addresses arguments that “separability” is an assumption of Bell’s theorem, and that abandoning this assumption in our interpretation of quantum mechanics (a position sometimes referred to as “holism”) will allow us to restore a satisfying locality principle. Separability here means that all events associated to the union of some set of disjoint regions are combinations of events associated to each region taken separately.In this article, it is shown that: (a) localised events can be consistently defined without implying separability; (...) (b) the definition of Bell’s locality condition does not rely on separability in any way; (c) the proof of Bell’s theorem does not use separability as an assumption. If, inspired by considerations of non-separability, the assumptions of Bell’s theorem are weakened, what remains no longer embodies the locality principle. Teller’s argument for “relational holism” and Howard’s arguments concerning separability are criticised in the light of these results. Howard’s claim that Einstein grounded his arguments on the incompleteness of QM with a separability assumption is also challenged. Instead, Einstein is better interpreted as referring merely to the existence of localised events. Finally, it is argued that Bell rejected the idea that separability is an assumption of his theorem. (shrink)