This paper, a contribution to “micro set theory”, is the study promised by the first author in [M4], as improved and extended by work of the second. We use the rudimentarily recursive functions and the slightly larger collection of gentle functions to initiate the study of provident sets, which are transitive models of $\mathsf{PROVI}$, a subsystem of $\mathsf{KP}$ whose minimal model is Jensen’s $J_{\omega}$. $\mathsf{PROVI}$ supports familiar definitions, such as rank, transitive closure and ordinal addition—though not ordinal multiplication—and (...) Shoenfield’s unramified forcing. Providence is preserved under directed unions. An arbitrary set has a provident closure, and the extension of a provident $M$ by a set-generic $\mathcal{G}$ is the provident closure of $M\cup\{\mathcal{G}\}$. The improvidence of many models of $\mathsf{Z}$ is shown. The final section uses similar but simpler recursions to show, in the weak system $\mathsf{MW}$, that the truth predicate for $\dot{\varDelta}_{0}$ formulæ is $\Delta_{1}$. (shrink)

Lawson provides a comprehensive look at the history of western thought, the evolution of science and its attempts to provide us with a "theory of everything" and an evaluation of the relativist multiple truths. He discusses why this scientific mind-set no longer works and why relativist truths are no longer sustainable. He then offers a new theory to help us better understand ourselves and our world.

In this article we introduce and study the notion of operational closure: a transitive set d is called operationally closed iff it contains all constants of OST and any operation f∈d applied to an element a∈d yields an element fa∈d, provided that f applied to a has a value at all. We will show that there is a direct relationship between operational closure and stability in the sense that operationally closed sets behave like Σ1 substructures of the universe. (...) This leads to our final result that OST plus the axiom , claiming that any set is element of an operationally closed set, is proof-theoretically equivalent to the system KP+ of Kripke–Platek set theory with infinity and Σ1 separation. We also characterize the system OST plus the existence of one operationally closed set in terms of Kripke–Platek set theory with infinity and a parameter-free version of Σ1 separation. (shrink)

This article aims to provide a structural analysis of the problems related to the easy knowledge problem. The easy knowledge problem is well known. If we accept that we can have basic knowledge via a source without having any prior knowledge about the reliability or accuracy of this source, then we can acquire knowledge about the reliability or accuracy of this source too easily via information delivered by the source. Rejecting any kind of basic knowledge, however, leads into an infinite (...) regress and, plausibly, to skepticism. The article argues that the third alternative, accepting basic knowledge but rejecting easy knowledge, entails closure failure. This is obviously the case for deductive bootstrapping, but, notably, the problem also arises for inductive bootstrapping. Hence, the set of problems related to the easy knowledge problem has the structure of a trilemma. We are forced to accept easy knowledge, closure failure, or skepticism. (shrink)

Endocrinologists apply the idea of feedback loops to explain how hormones regulate certain bodily functions such as glucose metabolism. In particular, feedback loops focus on the maintenance of the plasma concentrations of glucose within a narrow range. Here, we put forward a different, organicist perspective on the endocrine regulation of glycaemia, by relying on the pivotal concept of closure of constraints. From this perspective, biological systems are understood as organized ones, which means that they are constituted of a set (...) of mutually dependent functional structures acting as constraints, whose maintenance depends on their reciprocal interactions. Closure refers specifically to the mutual dependence among functional constraints in an organism. We show that, when compared to feedback loops, organizational closure can generate much richer descriptions of the processes and constraints at play in the metabolism and regulation of glycaemia, by making explicit the different hierarchical orders involved. We expect that the proposed theoretical framework will open the way to the construction of original mathematical models, which would provide a better understanding of endocrine regulation from an organicist perspective. (shrink)

This dissertation examines the general problem of how to give a philosophical account of the nature of representation by looking at three specific philosophies of language and the philosophic treatment of fictional discourse. I argue that Edmund Husserl, Ludwig Wittgenstein, and J. L. Austin all try to give accounts of meaning by arguing for what I call a "closure of meaning" in language. The closure thesis is the claim that some set of criteria can exhaustively determine the ways (...) in which language can be meaningful. This thesis is implicit in Husserl's theory of expressive meaning in the Logical Investigations, in Wittgenstein's picture theory, and in J. L. Austin's pragmatic account of meaning in speech act theory. My general thesis is that the three philosophers in question do not successfully defend the closure thesis for linguistic representation. Since fictional discourse is a source of counterexamples to the closure thesis, I look specifically at two recent philosophical accounts of fiction by David Lewis and John Searle. I criticize these attempts to account for fictional discourse within referential and pragmatic theories of language. Since such attempts are usually part of a closure thesis, my discussion of fiction provides further reasons for doubting the general possibility of accounting for a closure of meaning in language. (shrink)

