Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,f(7)]. Let B denote the system of equations: {x_j!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. The system of equations {x_1!=x_1, x_1 \cdot x_1=x_2, x_2!=x_3, x_3!=x_4, x_4!=x_5, x_5!=x_6, x_6!=x_7, x_7!=x_8, x_8!=x_9} has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a (...) finite number of solutions in positive integers x_1,...,x_9 has a solution (x_1,...,x_9)∈(N\{0})^9 satisfying max(x_1,...,x_9)>f(9). For every known system S⊆B, if the finiteness/infiniteness of the set {(x_1,...,x_9)∈(N\{0})^9: (x_1,...,x_9) solves S} is unknown, then the statement ∃ x_1,...,x_9∈N\{0} ((x_1,...,x_9) solves S)∧(max(x_1,...,x_9)>f(9)) remains unproven. Let Λ denote the statement: if the system of equations {x_2!=x_3, x_3!=x_4, x_5!=x_6, x_8!=x_9, x_1 \cdot x_1=x_2, x_3 \cdot x_5=x_6, x_4 \cdot x_8=x_9, x_5 \cdot x_7=x_8} has at most finitely many solutions in positive integers x_1,...,x_9, then each such solution (x_1,...,x_9) satisfies x_1,...,x_9≤f(9). The statement Λ is equivalent to the statement Φ. It heuristically justifies the statement Φ . This justification does not yield the finiteness/infiniteness of P(n^2+1). We present a new heuristic argument for the infiniteness of P(n^2+1), which is not based on the statement Φ. Algorithms always terminate. We explain the distinction between existing algorithms (i.e. algorithms whose existence is provable in ZFC) and known algorithms (i.e. algorithms whose definition is constructive and currently known). Assuming that the infiniteness of a set X⊆N is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. *** (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. *** Conditions (2)-(5) hold for X=P(n^2+1). The statement Φ implies Condition (1) for X=P(n^2+1). The set X={n∈N: the interval [-1,n] contains more than 29.5+\frac{11!}{3n+1}⋅sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. 501893∈X. Condition (1) holds with n=501893. card(X∩[0,501893])=159827. X∩[501894,∞)= {n∈N: the interval [-1,n] contains at least 30 primes of the form k!+1}. We present a table that shows satisfiable conjunctions of the form #(Condition 1) ∧ (Condition 2) ∧ #(Condition 3) ∧ (Condition 4) ∧ #(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove this assumption. (shrink)

K denotes both the knowledge predicate satisfied by every currently known theorem and the finite set of all currently known theorems. The set K is time-dependent, publicly available, and contains theorems both from formal and constructive mathematics. Any theorem of any mathematician from past or present forever belongs to K. Mathematical statements with known constructive proofs exist in K separately and form the set K_c⊆K. We assume that mathematical sets are atemporal entities. They exist formally in ZFC theory although their (...) properties can be time-dependent (when they depend on K) or informal. The true statement "K is non-empty" is outside K forever because K is not a formal set. Paul Cohen proved in 1963 that the equality 2^{\aleph_0}=\aleph_1 is independent of ZFC. Before 1963, the statement "There is a known constructively defined integer n⩾1 such that 2^{\aleph_0}=\aleph_n" was outside K. Since 1963, this statement is outside K forever. The true statement "There exists a set X⊆{1,...,49} such that card(X)=6 and X never occurred as the winning six numbers in the Polish Lotto lottery" refers to the current non-mathematical knowledge and is outside K forever. In Martin-Löf's terminology, every currently known theorem is actually true whereas every theorem (known or unknown) is potentially true. Actual truth is knowledge dependent and tensed. Potential truth is knowledge independent and tenseless. Algorithms always terminate. We explain the distinction between algorithms whose existence is provable in ZFC and constructively defined algorithms which are currently known. By using this distinction, we obtain non-trivially true statements on decidable sets X⊆N that belong to constructive and informal mathematics and refer to the current mathematical knowledge on X. For every such statement, its truth concerning the current mathematical knowledge is implied by a true statement of the form: (the conjunction of i conditions of the form α∈K)∧(the conjunction of j conditions of the form β∉K)∧(the conjunction of k conditions of the form γ∈K_c)∧(the conjunction of l conditions of the form δ∉K_c), where i,j,k,l∈N and α,β,γ,δ are mathematical statements. In constructive mathematics and the traditional Brouwerian intuitionism, the truth of a mathematical statement means that we know a constructive proof. Therefore, the truth of a mathematical statement depends on time, where the statement is formally stated in the classical mathematics without the predicate K. In this article, mathematical statements on decidable sets X⊆N refer to time because they refer to the current mathematical knowledge on X. They cannot be formally stated in the classical mathematics without the predicate K and their logical values may change in time. For a set X⊆N whose infiniteness is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(X)=ω" is outside K. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove the assumption of the above statement. We prove that the set X={n∈N: the interval [-1,n] contains more than 29.5+(11!/(3n+1))∙sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. We present a table that shows satisfiable conjunctions of the form #(Condition1)∧(Condition 2)∧#(Condition 3)∧(Condition 4)∧#(Condition 5), where # denotes the negation ¬ or the absence of any symbol. We prove that there exists a naturally defined set C⊆N which satisfies the following conditions (6)-(11). (6) A known and simple algorithm for every k∈N decides whether or not k∈C. (7) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(C)=ω" is outside K. (8) For every known algorithm A with no input, the statement "A returns the logical value of the statement card(N\C)=ω" is outside K. (9) It is conjectured, though so far unproven, that C is infinite. (10) For every known algorithm A with no input, the statement "A returns an integer n satisfying card(C)<ω ⇒ C⊆(-∞,n]" is outside K. (11) For every known algorithm A with no input, the statement "A returns an integer m satisfying card(N\C)<ω ⇒ N\C⊆(-∞,m]" is outside K. The set C={k∈N: 2^{2^k}+1 is composite} is naturally defined and satisfies conditions (6)-(11). (shrink)

Looking at the recent spate of claims about “fake news” which appear to be a new feature of political discourse, I argue that fake news presents an interesting problem in epistemology. Te phenomena of fake news trades upon tolerating a certain indiference towards truth, which is sometimes expressed insincerely by political actors. Tis indiference and insincerity, I argue, has been allowed to fourish due to the way in which we have set the terms of the “public” epistemology that maintains what (...) is considered “rational” public discourse. I argue one potential salve to the problem of fake news is to challenge this public epistemology by injecting a certain ethical consideration back into the discourse. (shrink)

Belief in conspiracy theories is typically considered irrational, and as a consequence of this, conspiracy theorists––those who dare believe some conspiracy theory––have been charged with a variety of epistemic or psychological failings. Yet recent philosophical work has challenged the view that belief in conspiracy theories should be considered as typically irrational. By performing an intra-group analysis of those people we call “conspiracy theorists”, we find that the problematic traits commonly ascribed to the general group of conspiracy theorists turn out to (...) be merely a set of stereotypical behaviours and thought patterns associated with a purported subset of that group. If we understand that the supposed prob- lem of belief in conspiracy theories is centred on the beliefs of this purported sub- set––the conspiracists––then we can reconcile the recent philosophical contribu- tions to the wider academic debate on the rationality of belief in conspiracy theories. (shrink)

I develop a cognitive account of how humans make skeptical judgments (of the form “X does not know p”). In my view, these judgments are produced by a special purpose metacognitive "skeptical" mechanism which monitors our reasoning for hasty or overly risky assumptions. I argue that this mechanism is modular and shaped by natural selection. The explanation for why the mechanism is adaptive essentially relies on an internalized principle connecting knowledge and action, a principle central to pragmatic encroachment theories. I (...) end the paper by sketching how we can use the account I develop here to respond to the skeptic. (shrink)

Reasoning from negative evidence takes place where an expected outcome is tested for, and when it is not found, a conclusion is drawn based on the significance of the failure to find it. By using Gricean maxims and implicatures, we show how a set of alternatives, which we call a paradigm, provides the deep inferential structure on which reasoning from lack of evidence is based. We show that the strength of reasoning from negative evidence depends on how the arguer defines (...) his conclusion and what he considers to be in the paradigm of negated alternatives. If we negate only two of the several possible alternatives, even if they are the most probable, the conclusion will be weak. However, if we deny all possible alternatives, the reasoning will be strong, and even in some cases deductively valid. (shrink)

Exclusionary defeat is Joseph Raz’s proposal for understanding the more complex, layered structure of practical reasoning. Exclusionary reasons are widely appealed to in legal theory and consistently arise in many other areas of philosophy. They have also been subject to a variety of challenges. I propose a new account of exclusionary reasons based on their justificatory role, rejecting Raz’s motivational account and especially contrasting exclusion with undercutting defeat. I explain the appeal and coherence of exclusionary reasons by appeal to commonsense (...) value pluralism and the intermediate space of public policies, social roles, and organizations. We often want our choices to have a certain character or instantiate a certain value and in order to do so, that choice can only be based on a restricted set of reasons. Exclusion explains how pro tanto practical reasons can be disqualified from counting towards a choice of a particular kind without being outweighed or undercut. (shrink)

Suppose that we repair a wooden ship by replacing its planks one by one with new ones while at the same time reconstructing it using the discarded planks. Some defenders of vague or indeterminate identity claim that: (1) although the reconstructed ship is distinct from the repaired ship, it is indeterminate whether the original ship is the reconstructed ship and indeterminate whether it is the repaired ship, and (2) the indeterminacy is due to the world and not just an imprecision (...) in the language used to describe the situation. I argue that such a description is incoherent. The argument has two features. First, it differs in spirit from Gareth Evans's more general famous proof against the possibility of indeterminate identity. This is because I rely on facts regarding counting and sets. Second, I focus on Terence Parsons's recent defence of indeterminate identity. I argue that his attempts at making sense of counting objects involving indeterminate identities fail on technical and philosophical grounds. (shrink)

Abstract Most discussions of risk are developed in broadly consequentialist terms, focusing on the outcomes of risks as such. This paper will provide an alternative account of risk from a virtue ethical perspective, shifting the focus to the decision to take the risk. Making ethical decisions about risk is, we will argue, not fundamentally about the actual chain of events that the decision sets in process, but about the reasonableness of the decision to take the risk in the first place. (...) A virtue ethical account of risk is needed because the notion of the ‘reasonableness’ of the decision to take the risk is affected by the complexity of the moral status of particular instances of risk-taking and the risk-taker’s responsiveness to these contextual features. The very idea of ‘reasonable risk’ welcomes judgments about the nature of the risk itself, raises questions about complicity, culpability and responsibility, while at its heart, involves a judgement about the justification of risk which unavoidably focuses our attention on the character of the individuals involved in risk making decisions. Keywords: Risk; ethics; morality; responsibility; virtue; choice; reasons . (shrink)

The essays collected in this special issue explore what legitimacy means for actors and institutions that do not function like traditional states but nevertheless wield significant power in the global realm. They are connected by the idea that the specific purposes of non-state actors and the contexts in which they operate shape what it means for them to be legitimate and so shape the standards of justification that they have to meet. In this introduction, we develop this guiding methodology further (...) and show how the special issue’s individual contributions apply it to their cases. In the first section, we provide a sketch of our purpose-dependent theory of legitimacy beyond the state. We then highlight two features of the institutional context beyond the state that set it apart from the domestic case: problems of feasibility and the structure of international law. (shrink)

The scope of Platonism is extended by introducing the concept of a “Platonic computer” which is incorporated in metacomputics. The theoretical framework of metacomputics postulates that a Platonic computer exists in the realm of Forms and is made by, of, with, and from metaconsciousness. Metaconsciousness is defined as the “power to conceive, to perceive, and to be self-aware” and is the formless, con-tentless infinite potentiality. Metacomputics models how metaconsciousness generates the perceived actualities including abstract entities and physical and nonphysical (...) realities. It is postulated that this is achieved via digital computation using the Platonic computer. The introduction of a Platonic computer into the realm of Forms thus bridges the “inverse explanatory gap” and therefore solves the “inverse hard problem of consciousness” in the philosophy of mind. (shrink)

Roughly, the noetic account characterizes scientific progress in terms of increased understanding. This chapter outlines a version of the noetic account according to which scientific progress on some phenomenon consists in making scientific information publicly available so as to enable relevant members of society to increase their understanding of that phenomenon. This version of the noetic account is briefly compared with four rival accounts of scientific progress, viz. the truthlikeness account, the problem-solving account, the new functional account, and the epistemic (...) account. In addition, the chapter seeks to precisify the question that accounts of scientific progress are (or should be) aiming to answer, viz. “What type of cognitive change with respect to a given topic or phenomenon X constitutes a (greater or lesser degree of) scientific improvement with respect to X?”. (shrink)

Yuri Matiyasevich's theorem states that the set of all Diophantine equations which have a solution in non-negative integers is not recursive. Craig Smoryński's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. Let R be a subring of Q with or without 1. By H_{10}(R), we denote the problem of whether there exists an algorithm which for any given Diophantine equation with integer coefficients, can decide whether (...) or not the equation has a solution in R. We prove that a positive solution to H_{10}(R) implies that the set of all Diophantine equations with a finite number of solutions in R is recursively enumerable. We show the converse implication for every infinite set R \subseteq Q such that there exist computable functions \tau_1,\tau_2:N \to Z which satisfy (\forall n \in N \tau_2(n) \neq 0) \wedge ({\frac{\tau_1(n)}{\tau_2(n)}: n \in N}=R). This implication for R=N guarantees that Smoryński's theorem follows from Matiyasevich's theorem. Harvey Friedman conjectures that the set of all polynomials of several variables with integer coefficients that have a rational solution is not recursive. Harvey Friedman conjectures that the set of all polynomials of several variables with integer coefficients that have only finitely many rational solutions is not recursively enumerable. These conjectures are equivalent by our results for R=Q. (shrink)

Contrary to the widely accepted consensus, Christopher Heath Wellman argues that there are no pre-institutional judicial procedural rights. Thus commonly affirmed rights like the right to a fair trial cannot be assumed in the literature on punishment and legal philosophy as they usually are. Wellman canvasses and rejects a variety of grounds proposed for such rights. I answer his skepticism by proposing two novel grounds for procedural rights. First, a general right against unreasonable risk of punishment grounds rights to an (...) institutionalized system of punishment. Second, to complement and extend the first ground, I more controversially propose a right to provision of the robust good of security. People have a right to others' protecting for avoiding wrongfully harming them: when I take an action that is reasonably expected to threaten the protected interests of others, I must take appropriate care to avoid setting back those interests. Inflicting punishment on someone--intentionally harming them in response to a violation--is prima facie wrongful, so I can only count as taking appropriate care in punishing when I follow familiar procedures that reliably and redundantly test whether they are liable to such punishment, i.e. whether they have forfeited their right against punishment through a culpable act. (shrink)

Rhinoceros beetle (Xylotrupes taprobanes ganesha) Silvestre, 2003 recently recorded from Nilgiri hills,Western Ghats. The distribution of this species were reported from Kerala and Tamil Nadu regions so far here after no works were done in this subspecies distribution so for in this region. This present observation ensure the occurrence of X. Taprobanes Ganesha in the Nilgiris show a light on this species ecological work in this region.

Given any proposition, is it possible to have rationally acceptable attitudes towards it? Absent reasons to the contrary, one would probably think that this should be possible. In this paper I provide a reason to the contrary. There is a proposition such that, if one has any opinions about it at all, one will have a rationally unacceptable set of propositional attitudes—or if one doesn’t, one will end up being cognitively imperfect in some other manner. The proposition I am concerned (...) with is a self-referential propositional attitude ascription involving the propositional attitude of rejection. Given a basic assumption about what constitutes irrationality, and a few assumptions about the nature of cognitively ideal agents, a paradox results. This paradox is superficially like the Liar, but it is importantly different in that no alethic notions are involved at all. As such, it stands independent of the Liar and is not a ‘revenge’ version of it. After setting out the paradox I discuss possible responses. After considering several I argue that one is best off simply accepting that the paradox shows us something surprising and interesting about rationality: that some cognitive shortfall is unavoidable even for ideal agents. I argue that nothing disastrous follows from accepting this conclusion. (shrink)

Conventional wisdom dictates that proofs of mathematical propositions should be treated as necessary, and sufficient, for entailing `significant' mathematical truths only if the proofs are expressed in a---minimally, deemed consistent---formal mathematical theory in terms of: * Axioms/Axiom schemas * Rules of Deduction * Definitions * Lemmas * Theorems * Corollaries. Whilst Andrew Wiles' proof of Fermat's Last Theorem FLT, which appeals essentially to geometrical properties of real and complex numbers, can be treated as meeting this criteria, it nevertheless leaves two (...) questions unanswered: (i) Why is x^n +y^n = z^n solvable only for n < 3 if x, y, z, n are natural numbers? (ii) What technique might Fermat have used that led him to, even if only briefly, believe he had `a truly marvellous demonstration' of FLT? Prevailing post-Wiles wisdom---leaving (i) essentially unaddressed---dismisses Fermat's claim as a conjecture without a plausible proof of FLT. -/- However, we posit that providing evidence-based answers to both queries is necessary not only for treating FLT as significant, but also for understanding why FLT can be treated as a true arithmetical proposition. We thus argue that proving a theorem formally from explicit, and implicit, premises/axioms using rules of deduction---as currently accepted---is a meaningless game, of little scientific value, in the absence of evidence that has already established---unambiguously---why the premises/axioms and rules of deduction can be treated, and categorically communicated, as pre-formal truths in Marcus Pantsar's sense. Consequently, only evidence-based, pre-formal, truth can entail formal provability; and the formal proof of any significant mathematical theorem cannot entail its pre-formal truth as evidence-based. It can only identify the explicit/implicit premises that have been used to evidence the, already established, pre-formal truth of a mathematical proposition. Hence visualising and understanding the evidence-based, pre-formal, truth of a mathematical proposition is the only raison d'etre for subsequently seeking a formal proof of the proposition within a formal mathematical language (whether first-order or second order set theory, arithmetic, geometry, etc.) By this yardstick Andrew Wiles' proof of FLT fails to meet the required, evidence-based, criteria for entailing a true arithmetical proposition. -/- Moreover, we offer two scenarios as to why/how Fermat could have laconically concluded in his recorded marginal noting that FLT is a true arithmetical proposition---even though he either did not (or could not to his own satisfaction) succeed in cogently evidencing, and recording, why FLT can be treated as an evidence-based, pre-formal, arithmetical truth (presumably without appeal to properties of real and complex numbers). It is primarily such a putative, unrecorded, evidence-based reasoning underlying Fermat's laconic assertion which this investigation seeks to reconstruct; and to justify by appeal to a plausible resolution of some philosophical ambiguities concerning the relation between evidence-based, pre-formal, truth and formal provability. (shrink)

Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key factors for the performance of (...) the system. A new heuristic for answer set programming has been developed. This heuristic is inspired by hierarchical planning. The notion of criticality, which was introduced for generating abstraction hierarchies in hierarchical planning, is used in this heuristic. The resulting system (CSMODELS) uses this new heuristic in a static way. CSMODELS is based on the system SMODELS. The experimental results show that this new heuristic is promising for answer set programming. A comparison of search times with SMODELS demonstrate CSMODELS’ usefulness. (shrink)

Background If trials of therapeutic interventions are to serve society's interests, they must be of high methodological quality and must satisfy moral commitments to human subjects. The authors set out to develop a clinical - trials compendium in which standards for the ethical treatment of human subjects are integrated with standards for research methods. Methods The authors rank-ordered the world's nations and chose the 31 with >700 active trials as of 24 July 2008. Governmental and other authoritative entities of the (...) 31 countries were searched, and 1004 English-language documents containing ethical and/or methodological standards for clinical trials were identified. The authors extracted standards from 144 of those: 50 designated as ‘core’, 39 addressing trials of invasive procedures and a 5% sample of the remainder. As the integrating framework for the standards we developed a coherent taxonomy encompassing all elements of a trial's stages. Findings Review of the 144 documents yielded nearly 15 000 discrete standards. After duplicates were removed, 5903 substantive standards remained, distributed in the taxonomy as follows: initiation, 1401 standards, 8 divisions; design, 1869 standards, 16 divisions; conduct, 1473 standards, 8 divisions; analysing and reporting results, 997 standards, four divisions; and post-trial standards, 168 standards, 5 divisions. Conclusions The overwhelming number of source documents and standards uncovered in this study was not anticipated beforehand and confirms the extraordinary complexity of the clinical trials enterprise. This taxonomy of multinational ethical and methodological standards may help trialists and overseers improve the quality of clinical trials, particularly given the globalisation of clinical research. (shrink)

This paper focuses on invasive therapeutic procedures, defined as procedures requiring the introduction of hands, instruments, or devices into the body via incisions or punctures of the skin or mucous membranes performed with the intent of changing the natural history of a human disease or condition for the better. Ethical and methodological concerns have been expressed about studies designed to evaluate the effects of invasive therapeutic procedures. Can such studies meet the same standards demanded of those, for example, evaluating pharmaceutical (...) agents? This paper describes a research project aimed at examining the interplay and sometimes apparent conflict between ethical standards for human research and standards for methodological rigor in trials of invasive procedures. The paper discusses how the authors plan to develop a set of consensus standards that, if met, would result in substantial and much-needed improvements in the methodological and ethical quality of such trials. (shrink)

John Turri gives an example that he thinks refutes what he takes to be “G. E. Moore's view” that omissive assertions such as “It is raining but I do not believe that it is raining” are “inherently ‘absurd'”. This is that of Ellie, an eliminativist who makes such assertions. Turri thinks that these are perfectly reasonable and not even absurd. Nor does she seem irrational if the sincerity of her assertion requires her to believe its content. A commissive counterpart of (...) Ellie is Di, a dialetheist who asserts or believes that The Russell set includes itself but I believe that it is not the case that the Russell set includes itself. Since any adequate explanation of Moore's paradox must handle commissive assertions and beliefs as well as omissive ones, it must deal with Di as well as engage Ellie. I give such an explanation. I argue that neither Ellie's assertion nor her belief is irrational yet both are absurd. Likewise neither Di's assertion nor her belief is irrational yet in contrast neither is absurd. I conclude that not all Moore-paradoxical assertions or beliefs are irrational and that the syntax of Moore's examples is not sufficient for the absurdity found in them. (shrink)

In this paper, we defend Socratic studies as a research programme against several recent attacks, including at least one recently published in Polis . Critics have argued that the study of Socrates, based upon evidence mostly or entirely derived from some set of Plato's dialogues, is founded upon faulty and indefensible historical or hermeneutical technique. We begin by identifying what we believe are the foundational principles of Socratic studies, as the field has been pursued in recent years, and we then (...) show how the research programme that derives from accepting these principles is not defeated by any of the most common recent criticisms of it. Specifically, we argue that challenges to sorting Plato's dialogues by date, more general challenges to historicist interpretations of Plato's dialogues, as well as recent literary criticisms of Socratic studies all fail to undermine the research programme. We conclude with some thoughts about how and why Socratic studies has proved itself a valuable and fruitful research programme. (shrink)

In this paper, we use PCR5 in order to fusion the information of two sources providing subjective probabilities of an event A to occur in the following form: chance that A occurs, indeterminate chance of occurrence of A, chance that A does not occur. -/- .

Interoperability across data sets is a key challenge for quantitative histopathological imaging. There is a need for an ontology that can support effective merging of pathological image data with associated clinical and demographic data. To foster organized, cross-disciplinary, information-driven collaborations in the pathological imaging field, we propose to develop an ontology to represent imaging data and methods used in pathological imaging and analysis, and call it Quantitative Histopathological Imaging Ontology – QHIO. We apply QHIO to breast cancer hot-spot detection with (...) the goal of enhancing reliability of detection by promoting the sharing of data between image analysts. (shrink)

In this paper, a modified form of Collatz conjecture for neutrosophic numbers n ∈ (Z U I) is defined. We see for any n ∈ (Z U I) the related sequence using the formula (3a + 1) + (3b + 1)I converges to any one of the 55 elements mentioned in this paper. Using the akin formula of Collatz conjecture viz. (3a- 1) + (3b -1)I the neutrosophic numbers converges to any one of the 55 elements mentioned with appropriate modifications. (...) Thus, it is conjectured that every n ∈ (Z U I) has a finite sequence which converges to any one of the 55 elements. (shrink)

Although the author's critical view of functionalism has a considerable intuitive pull, his argument based on the color room scenario does not work. Functionalism and other relational views of the mind are capable of providing coherent accounts of conscious experience that meet the challenge set up by the “color room argument.” A simple example of such an account is presented.

Looks into evaluation of information provision probability from different sources, based on use of linguistic variables. Formation of functions appurtenant for its unclear variables provides for adoption of decisions by the decision maker, in conditions of nonprobabilistic equivocation. The development of market relations in Ukraine increases the independence and responsibility of enterprises in justifying and making management decisions that ensure their effective, competitive activities. As a result of the analysis, it is determined that the condition of economic facilities can be (...) described and determined by the decision-maker, in the presence of the necessary information. The confidence of the decision-maker in the information received is different and the decisions made have a correspondingly different level of information risk. It is important to substantiate the procedure for assessing the numerical extent of information risk in decision-making based on the information obtained in conditions of uncertainty. The use of a linguistic variable in the processing of expert data presented in the form of a matrix of binary relations of values of the membership function, which allowed to move to further processing of knowledge to support decision-making in the management of industrial, commercial, financial and other activities. As a mathematical model for estimating the numerical measure of information risk when making decisions based on the information obtained in conditions of non-stochastic uncertainty, a model has been developed to model natural language uncertainties, which differs from existing ones by formalizing knowledge taking into account uncertainty of input information. Making such a clear decision in a fuzzy environment has appropriate values of effectiveness and risk. The paper proposes all the functions and accessories of indicators of both quantitative nature and qualitative nature to bring their values in the field of definition to one scale. Then the indicator of the effectiveness of decision-making will be a measure of the clarity of the cross-section of fuzzy subsets, which correspond to the introduced indicators of information risk. The condition of economic facilities can be described and determined by the decision-maker, if the necessary information is available. Decision-making on thenumerical measure of information risk must be determined by a set of basic indicators, which can be both quantitative and qualitative in nature. Predictive values of indicators should be determined in conditions of nonstochastic uncertainty. In this case, the indicators of a quantitative nature can be determined by fuzzy triangular numbers, which implement a high level of confidence in the subjective judgments of experts. Indicators of qualitative nature should be presented in linguistic variables. The values of the indicators of qualitative nature that are predicted must be considered for all fuzzy variable terms-sets of linguistic variables introduced into consideration. For any fuzzy variable, the introduction to the consideration of a clear set of values as carriers of the α-level of its membership function allows to reduce to a single interpretation of the predicted values of indicators of quantitative and qualitative nature in terms of non-stochastic uncertainty. (shrink)

This tenth volume of Collected Papers includes 86 papers in English and Spanish languages comprising 972 pages, written between 2014-2022 by the author alone or in collaboration with the following 105 co-authors (alphabetically ordered) from 26 countries: Abu Sufian, Ali Hassan, Ali Safaa Sadiq, Anirudha Ghosh, Assia Bakali, Atiqe Ur Rahman, Laura Bogdan, Willem K.M. Brauers, Erick González Caballero, Fausto Cavallaro, Gavrilă Calefariu, T. Chalapathi, Victor Christianto, Mihaela Colhon, Sergiu Boris Cononovici, Mamoni Dhar, Irfan Deli, Rebeca Escobar-Jara, Alexandru Gal, N. (...) Gandotra, Sudipta Gayen, Vassilis C. Gerogiannis, Noel Batista Hernández, Hongnian Yu, Hongbo Wang, Mihaiela Iliescu, F. Nirmala Irudayam, Sripati Jha, Darjan Karabašević, T. Katican, Bakhtawar Ali Khan, Hina Khan, Volodymyr Krasnoholovets, R. Kiran Kumar, Manoranjan Kumar Singh, Ranjan Kumar, M. Lathamaheswari, Yasar Mahmood, Nivetha Martin, Adrian Mărgean, Octavian Melinte, Mingcong Deng, Marcel Migdalovici, Monika Moga, Sana Moin, Mohamed Abdel-Basset, Mohamed Elhoseny, Rehab Mohamed, Mohamed Talea, Kalyan Mondal, Muhammad Aslam, Muhammad Aslam Malik, Muhammad Ihsan, Muhammad Naveed Jafar, Muhammad Rayees Ahmad, Muhammad Saeed, Muhammad Saqlain, Muhammad Shabir, Mujahid Abbas, Mumtaz Ali, Radu I. Munteanu, Ghulam Murtaza, Munazza Naz, Tahsin Oner, ‪Gabrijela Popović‬‬‬‬‬, Surapati Pramanik, R. Priya, S.P. Priyadharshini, Midha Qayyum, Quang-Thinh Bui, Shazia Rana, Akbara Rezaei, Jesús Estupiñán Ricardo, Rıdvan Sahin, Saeeda Mirvakili, Said Broumi, A. A. Salama, Flavius Aurelian Sârbu, Ganeshsree Selvachandran, Javid Shabbir, Shio Gai Quek, Son Hoang Le, Florentin Smarandache, Dragiša Stanujkić, S. Sudha, Taha Yasin Ozturk, Zaigham Tahir, The Houw Iong, Ayse Topal, Alptekin Ulutaș, Maikel Yelandi Leyva Vázquez, Rizha Vitania, Luige Vlădăreanu, Victor Vlădăreanu, Ștefan Vlăduțescu, J. Vimala, Dan Valeriu Voinea, Adem Yolcu, Yongfei Feng, Abd El-Nasser H. Zaied, Edmundas Kazimieras Zavadskas.‬‬. (shrink)

The paper considers contemporary models of presumption in terms of their ability to contribute to a working theory of presumption for argumentation. Beginning with the Whatelian model, we consider its contemporary developments and alternatives, as proposed by Sidgwick, Kauffeld, Cronkhite, Rescher, Walton, Freeman, Ullmann-Margalit, and Hansen. Based on these accounts, we present a picture of presumptions characterized by their nature, function, foundation and force. On our account, presumption is a modal status that is attached to a claim and has the (...) effect of shifting, in a dialogue, a burden of proof set at a local level. Presumptions can be analysed and evaluated inferentially as components of rule-based structures. Presumptions are defeasible, and the force of a presumption is a function of its normative foundation. This picture seeks to provide a framework to guide the development of specific theories of presumption. (shrink)

In this paper, the authors show that there is a reading of St. Anselm's ontological argument in Proslogium II that is logically valid (the premises entail the conclusion). This reading takes Anselm's use of the definite description "that than which nothing greater can be conceived" seriously. Consider a first-order language and logic in which definite descriptions are genuine terms, and in which the quantified sentence "there is an x such that..." does not imply "x exists". Then, using an ordinary logic (...) of descriptions and a connected greater-than relation, God's existence logically follows from the claims: (a) there is a conceivable thing than which nothing greater is conceivable, and (b) if <em>x</em> doesn't exist, something greater than x can be conceived. To deny the conclusion, one must deny one of the premises. However, the argument involves no modal inferences and, interestingly, Descartes' ontological argument can be derived from it. (shrink)

Abstract: Fruits are a rich source of energy, minerals and vitamins. They also contain fiber. There are many fruits types such as: Apple and pears, Citrus, Stone fruit, Tropical and exotic, Berries, Melons, Tomatoes and avocado. Classification of fruits can be used in many applications, whether industrial or in agriculture or services, for example, it can help the cashier in the hyper mall to determine the price and type of fruit and also may help some people to determining whether a (...) certain type of fruit meets their nutritional requirement. In this paper, machine learning based approach is presented for classifying and identifying 10 different fruit with a dataset that contains 6847 images use 4793 images for training, 1027 images for validation and 1027 images for testing. A deep learning technique that extensively applied to image recognition was used. We used 70% from image for training and 15% from image for validation 15% for testing. Our trained model achieved an accuracy of 100% on a held-out test set, demonstrating the feasibility of this approach. (shrink)

Recently, research on uncertainty modeling is progressing rapidly and many essential and breakthrough stud ies have already been done. There are various ways such as fuzzy, intuitionistic and neutrosophic sets to handle these uncertainties. Although these concepts can handle incomplete information in various real-world issues, they cannot address all types of uncertainty such as indeterminate and inconsistent information. Also, plithogenic sets as a generalization of crisp, fuzzy, intuitionistic fuzzy, and neutrosophic sets, which is a set whose elements are characterized by (...) many attributes’ values. In this paper, our aim is to demonstrate and review the history of fuzzy, intuitionistic and neutrosophic sets. For this purpose, we divided the paper as: section 1. History of Fuzzy Sets, section 2. History of Intuitionistic Fuzzy Sets and section 3. History of Neutrosophic Theories and Applications, section 4. History of Plithogenic Sets. (shrink)

Biomedical ontologies are emerging as critical tools in genomic and proteomic research where complex data in disparate resources need to be integrated. A number of ontologies exist that describe the properties that can be attributed to proteins; for example, protein functions are described by Gene Ontology, while human diseases are described by Disease Ontology. There is, however, a gap in the current set of ontologies—one that describes the protein entities themselves and their relationships. We have designed a PRotein Ontology (PRO) (...) to facilitate protein annotation and to guide new experiments. The components of PRO extend from the classification of proteins on the basis of evolutionary relationships to the representation of the multiple protein forms of a gene (products generated by genetic variation, alternative splicing, proteolytic cleavage, and other post-translational modification). PRO will allow the specification of relationships between PRO, GO and other OBO Foundry ontologies. Here we describe the initial development of PRO, illustrated using human proteins from the TGF-beta signaling pathway. (shrink)

The study aimed to identify the reality of decision-making in the local NGOs in Gaza Strip. In order to achieve the objectives of the study and to test its hypotheses, the analytical descriptive method was used, relying on the questionnaire as a main tool for data collection. The study society was one of the decision makers in the local NGOs in Gaza Strip. The study population reached 78 local NGOs in Gaza Strip. A Census Method of the possible study community (...) was adopted, and the use of the Statistical Package for Social Sciences (SPSS) was mainly based on the analysis and analysis of the data obtained through the survey tool. The study reached a set of results, the most important of which are: NGOs follow a decision-making mechanism. NGOs examine the problems and causes of the organization. Organizations are less concerned with stakeholder participation. Make decision. The main recommendations of the study are: To promote systematic methods of decision-making in NGOs in Gaza Strip: Local NGOs in Gaza Strip should continue to develop their competencies in order to make sound and correct decisions and encourage them to follow the scientific methodologies in the mechanism of taking Decisions. (shrink)

The INBIOSA project brings together a group of experts across many disciplines who believe that science requires a revolutionary transformative step in order to address many of the vexing challenges presented by the world. It is INBIOSA’s purpose to enable the focused collaboration of an interdisciplinary community of original thinkers. This paper sets out the case for support for this effort. The focus of the transformative research program proposal is biology-centric. We admit that biology to date has been more fact-oriented (...) and less theoretical than physics. However, the key leverageable idea is that careful extension of the science of living systems can be more effectively applied to some of our most vexing modern problems than the prevailing scheme, derived from abstractions in physics. While these have some universal application and demonstrate computational advantages, they are not theoretically mandated for the living. A new set of mathematical abstractions derived from biology can now be similarly extended. This is made possible by leveraging new formal tools to understand abstraction and enable computability. [The latter has a much expanded meaning in our context from the one known and used in computer science and biology today, that is "by rote algorithmic means", since it is not known if a living system is computable in this sense (Mossio et al., 2009).] Two major challenges constitute the effort. The first challenge is to design an original general system of abstractions within the biological domain. The initial issue is descriptive leading to the explanatory. There has not yet been a serious formal examination of the abstractions of the biological domain. What is used today is an amalgam; much is inherited from physics (via the bridging abstractions of chemistry) and there are many new abstractions from advances in mathematics (incentivized by the need for more capable computational analyses). Interspersed are abstractions, concepts and underlying assumptions “native” to biology and distinct from the mechanical language of physics and computation as we know them. A pressing agenda should be to single out the most concrete and at the same time the most fundamental process-units in biology and to recruit them into the descriptive domain. Therefore, the first challenge is to build a coherent formal system of abstractions and operations that is truly native to living systems. Nothing will be thrown away, but many common methods will be philosophically recast, just as in physics relativity subsumed and reinterpreted Newtonian mechanics. -/- This step is required because we need a comprehensible, formal system to apply in many domains. Emphasis should be placed on the distinction between multi-perspective analysis and synthesis and on what could be the basic terms or tools needed. The second challenge is relatively simple: the actual application of this set of biology-centric ways and means to cross-disciplinary problems. In its early stages, this will seem to be a “new science”. This White Paper sets out the case of continuing support of Information and Communication Technology (ICT) for transformative research in biology and information processing centered on paradigm changes in the epistemological, ontological, mathematical and computational bases of the science of living systems. Today, curiously, living systems cannot be said to be anything more than dissipative structures organized internally by genetic information. There is not anything substantially different from abiotic systems other than the empirical nature of their robustness. We believe that there are other new and unique properties and patterns comprehensible at this bio-logical level. The report lays out a fundamental set of approaches to articulate these properties and patterns, and is composed as follows. -/- Sections 1 through 4 (preamble, introduction, motivation and major biomathematical problems) are incipient. Section 5 describes the issues affecting Integral Biomathics and Section 6 -- the aspects of the Grand Challenge we face with this project. Section 7 contemplates the effort to formalize a General Theory of Living Systems (GTLS) from what we have today. The goal is to have a formal system, equivalent to that which exists in the physics community. Here we define how to perceive the role of time in biology. Section 8 describes the initial efforts to apply this general theory of living systems in many domains, with special emphasis on crossdisciplinary problems and multiple domains spanning both “hard” and “soft” sciences. The expected result is a coherent collection of integrated mathematical techniques. Section 9 discusses the first two test cases, project proposals, of our approach. They are designed to demonstrate the ability of our approach to address “wicked problems” which span across physics, chemistry, biology, societies and societal dynamics. The solutions require integrated measurable results at multiple levels known as “grand challenges” to existing methods. Finally, Section 10 adheres to an appeal for action, advocating the necessity for further long-term support of the INBIOSA program. -/- The report is concluded with preliminary non-exclusive list of challenging research themes to address, as well as required administrative actions. The efforts described in the ten sections of this White Paper will proceed concurrently. Collectively, they describe a program that can be managed and measured as it progresses. (shrink)

The Internet of Things (IoT) connects schemes, programs, data management, and operations, and as they continuously assist in the corporation, they may be a fresh entryway for cyber-attacks. Presently, illegal downloading and virus attacks pose significant threats to IoT security. These risks may acquire confidential material, causing reputational and financial harm. In this paper hybrid optimization mechanism and deep learning,a frame is used to detect the attack prevention in IoT. To develop a cybersecurity warning system in a huge data set, (...) the cybersecurity warning systems index system is first constructed, then the index factors are picked and measured, and finally, the situation evaluation is done.Numerous bio-inspired techniques were used to enhance the productivity of an IDS by lowering the data dimensionality and deleting unnecessary and noisy input. The Grey Wolf Optimization algorithm (GWO) is a developed bio-inspired algorithm that improves the efficacy of the IDS in detecting both regular and abnormal congestion in the network. The smart initialization step integrates the different pre-processing strategies to make sure that informative features are incorporated in the early development stages, has been improved. Researchers pick multi-source material in a big data environment for the identification and verification of index components and present a parallel reduction approach based on the classification significance matrix to decrease data underlying data characteristics. For the simulation of this situation, grey wolf optimization and whale optimization were combined to detect the attack prevention and the deep learning approach was presented. Utilizing system software plagiarism, the TensorFlow deep neural network is intended to classify stolen software. To reduce the noise from the signal and to zoom the significance of each word in the perspective of open-source plagiarism, the tokenization and weighting feature approaches are utilized. Malware specimens have been collected from the Mailing database for testing purposes. The experimental findings show that the suggested technique for measuring cyber security hazards in IoT has superior classification results to existing methods. Hence to detect the attack prevention in IoT process Whale with Grey wolf optimization (WGWO) and deep convolution network is used. (shrink)

Objective: Compassion has been associated with eudaimonia and prosocial behavior, and has been regarded as a virtue, both historically and cross-culturally. However, the psychological study of compassion has been limited to laboratory settings and/or standard survey assessments. Here, we use an experience sampling method (ESM) to compare naturalistic assessments of compassion with standard assessments, and to examine compassion, its variability, and associations with eudaimonia and prosocial behavior. -/- Methods: Participants took a survey which included standard assessments of compassion and eudaimonia. (...) Then, over four days, they were repeatedly asked about their level of compassion, eudaimonia, and situational factors within the moments of daily life. Finally, prosocial behavior was tested using the Dual Gamble Task and an opportunity to donate task winnings. -/- Results: Analyses revealed within-person associations between ESM compassion and eudaimonia. ESM compassion also predicted eudaimonia at the next ESM time point. While not impervious to situational factors, considerable consistency was observed in ESM compassion in comparison with eudaimonia. Further, ESM compassion along with eudaimonia predicted donating behavior. Standard assessments did not. -/- Conclusion: Consistent with virtue theory, some individual’s reports displayed a probabilistic tendency toward compassion, and ESM compassion predicted ESM eudaimonia and prosocial behavior toward those in need. (shrink)

Migraine is a complex neurological disorder characterized by recurrent moderate to severe headaches, accompanied by additional symptoms such as nausea, sensitivity to light and sound, and visual disturbances. Accurate and timely diagnosis of migraines is crucial for effective management and treatment. However, the diverse range of symptoms and overlapping characteristics with other headache disorders pose challenges in the diagnostic process. In this research, we propose the development of an expert system for migraine diagnosis using artificial intelligence and the CLIPS (C (...) Language Integrated Production System) framework. The expert system utilizes a rule-based inference engine to analyze patient-reported symptoms and provide reliable diagnoses or probability scores indicating the likelihood of migraine. The knowledge base of the expert system is designed based on expert knowledge obtained from medical professionals specializing in migraines. The collected knowledge is translated into a structured format suitable for the CLIPS inference engine, incorporating rules and facts to represent the diagnostic criteria and associated symptoms. The system prompts users to provide relevant information about their symptoms, medical history, and potential triggers. It applies the defined rules and facts to evaluate the likelihood of migraine and generate accurate diagnoses or probability scores. Preliminary evaluation results demonstrate the potential of the expert system as a valuable tool for diagnosing migraines. A dataset of anonymized patient records with confirmed migraine cases was used to test the system. The diagnoses generated by the expert system were compared against the known diagnoses, and a high level of accuracy was observed, with 90% of cases correctly diagnosed as migraines. These results highlight the effectiveness and reliability of the system in assisting medical professionals in the diagnosis of migraines. The proposed expert system offers several advantages for migraine diagnosis. It leverages the collective knowledge and expertise of experienced migraine specialists, providing a standardized and consistent approach to diagnosis. The system can handle large amounts of patient data and effectively analyse complex relationships between symptoms, risk factors, and diagnostic criteria. Furthermore, it offers real-time feedback and recommendations, supporting medical professionals in their clinical decision-making process. Future work involves refining the expert system based on feedback from medical experts, expanding the knowledge base to encompass a wider range of symptoms and risk factors, and conducting further evaluations to enhance its accuracy and applicability in clinical settings. The development of an expert system for migraine diagnosis has the potential to improve the diagnostic process, leading to more effective management and treatment strategies for individuals suffering from migraines. (shrink)

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic set, single valued neutrosophic rough set, (...) bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, medicine, social science, and some more. (shrink)

Neutrosophic theory and its applications have been expanding in all directions at an astonishing rate especially after of the introduction the journal entitled “Neutrosophic Sets and Systems”. New theories, techniques, algorithms have been rapidly developed. One of the most striking trends in the neutrosophic theory is the hybridization of neutrosophic set with other potential sets such as rough set, bipolar set, soft set, hesitant fuzzy set, etc. The different hybrid structures such as rough neutrosophic set, single valued neutrosophic rough set, (...) bipolar neutrosophic set, single valued neutrosophic hesitant fuzzy set, etc. are proposed in the literature in a short period of time. Neutrosophic set has been an important tool in the application of various areas such as data mining, decision making, e-learning, engineering, medicine, social science, and some more. (shrink)

Neutrosophic set has been derived from a new branch of philosophy, namely Neutrosophy. Neutrosophic set is capable of dealing with uncertainty, indeterminacy and inconsistent information. Neutrosophic set approaches are suitable to modeling problems with uncertainty, indeterminacy and inconsistent information in which human knowledge is necessary, and human evaluation is needed. Neutrosophic set theory firstly proposed in 1998 by Florentin Smarandache, who also developed the concept of single valued neutrosophic set, oriented towards real world scientific and engineering applications. Since then, the (...) single valued neutrosophic set theory has been extensively studied in books and monographs introducing neutrosophic sets and its applications, by many authors around the world. (shrink)

Successful teamwork doesn't work overnight, what makes teamwork potent is team building. (Plagiarism) According to Abdullah, et. al., (2022) team building training can improve group cohesiveness or the quality of sticking together or unity teamwork more likely to be higher with a significant score difference. This study used mixed methods both qualitative and quantitative data collection, and an analysis method to answer the research method, random sampling is named as such because the data set is chosen via random selection, where (...) every member of the population has an equal probability of being selected (Tao, 2023). The respondents were 100 restaurant employees and 10 managers from the chosen restaurant in Malolos City in Bulacan. The subcategories of team building, including activities, communication, skills, personality, problem-solving, and values, have all received a consensus of strong agreement, with weighted averages falling within the range of 3.26 to 3.44. This level of agreement aligns with the scores for motivation at 3.43 and productivity at 3.38. These values have been calculated by determining the mean, which spans from 3.25 to 4.00. The advantages of team building that is being observed by the managers is to create familiarity and teamwork among the employees, to improve the quality of service and the quality of the food especially the respondents are in the food service sector, development, and training for the employees to achieve the establishments’ goal and lastly rebuilding and build a relationship with one employee to another. However, for the disadvantages, it costs a lot of money to conduct team building in the management. Therefore, the null hypothesis is rejected. Despite the fact that there is a low correlation between teambuilding activities and motivation and employee productivity, there is still a significant relationship between the variables. (shrink)

Abstract: Background: Coronary artery disease remains the leading cause of morbidity and mortality Worldwide. Previous reviews pointed that nursing interventions are beneficial for coronary artery patients. However, most interventions focused on education and counselling, but not consistent with the outcome set; still did not consider patient’s coronary artery disease risky characteristics. Related studies in China also difficult to find. Therefore this study was conducted to investigate kinds of nursing interventions delivered to coronary artery patients and match them with patient’s risk (...) factors of coronary artery disease. Results of this study were expected to add new knowledge that will alert nurses to consider coronary artery risk factors which in turn might enable the development of appropriate approaches to improve patient’s wellbeing hence reduce frequent coronary artery morbidity and mortality. Methods: A descriptive, cross-sectional, retrospective design using clinical case notes was employed. Study was undertaken in coronary care wards at the teaching hospital in China from November 2017 to September 2018. Structured-literature supported self-designed questionnaire was utilized for data collection. Chi square (χ2) test and multivariate logistic regression for adjusted odds ratio with 95% confidence interval were used to compare the relationship among independent (patient’s risk coronary artery disease factors) and dependent (nursing interventions) categorical variables. Ethical permission was granted accordingly. Results: A total of 300 coronary artery patients’ case notes were audited with mean age 63±11.2 years. Of these 175 (58.3%) were males. 126(42%) were smoking and 224(74.7%) were hypertensive. More evidence based nursing interventions than education and counselling were found to be delivered to these patients. “Administer coronary artery disease medication and their instructions” was mostly delivered to many patients 291(97%) while “counsel to cope with stress” was the least one 60 (20.0%). Three of eight nursing interventions delivered significantly matched with three or all of these patient’s coronary artery risk variables (age, smoking, hypertension and diabetes) (p < 0.05 and/or < 0.01) with Adjusted odds ratio (95% CI) within their significant ranges. Conclusion: This study delivers valuable insight that, nurses in the studied teaching hospital delivered beneficial evidence based nursing interventions to patients with coronary artery disease which significantly matched with their risk factors of coronary artery illness. However, care for stress was low hence needs improvement. Furthermore, research is needed to get consistency of nursing interventions with patient’s end point clinical outcomes for further appraisal of nursing efforts in caring CAD patients . (shrink)

Smarandache in 2019 has generalized the algebraic structures to NeutroAlgebraic structures and AntiAlgebraic structures. In this paper, authors, for the first time, define the NeutroAlgebra of neutrosophic triplets group under usual+ and x, built using {Zn, x}, n a composite number, 5 < n < oo, which are not partial algebras. As idempotents in Zn alone are neutrals that contribute to neutrosophic triplets groups, we analyze them and build NeutroAlgebra of idempotents under usual + and x, which are not partial (...) algebras. We prove in this paper the existence theorem for NeutroAlgebra of neutrosophic triplet groups. This proves the neutrals assocaited with neutrosophic triplet groups in { Zn, X} under product is a NeutroAlgebra of triplets. We also prove the non-existence theorem of NeutroAlgebra for neutrosophic triplets in case of Zn when n = 2p, 3p and 4p (for some primes p). Several open problems are proposed. Further, the NeutroAlgebras of extended neutrosophic triplet groups have been obtained. (shrink)

In 1980 F. Wattenberg constructed the Dedekind completion

d of the Robinson non-archimedean field

and established basic algebraic properties of

d [6]. In 1985 H. Gonshor established further fundamental properties of

d [7].In [4] important construction of summation of countable sequence of Wattenberg numbers was proposed and corresponding basic properties of such summation were considered. In this paper the important applications of the Dedekind completion

d in transcendental number theory were considered. We dealing using set theory ZFC
(
-model of ZFC).Given (...) an class of analytic functions of one complex variable f  

z, we investigate the arithmetic nature of the values of fz at transcendental points en, n  .Main results are: (i) the both numbers e
 and e   are irrational, (ii) number ee is transcendental. Nontrivial generalization of the Lindemann- Weierstrass theorem is obtained. (shrink)

Given an infinite set of finite-sized spheres extending in all directions forever, a finite-sized (relative to the spheres inside the set) observer within the set would view the set as a space composed of discrete, finite-sized objects. A hypothetical infinite-sized (relative to the spheres inside the set) observer would view the set as a continuous space and would see no distinct elements within the set. Using this analogy, the mathematics of infinities, such as the assignment of a cardinality (...) to a set, depends on the reference frame of the observer thinking about them (the mind of the mathematician) relative to the infinite set. This reasoning may also relate to the differing views of space in relativity as continuous and in quantum mechanics as discrete. (shrink)

The purpose of this paper is to explore infinite sets and classes by mean hyperoperations. With ideal notion, the idea of extending infinite sets is as large as those objects. In this paper, extensions with hyperoperations are realized, like factorial, derivative, integral and operations between vector spaces. The ideas about infinite and count are enlarged.

This analysis shows Cantor's diagonal definition in his 1891 paper was not compatible with his horizontal enumeration of the infinite set M. The diagonal sequence was a counterfeit which he used to produce an apparent exclusion of a single sequence to prove the cardinality of M is greater than the cardinality of the set of integers N.

Suppose one has a system, the infinite set of positive integers, P, and one wants to study the characteristics of a subset (or subsystem) of that system, the infinite subset of odd positives, O, relative to the overall system. In mathematics, this is done by pairing off each odd with a positive, using a function such as O=2P+1. This puts the odds in a one-to-one correspondence with the positives, thereby, showing that the subset of odds and the original (...) set of positives are the same size, or have the same cardinality. This counter-intuitive result ignores the “natural” relationship of one odd for every two positives in the sequence of positive integers, which would suggest that O is one-half the size of P. However, in the set of axioms that constitute mathematics, it is considered valid. Fair enough. In the physical universe (i.e., the starting system), though, relationships between entities matter. In biochemistry, if you start with an organism, say a rat, and you want to study its heart, you can do this by removing some heart cells and studying them in isolation in a cell culture system. But, the results often differ compared to what occurs in the intact animal because studying the isolated cultured cells ignores the relationships in the intact body between the cells, the rest of the heart tissue and the rest of the rat. In chemistry, if a copper atom were studied in isolation, it would never be known that copper atoms in bulk can conduct electricity because the atoms share their electrons. In physics, the relationships between inertial reference frames in relativity, and observer and observed in quantum physics can't be ignored. Relationships matter in the physical world, but the mathematics of infinite sets is still used to describe it. Does this matter? It seems to, at least in physics. Infinities cause numerous problems in theoretical physics such as non-renormalizability and problems in unifying quantum mehanics and general relativity . This suggests that the pairing off method and the mathematics of infinite sets based on it are analogous to a cell culture system or studying a copper atom in isolation if they are used in studying the physical universe because they ignore the inherent relationships between entities. In the real, physical world, the natural, inherent, relationships between entities can't be ignored. Said another way, the set of axioms that constitute abstract mathematics may be similar but not identical to the set of physical axioms by which the real, physical universe runs. This suggests that the results from abstract mathematics about infinities may not apply to or should be modified for use in physics. (shrink)

Andrew Wiles' analytic proof of Fermat's Last Theorem FLT, which appeals to geometrical properties of real and complex numbers, leaves two questions unanswered: (i) What technique might Fermat have used that led him to, even if only briefly, believe he had `a truly marvellous demonstration' of FLT? (ii) Why is x^n+y^n=z^n solvable only for n<3? In this inter-disciplinary perspective, we offer insight into, and answers to, both queries; yielding a pre-formal proof of why FLT can be treated as a true (...) arithmetical proposition (one which, moreover, might not be provable formally in the first-order Peano Arithmetic PA), where we admit only elementary (i.e., number-theoretic) reasoning, without appeal to analytic properties of real and complex numbers. We cogently argue, further, that any formal proof of FLT needs---as is implicitly suggested by Wiles' proof---to appeal essentially to formal geometrical properties of formal arithmetical propositions. (shrink)