This collection of essays examines the ways in which disputes and controversies about the application of scientific knowledge are resolved. Four concrete examples of public controversy are considered in detail: the efficacy of Laetrile, the classification of homosexuality as a disease, the setting of safety standards in the workplace, and the utility of nuclear energy as a source of power. The essays in this volume show that debates about these cases are not confined to matters of empirical fact. Rather, as (...) is seen with most scientific and technical controversies, they focus on and are structured by complex ethical, economic, and political interests. Drs. Engelhardt and Caplan have brought together a distinguished group of scholars from the sciences and humanities, who sketch a theory of scientific controversy and attempt to provide recommendations about the ways in which both scientists and the public ought to seek more informed resolutions of highly contentious issues in science and technology. Scientific Controversies is offered as a contribution to the better understanding of the roles of both science and nonscientific interests in disputes and controversies pertaining to science and technology. (shrink)

This paper is closely related to investigations of abstract properties of basic logical notions expressible in terms of closure spaces as they were begun by A. Tarski (see [6]). We shall prove many properties of -conjunctive closure spaces (X is -conjunctive provided that for every two elements of X their conjunction in X exists). For example we prove the following theorems:1. For every closed and proper subset of an -conjunctive closure space its interior is empty (i.e. it (...) is a boundary set). 2. If X is an -conjunctive closure space which satisfies the -compactness theorem and [X] is a meet-distributive semilattice (see [3]), then the lattice of all closed subsets in X is a Heyting lattice. 3. A closure space is linear iff it is an -conjunctive and topological space. 4. Every continuous function preserves all conjunctions. (shrink)

Philosophers of science often assume that logically equivalent theories are theoretically equivalent. I argue that two theses, anti-exceptionalism about logic (which says, roughly, that logic is not a priori, that it is revisable, and that it is not special or set apart from other human inquiry) and logical realism (which says, roughly, that differences in logic reflect genuine metaphysical differences in the world), make trouble for both this commitment and the closely related commitment to theories being closed under logical consequence. (...) I provide three arguments. The first two show that anti-exceptionalism about logic provides an epistemic challenge to both the closure and the equivalence claims; the third shows that logical realism provides a metaphysical challenge to both the closure and the equivalence claims. Along the way, I show that there are important methodological upshots for metaphysicians and philosophers of logic. In particular, there are lessons to be drawn about certain conceptions of naturalism as constraining the possibilities for metaphysics and the philosophy of logic. (shrink)

The basic methodology of rough set theory depends on an equivalence relation induced from the generated partition by the classification of objects. However, the requirements of the equivalence relation restrict the field of applications of this philosophy. To begin, we describe two kinds of closure operators that are based on right and left adhesion neighbourhoods by any binary relation. Furthermore, we illustrate that the suggested techniques are an extension of previous methods that are already available in the literature. As (...) a result of these topological techniques, we propose extended rough sets as an extension of Pawlak’s models. We offer a novel topological strategy for making a topological reduction of an information system for COVID-19 based on these techniques. We provide this medical application to highlight the importance of the offered methodologies in the decision-making process to discover the important component for coronavirus infection. Furthermore, the findings obtained are congruent with those of the World Health Organization. Finally, we create an algorithm to implement the recommended ways in decision-making. (shrink)

We consider all combinatorially possible systems corresponding to subsets of finite set theory (i.e., Zermelo-Fraenkel set theory without the axiom of infinity) and for each of them either provide a well-founded locally finite graph that is a model of that theory or show that this is impossible. To that end, we develop the technique of axiom closure of graphs.

This is the first in a series of papers on Predicative Algebraic Set Theory, where we lay the necessary groundwork for the subsequent parts, one on realizability [B. van den Berg, I. Moerdijk, Aspects of predicative algebraic set theory II: Realizability, Theoret. Comput. Sci. . Available from: arXiv:0801.2305, 2008], and the other on sheaves [B. van den Berg, I. Moerdijk, Aspects of predicative algebraic set theory III: Sheaf models, 2008 ]. We introduce the notion of a predicative category with small (...) maps and show that it provides a sound and complete semantics for constructive set theories like IZF and CZF. The main technical contribution of this paper is that it shows in detail that such categories can always be conservatively embedded in categories that are exact. These exactness properties play a crucial rôle in showing that predicative categories with small maps contain models of set theory and that they are closed under sheaves and realizability. We will prove the former statement in this paper as well, leaving a proof of the closure properties to the papers on realizability and sheaves as mentioned above. (shrink)

Structured argumentation formalisms, such as ASPIC +, offer a formal model of defeasible reasoning. Usually such formalisms are highly parametrized and modular in order to provide a unifying framework in which different forms of reasoning can be expressed. This generality comes at the price that, in their most general form, formalisms such as ASPIC + do not satisfy important rationality postulates, such as non-interference. Similarly, links to other forms of knowledge representation, such as reasoning with maximal consistent sets of rules, (...) are insufficiently studied for ASPIC + although such links have been established for other, less complex forms of structured argumentation where defeasible rules are absent. Clearly, for a formal model of defeasible reasoning it is important to understand for which range of parameters the formalism displays a behavior that adheres to common standards of consistency, logical closure and logical relevance and can be adequately described in terms of other well-known forms of knowledge representation. In this paper we answer this question positively for a fragment of ASPIC + without the attack form undercut by showing that it satisfies all standard rationality postulates of structured argumentation under stable and preferred semantics and is adequate for reasoning with maximal consistent sets of defeasible rules. The study is general in that we do not impose any other requirements on the strict rules than to be contrapositable and propositional and in that we also consider priorities among defeasible rules, as long as they are ordered by a total preorder and lifted by weakest link. In this way we generalize previous similar results for other structured argumentation frameworks and so shed further light on the close relations between assumption-based argumentation and ASPIC +. (shrink)

A finitary characterization for non-well-founded sets with finite transitive closure is established in terms of a greatest fixpoint formula of the modal μ-calculus. This generalizes the standard result in the literature where a finitary modal characterization is provided only for wellfounded sets with finite transitive closure. The proof relies on the concept of automaton, leading then to new interlinks between automata theory and non-well-founded sets.

The topological structures imposed on the collection of binary relations on a given set by the symmetric difference metric and the Hausdorff metric provide opportunities for learning about how collections of binary relations with various properties fit into the collection of all binary relations. For example, there is some agreement and some disagreement between conclusions drawn about the rarity of certain properties of binary relations using first the symmetric difference metric and then the Hausdorff metric.

It is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic. The standard view is that the significance of these equivalences lies in the set existence principles that are necessary and sufficient to prove those theorems. In this article I analyse the role of set existence principles in reverse mathematics, and argue that they are best understood as closure conditions on the powerset (...) of the natural numbers. (shrink)

Constructive set theory a' la Myhill-Aczel has been extended in (Cantini and Crosilla 2008, Cantini and Crosilla 2010) to incorporate a notion of (partial, non--extensional) operation. Constructive operational set theory is a constructive and predicative analogue of Beeson's Inuitionistic set theory with rules and of Feferman's Operational set theory (Beeson 1988, Feferman 2006, Jaeger 2007, Jaeger 2009, Jaeger 1009b). This paper is concerned with an extension of constructive operational set theory (Cantini and Crosilla 2010) by a uniform operation of Transitive (...) Closure, \tau. Given a set a, \tau produces its transitive closure \tau a. We show that the theory ESTE of (Cantini and Crosilla 2010) augmented by \tau is still conservative over Peano Arithmetic. (shrink)

In this paper, notions of fuzzy closure system and fuzzy closure L—system on L—ordered sets are introduced from the fuzzy point of view. We first explore the fundamental properties of fuzzy closure systems. Then the correspondence between fuzzy closure systems and fuzzy closure operators is established. Finally, we study the connections between fuzzy closure systems and fuzzy Galois connections. © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Closure principles loom large in recent internalist critiques of epistemic externalism. Cohen (Philos Phenomenol Res 65:309–329, 2002, Philos Phenomenol Res 70:417–430, 2005), Vogel (J Philos 97:602–623, 2000), and Fumerton (Meta-Epistemology and skepticism. Rowman and Littlefield, Lanham, 1995) argue that, given closure, epistemic externalism is committed to the possibility of implausibly easy knowledge. By contrast, Zalabardo (Philos Rev 114:33–61, 2005) proposes that epistemic closure actually precludes the possibility of easy knowledge, and appeals to closure principles to solve (...) the problem of easy knowledge. In my view, disagreement over closure’s bearing on externalism and the problem of easy knowledge is rooted in a failure to bear in mind the familiar distinction between ex ante and ex post forms of epistemic justification and warrant. When this distinction is kept in focus, the result is clear: epistemic closure provides no relief from the problem of easy knowledge. (shrink)

This paper provides an account of the closure conditions that apply to sets of subvening and supervening properties, showing that the criterion that determines under which property-forming operations a particular family of properties is closed is applicable both to the finitary and to the infinitary case. In particular, it will be established that, contra Glanzberg, infinitary operations do not give rise to any additional difficulties beyond those that arise in the finitary case.

We report the results of four empirical studies designed to investigate the extent to which an epistemic closure principle for knowledge is reflected in folk epistemology. Previous work by Turri (2015a) suggested that our shared epistemic practices may only include a source-relative closure principle—one that applies to perceptual beliefs but not to inferential beliefs. We argue that the results of our studies provide reason for thinking that individuals are making a performance error when their knowledge attributions and denials (...) conflict with the closure principle. When we used research materials that overcome what we think are difficulties with Turri’s original materials, we found that participants did not reject closure. Furthermore, when we presented Turri’s original materials to non-philosophers with expertise in deductive reasoning (viz., professional mathematicians), they endorsed closure for both perceptual and inferential beliefs. Our results suggest that an unrestricted closure principle—one that applies to all beliefs, regardless of their source—provides a better model of folk patterns of knowledge attribution than a source-relative closure principle. (shrink)

Recent work has considered the problem of extending to the case of iterated belief change the so-called `Harper Identity' (HI), which defines single-shot contraction in terms of single-shot revision. The present paper considers the prospects of providing a similar extension of the Levi Identity (LI), in which the direction of definition runs the other way. We restrict our attention here to the three classic iterated revision operators--natural, restrained and lexicographic, for which we provide here the first collective characterisation in the (...) literature, under the appellation of `elementary' operators. We consider two prima facie plausible ways of extending (LI). The first proposal involves the use of the rational closure operator to offer a `reductive' account of iterated revision in terms of iterated contraction. The second, which doesn't commit to reductionism, was put forward some years ago by Nayak et al. We establish that, for elementary revision operators and under mild assumptions regarding contraction, Nayak's proposal is equivalent to a new set of postulates formalising the claim that contraction by ¬A should be considered to be a kind of `mild' revision by A. We then show that these, in turn, under slightly weaker assumptions, jointly amount to the conjunction of a pair of constraints on the extension of (HI) that were recently proposed in the literature. Finally, we consider the consequences of endorsing both suggestions and show that this would yield an identification of rational revision with natural revision. We close the paper by discussing the general prospects for defining iterated revision in terms of iterated contraction. (shrink)

ABSTRACT Pediatric psychologists have much to contribute to growing efforts to mitigate the impact of parent mental and behavioral health problems on children’s health and development. However, providing parent-focused psychological services within the pediatric setting brings many new ethical considerations and challenges. Guided by the American Psychological Association’s Ethics Code, this paper presents an ethical case for providing these types of services, followed by a comprehensive analysis of the unique ethical challenges likely to be encountered when doing so. Recommendations are (...) offered to support the ethical delivery of parent-focused psychological services in pediatric settings. (shrink)

Call a set A n-correctable if every set Turing reducible to A via a Turing machine that on any input makes at most n queries is Turing reducible to A via a Turing machine that on any input makes at most n-queries and on any input halts no matter what answers are given to its queries. We show that if a c.e. set A is n-correctable for some n ≥ 2, then it is n-correctable for all n. We show that (...) this is the optimal such result by constructing a c.e. set that is 1-correctable but not 2-correctable. The former result is obtained by examining the logical closure properties of c.e. sets that are 2-correctable. (shrink)

Around the world, many schools were closed as one of the measures to contain the spread of the COVID-19 pandemic. School closure brought about important challenges to the students' learning process. This context requires strong self-regulatory competences and agency for autonomous learning. Moreover, online remote learning was the main alternative response to classroom learning, which increased the inequalities between students with and without access to technological resources or for those with low digital literacy. All considered, to level the playing (...) field for students without digital resources, there is an urgent need to promote self-regulatory competences through offline intervention solutions. The current paper describes a project with this purpose, using radio broadcasting and letters to reach elementary students without digital resources. Moreover, potential reach and participants' perspectives of the project implementation are presented and discussed. The project draws on a prior evidence-based story-tool intervention grounded on a self-regulated learning framework. The original intervention was set previous to the COVID-19 pandemic and was implemented in the classroom context (N= 1,103 students). Once the schools had been closed down, the mode of intervention was adapted with the collaboration of the community. Alternative solutions were developed as follows: (i) story chapters were read on the radio and students received to their homes a printed script, prompting reflection, and suggesting related activities; (ii) students were provided with the story-tool to read autonomously and received letters from the main characters of the story which included, for example, suggestions for activities and reflection. These two alternative modes of intervention delivery potentially reached 394 elementary students, including students with digital resources. Interviews conducted with a group of students were provided information about the positive aspects of these two modes of intervention delivery, perceived learning (e.g., planning), constraints, and suggestions to improve the project. The current work is likely to merit attention from researchers and educational practitioners, given the need to use offline alternatives to provide support for students without digital resources to engage in autonomous learning during the pandemic period. This project may also be used as an alternative or a complementary solution to online modality. (shrink)

How should the contrastivist formulate closure? That is, given that knowledge is a ternary contrastive state Kspq (s knows that p rather than q), how does this state extend under entailment? In what follows, I will identify adequacy conditions for closure, criticize the extant invariantist and contextualist closure schemas, and provide a contrastive schema based on the idea of extending answers. I will conclude that only the contrastivist can adequately formulate closure.

This is an encyclopedia article about epistemic closure principles. The article explains what they are, their various philosophical uses, how they are argued for or against, and provides an overview of the related literature.

In this article, I define and then defend the principle of information closure (pic) against a sceptical objection similar to the one discussed by Dretske in relation to the principle of epistemic closure. If I am successful, given that pic is equivalent to the axiom of distribution and that the latter is one of the conditions that discriminate between normal and non-normal modal logics, a main result of such a defence is that one potentially good reason to look (...) for a formalization of the logic of “ $S$ is informed that $p$ ” among the non-normal modal logics, which reject the axiom, is also removed. This is not to argue that the logic of “ $S$ is informed that $p$ ” should be a normal modal logic, but that it could still be insofar as the objection that it could not be, based on the sceptical objection against pic, has been removed. In other word, I shall argue that the sceptical objection against pic fails, so such an objection provides no ground to abandon the normal modal logic B (also known as KTB) as a formalization of “ $S$ is informed that $p$ ”, which remains plausible insofar as this specific obstacle is concerned. (shrink)

Physicalism is the idea that everything either is physical or is nothing over and above the physical. For this formulation of physicalism to have determinate content, it should be identified what the “physical” refers to; i.e. the body problem. Some other closely related theses, especially the ones employed in the causal arguments for different versions of physicalism, and more especially the causal closure thesis, are also subject to the body problem. In this paper, I do two things. First, I (...) explore the structure of causal arguments for physicalism that represents a general argument. To do this, the premises and the conclusion of the general argument are given exact formulations. Second, drawing on those premises, especially the causal closure thesis, I propose a naturalistic formulation of the physical that satisfies the requirements any formulation of the physical is expected to fulfill. Following this proposal, we also have a recursive algorithm to recognize the set of all physical events. (shrink)

According to a popular closure principle for epistemic justification, if one is justified in believing each of the premises in set Φ and one comes to believe that ψ on the basis of competently deducing ψ from Φ—while retaining justified beliefs in the premises—then one is justified in believing that ψ. This principle is prima facie compelling; it seems to capture the sense in which competent deduction is an epistemically secure means to extend belief. However, even the single-premise version (...) of this closure principle is in conflict with certain seemingly good inferences involving the epistemic possibility modal ♢. According to other compelling principles concerning competent deduction and epistemic justification, one can competently infer ¬♢φ from ¬φ in deliberation even though there are cases in which one can justifiably believe ¬φ but would be unjustified in believing ¬♢φ. Thus, as we argue, philosophers must choose between unrestricted closure for justification and the validity of these other principles. (shrink)

K-axiom-based epistemic closure for explicit knowledge is rejected for even the most trivial cases of deductive inferential reasoning on account of the fact that the closure axiom does not extend beyond a raw consequence relation. The recognition that deductive inference concerns interaction as much as it concerns consequence allows for perspectives from logics of multi-agent information flow to be refocused onto mono-agent deductive reasoning. Instead of modeling the information flow between different agents in a communicative or announcement setting, (...) we model the information flow between different states of a single agent as that agent reasons deductively. The resource management of the database of agent states for the deductive reasoning fragment in question is covered by the residuated structure that encodes the nonassociative Lambek Calculus with permutation, bottom, and identity: NLP01. (shrink)

Dretske’s theory of self-knowledge is interesting but peculiar and can seem implausible. He denies that we can know by introspection that we have thoughts, feelings, and experiences. But he allows that we can know by introspection what we think, feel, and experience. We consider two puzzles. The first puzzle, PUZZLE 1, is interpretive. Is there a way of understanding Dretske’s theory on which the knowledge affirmed by its positive side is different than the knowledge denied by its negative side? The (...) second puzzle, PUZZLE 2, is substantive. Each of the following theses has some prima facie plausibility: there is introspective knowledge of thoughts, knowledge requires evidence, and there are no experiences of thoughts. It is unclear, though, that these claims form a consistent set. These puzzles are not unrelated. Dretske’s theory of self-knowledge is a potential solution to PUZZLE 2 in that Dretske’s theory is meant to show how,, and can all be true. We provide a solution to PUZZLE 1 by appeal to Dretske’s early work in the philosophy of language on contrastive focus. We then distinguish between “Closure” and “Transmissibility”, and raise and answer a worry to the effect that Dretske’s theory of self-knowledge runs counter to Transmissibility. These results help to secure Dretske’s theory as a viable solution to PUZZLE 2. (shrink)

Information processing in neural systems can be described and analysed at multiple spatiotemporal scales. Generally, information at lower levels is more fine-grained but can be coarse-grained at higher levels. However, only information processed at specific scales of coarse-graining appears to be available for conscious awareness. We do not have direct experience of information available at the scale of individual neurons, which is noisy and highly stochastic. Neither do we have experience of more macro-scale interactions, such as interpersonal communications. Neurophysiological evidence (...) suggests that conscious experiences co-vary with information encoded in coarse-grained neural states such as the firing pattern of a population of neurons. In this article, we introduce a new informational theory of consciousness: Information Closure Theory of Consciousness (ICT). We hypothesise that conscious processes are processes which form non-trivial informational closure (NTIC) with respect to the environment at certain coarse-grained scales. This hypothesis implies that conscious experience is confined due to informational closure from conscious processing to other coarse-grained scales. ICT proposes new quantitative definitions of both conscious content and conscious level. With the parsimonious definitions and a hypothesise, ICT provides explanations and predictions of various phenomena associated with consciousness. The implications of ICT naturally reconcile issues in many existing theories of consciousness and provides explanations for many of our intuitions about consciousness. Most importantly, ICT demonstrates that information can be the common language between consciousness and physical reality. (shrink)

In this paper, we advocate the idea that an adequate explanation of biological systems requires appealing to organizational closure as an emergent causal regime. We first develop a theoretical justification of emergence in terms of relatedness, by arguing that configurations, because of the relatedness among their constituents, possess ontologically irreducible properties, providing them with distinctive causal powers. We then focus on those emergent causal powers exerted as constraints, and we claim that biological systems crucially differ from other natural systems (...) in that they realize a closure of constraints, i.e. a second-order emergent regime of causation such that the constituents, each of them acting as a constraint, realize a mutual dependence among them, and are collectively able to self-maintain. Lastly, we claim that closure can be justifiably taken as an emergent regime of causation, without admitting that it inherently involves whole-parts causation, which would require to commit to stronger ontological and epistemological assumptions. (shrink)

Rough set theory is an excellent mathematical tool for the analysis of a vague description of actions in decision problems. Now, in this paper by considering the notion of an equality algebra, the notion of the lower and the upper approximations are introduced and some properties of them are given. Moreover, it is proved that the lower and the upper approximations define an interior operator and a closure operator, respectively. Also, using D-lower and D-upper approximation, conditions for a nonempty (...) subset to be definable are provided and investigated that under which condition D-lower and D-upper approximation can be filter. (shrink)

In ”Skepticism,” Peter Klein distinguishes between the “Academic Skeptic” who proposes that we cannot have knowledge of a certain set of propositions and the “Pyrrhonian Skeptic” who refrains from opining about whether we can have knowledge. Klein argues that Academic Skepticism is plausibly supported by a “Closure Principle‐style” argument based on the claim that if x entails y and S has justification for x, then S has justification for y. He turns to contextualism to see if it can contribute (...) to the discussion between one who claims that we can have knowledge about some epistemically interesting class of propositions and the Academic Skeptic. He outlines the background of Pyrrhonian Skepticism, pointing out that the Pyrrhonist withholds assent concerning our knowledge‐bearing status because reason cannot provide an adequate basis for assent. He assesses three possible patterns of reasoning, and concludes that the Pyrrhonist view, that reason cannot resolve matters concerning the nonevident, is vindicated. (shrink)

According to the principle of Conjunction Closure, if one has justification for believing each of a set of propositions, one has justification for believing their conjunction. The lottery and preface paradoxes can both be seen as posing challenges for Closure, but leave open familiar strategies for preserving the principle. While this is all relatively well-trodden ground, a new Closure-challenging paradox has recently emerged, in two somewhat different forms, due to Backes :3773–3787, 2019a) and Praolini :715–726, 2019). This (...) paradox synthesises elements of the lottery and the preface and is designed to close off the familiar Closure-preserving strategies. By appealing to a normic theory of justification, I will defend Closure in the face of this new paradox. Along the way I will draw more general conclusions about justification, normalcy and defeat, which bear upon what Backes :2877–2895, 2019b) has dubbed the ‘easy defeat’ problem for the normic theory. (shrink)

It appears that there is an inconsistency in combining epistemic contextualism with a plausible closure principle for knowledge and the view that knowledge is factive. I discuss the proposal that in order to avoid inconsistency the contextualist should reject closure and retain factivity. The proposal offers an alternative to closure and an argument that warrant fails to transmit through inference in the relevant cases. I criticize both accounts. The proposed alternative to closure is not well motivated (...) and leaves unresolved the question of why standard closure should not hold. The argument that warrant does not transmit is based on an inaccurate model of warrant transmission. An important lesson that emerges is that known propositions themselves can serve as warrant for further propositions, which may be known provided they are competently deduced from the former. Indeed it is arguably the factivity of knowledge that accounts for the fact that known propositions themselves serve as warrant. Thus, the strategy of rejecting closure while retaining factivity is a bad one not merely because the proposed alternatives to standard closure are inadequate and transmission failure in relevant cases would not imply closure failure, but because factivity ensures that warrant transmission worries in the relevant cases are unfounded. (shrink)

When a group of processes achieves such closure that a set of states of affairs recurs continually, then the effect of that coherence on the world differs from what would occur in the absence of that closure. Such altered effectiveness is an attribute of the system as a whole, and would have consequences. This indicates that the network of processes, as a unit, has ontological significance. Whenever a network of processes generates continual return to a limited set of (...) states of affairs, the system may function as a “whole”— with respect to appropriate interaction partners. The balance achieved by the processes provides the form of definiteness of a unified agent. The causal powers of such coherent aggregates are indeed just the powers of the “constituents acting in concert”. However, the components act in concert in the specific way they do only because of their inclusion in the closed set of interactions that defines the coherence. This renders the causal powers of the coherence defined by that closure non-redundant, and hence the coherence, as a unit, is ontologically significant. The form of definiteness that provides internal coherence also grounds external efficacy of the societal aggregation. The closure is a structural feature of the coherence — possibly, but not necessarily, apparent in spatial structuring. This approach can provide a unified account that includes quantum microphysics, systems biology, and the philosophy of organism ─ without reducing any of these to another. (shrink)

Dorsal closure (DC), the closure of a hole in the dorsal epidermis of Drosophila embryos by the joining of opposing epithelial cell sheets, has been used as a model process to study the molecular and cellular mechanisms underlying epithelial spreading and wound healing. Recent studies have provided novel insights into how different tissues function cooperatively in this process. Specifically, they demonstrate a critical function of the epidermis surrounding the hole in modulating the behavior of the amnioserosa cells inside. (...) These findings shed light not only on the mechanisms by which the behavior of different tissues is coordinated during DC, but also on the general mechanisms by which tissues interact to trigger global morphogenesis, an essential but yet poorly explored aspect of embryogenesis. (shrink)

Single-premise epistemic closure is the principle that: if one is in an evidential position to know that P where P entails Q, then one is in an evidential position to know that Q. In this paper, I defend the viability of opposition to closure. A key task for such an opponent is to precisely formulate a restricted closure principle that remains true to the motivations for abandoning unrestricted closure but does not endorse particularly egregious instances of (...) closure violation. I focus on two brands of epistemic theory that naturally incorporate closure restrictions. The first type holds that the truth value of a knowledge ascription is relative to a relevant question. The second holds that the truth value of a knowledge ascription is relative to a relevant topic. For each approach, I offer a formalization of a leading theory from the literature and use this formalization to evaluate the theory’s adequacy in terms of a precise set of desiderata. I conclude that neither theory succeeds in meeting these desiderata, casting doubt on the viability of the underlying approaches. Finally, I offer a novel variant of the topic-sensitive approach that fares better. (shrink)

Background: Little is known about U.S. healthcare provider views and practices regarding evidence, counseling, and shared decision-making about in-hospital versus out-of-hospital birth settings. Methods: We conducted 19 in-depth, semistructured, qualitative interviews of eight obstetricians, eight midwives, and three pediatricians from across the United States. Interviews explored healthcare providers’ interpretation of the current evidence and their personal and professional experiences with childbirth within the existing medical, ethical, and legal context in the United States. Results: Themes emerged concerning risks and benefits, decision-making, (...) and patient-provider power dynamics. Collectively, the narratives illuminated fundamental ideological tensions between in- and out-of-hospital providers arising from divergent assignment of value to described risks and benefits. The majority of physicians focused on U.S.-specific data demonstrating increased neonatal morbidity and mortality associated with delayed access to hospital-based interventions, thereby justifying hospital birth as the standard of care. By contrast, midwives emphasized data demonstrating fewer interventions and superior maternal and neonatal outcomes in high-income European countries, where out-of-hospital birth is more common for low-risk birthing people. A key gap in counseling was revealed, as no interviewees offered anticipatory counseling regarding birth setting options. Providers directly and indirectly illustrated the propensity for asymmetric power relations between birth providers and pregnant people, especially in hospital settings. Conclusions: The narratives highlight the common goal of optimizing maternal and neonatal outcomes despite tensions arising from divergent prioritization of specific maternal and neonatal risks. Our findings suggest opportunities to foster collaboration and optimize outcomes via mutual respect and improved integration of care. (shrink)

I argue that we should solve the Lottery Paradox by denying that rational belief is closed under classical logic. To reach this conclusion, I build on my previous result that (a slight variant of) McGee’s election scenario is a lottery scenario (see Lissia 2019). Indeed, this result implies that the sensible ways to deal with McGee’s scenario are the same as the sensible ways to deal with the lottery scenario: we should either reject the Lockean Thesis or Belief Closure. (...) After recalling my argument to this conclusion, I demonstrate that a McGee-like example (which is just, in fact, Carroll’s barbershop paradox) can be provided in which the Lockean Thesis plays no role: this proves that denying Belief Closure is the right way to deal with both McGee’s scenario and the Lottery Paradox. A straightforward consequence of my approach is that Carroll’s puzzle is solved, too. (shrink)

The problem of closure for the traditional unstructured possible worlds model of attitudinal content is that it treats belief and other cognitive states as closed under entailment, despite apparent counterexamples showing that this is not a necessary property of such states. One solution to this problem, which has been proposed recently by several authors (Schaffer 2005; Yalcin 2018; Hoek forthcoming), is to restrict closure in an unstructured setting by treating propositional attitudes as question-sensitive. Here I argue that this (...) line of response is unsatisfying as it stands because the problem of closure is more general than is typically discussed. A version of the problem recurs for attitudes like wondering, entertaining, considering, and so on, which are directed at questions rather than propositions. For such questioning attitudes, the appeal to question-sensitivity is much less convincing as a solution to the problem of closure. (shrink)

The author considers the model-theoretic character of proofs and disproofs by means of attempted counterexample constructions, distinguishes this proof format from formal derivations, then contrasts two approaches to semantic tableaux proposed by Beth and Lambert-van Fraassen. It is noted that Beth's original approach has not as yet been provided with a precisely formulated rule of closure for detecting tableau sequences terminating in contradiction. To remedy this deficiency, a technique is proposed to clarify tableau operations.