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)

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)

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)

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)

Our computational metaphysics group describes its use of automated reasoning tools to study Leibniz’s theory of concepts. We start with a reconstruction of Leibniz’s theory within the theory of abstract objects (henceforth ‘object theory’). Leibniz’s theory of concepts, under this reconstruction, has a non-modal algebra of concepts, a concept-containment theory of truth, and a modal metaphysics of complete individual concepts. We show how the object-theoretic reconstruction of these components of Leibniz’s theory can be represented for investigation by means of automated (...) theorem provers and finite model builders. The fundamental theorem of Leibniz’s theory is derived using these tools. (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 aim of the paper is to analyze the expressive power of the square operator of Łukasiewicz logic: ∗x=x⊙x⁠, where ⊙ is the strong Łukasiewicz conjunction. In particular, we aim at understanding and characterizing those cases in which the square operator is enough to construct a finite MV-chain from a finite totally ordered set endowed with an involutive negation. The first of our main results shows that, indeed, the whole structure of MV-chain can be reconstructed from the involution and the (...) Łukasiewicz square operator if and only if the obtained structure has only trivial subalgebras and, equivalently, if and only if the cardinality of the starting chain is of the form n+1 where n belongs to a class of prime numbers that we fully characterize. Secondly, we axiomatize the algebraizable matrix logic whose semantics is given by the variety generated by a finite totally ordered set endowed with an involutive negation and Łukasiewicz square operator. Finally, we propose an alternative way to account for Łukasiewicz square operator on involutive Gödel chains. In this setting, we show that such an operator can be captured by a rather intuitive set of equations. (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)

The most cursory examination of the history of artificial intelligence highlights numerous egregious claims of its researchers, especially in relation to a populist form of ‘strong’ computationalism which holds that any suitably programmed computer instantiates genuine conscious mental states purely in virtue of carrying out a specific series of computations. The argument presented herein is a simple development of that originally presented in Putnam’s (Representation & Reality, Bradford Books, Cambridge in 1988 ) monograph, “Representation & Reality”, which if correct, has (...) important implications for turing machine functionalism and the prospect of ‘conscious’ machines. In the paper, instead of seeking to develop Putnam’s claim that, “everything implements every finite state automata”, I will try to establish the weaker result that, “everything implements the specific machine Q on a particular input set ( x )”. Then, equating Q ( x ) to any putative AI program, I will show that conceding the ‘strong AI’ thesis for Q (crediting it with mental states and consciousness) opens the door to a vicious form of panpsychism whereby all open systems, (e.g. grass, rocks etc.), must instantiate conscious experience and hence that disembodied minds lurk everywhere. (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)

This paper presents folk impressions of the University of Manchester’s difficulties in becoming a great university, but by means of a fiction imitating a distinguished writer from the Indian subcontinent. The impressions concern past efforts and the difficulties they faced.

It is well known that the following features hold of AR + T under the strong Kleene scheme, regardless of the way the language is Gödel numbered: 1. There exist sentences that are neither paradoxical nor grounded. 2. There are 2ℵ0 fixed points. 3. In the minimal fixed point the weakly definable sets (i.e., sets definable as {n∣ A(n) is true in the minimal fixed point where A(x) is a formula of AR + T) are precisely the Π1 1 sets. (...) 4. In the minimal fixed point the totally defined sets (sets weakly defined by formulae all of whose instances are true or false) are precisely the ▵1 1 sets. 5. The closure ordinal for Kripke's construction of the minimal fixed point is ωCK 1. In contrast, we show that under the weak Kleene scheme, depending on the way the Gödel numbering is chosen: 1. There may or may not exist nonparadoxical, ungrounded sentences. 2. The number of fixed points may be any positive finite number, ℵ0, or 2ℵ0 . 3. In the minimal fixed point, the sets that are weakly definable may range from a subclass of the sets 1-1 reducible to the truth set of AR to the Π1 1 sets, including intermediate cases. 4. Similarly, the totally definable sets in the minimal fixed point range from precisely the arithmetical sets up to precisely the ▵1 1 sets. 5. The closure ordinal for the construction of the minimal fixed point may be ω, ωCK 1, or any successor limit ordinal in between. In addition we suggest how one may supplement AR + T with a function symbol interpreted by a certain primitive recursive function so that, irrespective of the choice of the Godel numbering, the resulting language based on the weak Kleene scheme has the five features noted above for the strong Kleene language. (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)

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)

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)

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)

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)

Among the many functions of models, explanation is central to the functioning and aims of science. However, the discussions surrounding modeling and explanation in philosophy have largely remained separate from each other. This chapter seeks to bridge the gap by focusing on the puzzle of model-based explanation, asking how different philosophical accounts answer the following question: if idealizations and fictions introduce falsehoods into models, how can idealized and fictional models provide true explanations? The chapter provides a selective and critical overview (...) of the available strategies for solving this puzzle, mainly focusing on idealized models and how they explain. (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)

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)

Jean-Luc Nancy takes the concept of "essence" in order to indicate its drawbacks on the singularity of being. The concept of essence is not a universal and necessary origin, but contingent and historical meanings for Nancy. This historicity in meaning leads Nancy to question the concept of the individual and the rules of the social/public sphere allocated through individuality. Nancy's argument on the ontological environment of finite beings aims to highlight those beings are mixed singular, not belonging to a universal (...) unit. This allows us to discover that being is singular and also singular-plural to the extent that it is with the other. Thus, essential historical concepts invalidate individual or social organizations at this point. Nancy calls this “finitude” which is the only transcendental concept that makes possible the “being with” (Mitsein). It is possible to think that finitude is the only property to make a community of singularities rather than ready-made concepts of social sciences. I argue that this position is methodological for an alternative socio-ontology. (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)

Objective: The aim of this study is to evaluate relationship between ostiomeatal complex variations (OMC) and maxillary sinus pathologies in children and adolescents using cone-beam computed tomography (CBCT). -/- Methods: CBCT images of 72 patients (44 males and 28 females) aged 7-18 years were evaluated retrospectively. Presence of nasal septal deviation (NSD), nasal septal pneumatization (NSP), concha bullosa (CB), accessory maxillary ostium (AMO), agger nasi cell (ANC), Haller cell (HC), Onodi cell (OC), ethmoid sinusitis and maxillary sinus pathologies were investigated. (...) Maxillary sinus pathologies were classified. Correlations of OMC variations with each other, maxillary sinus pathologies and ethmoid sinusitis were investigated. Chi-square test was used to analyze relationships among variables and distribution of parameters. -/- Results: NSD was determined in 70.8%, NSP in 40.3%, ethmoid sinusitis in 75%, maxillary sinus pathology in 34.8% of images. OMC variations rates were detected as CB 31.3%, AMO 16%, ANC 16%, HC 24.3% and OC 18.8%. The most common maxillary sinus pathology was localized mucosal thickening, with a rate of 15.3% on right and 22.2% on left. Statistically significant differences were determined between almost all OMC variations with each other, and between anatomical variations in OMC with maxillary sinus pathologies except for NSP and AMO (p < 0.05). The presence of ethmoid sinusitis was more common in males (p =0.026). -/- Conclusion: Anatomical variations in OMC had no significant effect on maxillary sinus pathology except for NSP and AMO. Besides, most of anatomical variations in OMC were statistically significantly correlated with each other. CBCT visualization of these variations is important for sinonasal surgery and is an effective method in children and adolescents with low radiation dose and high image quality compared to computed tomography. (shrink)

Work results have been significantly improved with the help of bayesvl.

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.

Modern webpages consist of many rich objects dynamically produced by servers and client terminals at diverse locations, so we face an increase in web response time. To reduce the time, edge computing, in which dynamic objects are generated and delivered from edge nodes, is effective. For ISPs and CDN providers, it is desirable to estimate the effect of reducing the web response time when introducing edge computing. Therefore, in this paper, we derive a simple formula that estimates the lower bound (...) of the reduction of the response time by modeling flows obtaining objects of webpages. We investigate the effect of edge computing in each webpage category, e.g., News and Sports, using data measured by browsing about 1,000 popular webpages from 12 locations in the world on PlanetLab. (shrink)

The paper describes the design of an intelligent tutoring system for teaching Introduction to Computer Science-a compulsory curriculum in Al-Azhar University of Gaza to students who attend the university. The basic idea of this system is a systematic introduction into computer science. The system presents topics with examples. The system is dynamically checks student's individual progress. An initial evaluation study was done to investigate the effect of using the intelligent tutoring system on the performance of students enrolled in computer science (...) curriculum at Al-Azhar University, Gaza. The results showed a positive impact on the evaluators. (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)

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)

The convergence of computing, sensing, and communication technology will soon permit large-scale deployment of self-driving vehicles. This will in turn permit a radical transformation of traffic control technology. This paper makes a case for the importance of addressing questions of social justice in this transformation, and sketches a preliminary framework for doing so. We explain how new forms of traffic control technology have potential implications for several dimensions of social justice, including safety, sustainability, privacy, efficiency, and equal access. Our central (...) focus is on efficiency and equal access as desiderata for traffic control design. We explain the limitations of conventional traffic control in meeting these desiderata, and sketch a preliminary vision for a next-generation traffic control tailored to address better the demands of social justice. One component of this vision is cooperative, hierarchically distributed self-organization among vehicles. Another component of this vision is a priority system enabling selection of priority levels by the user for each vehicle trip in the network, based on the supporting structure of non-monetary credits. (shrink)

An Intelligent Tutoring System (ITS) is a computer system that offers an instant, adapted instruction and customized feedback to students without human teacher interference. Reciting "Tajweed" the Holy Quran in the appropriate way is very important for all Muslims and is obligatory in Islamic devotions such as prayers. In this paper, the researchers introduce an intelligent tutoring system for teaching Reciting "Tajweed". Our "Tajweed" tutoring system is limited to "Tafkhim and Tarqiq in TAJWEED" the Holy Quran, Rewaya: Hafs from ‘Aasem. (...) The system was evaluated by reciting teachers and students, and the results were auspicious. (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)

Heart palpitations, while often benign, can sometimes be indicative of severe underlying conditions requiring immediate intervention. Accurate and swift diagnosis thus remains a clinical priority. "A CLIPS-Based Expert System for Heart Palpitations Diagnosis" represents a novel approach to addressing this challenge, harnessing the power of artificial intelligence and rule-based expert systems. Specifically, this system applies a suite of 7 if-then rules to evaluate potential heart palpitations causes and assign one of three outcomes: 1) A confirmed diagnosis of heart palpitations, (...) 2) A suspected link to cardiovascular diseases, and 3) A possible association with anxiety or stress disorders. The expert system offers an intuitive user interface, allowing for seamless symptom input and instant diagnosis based on user-provided information. This paper explores the various phases of this expert system's lifecycle, including design, implementation, and evaluation. Furthermore, the study situates the system within the broader discourse on rule-based expert systems for heart palpitations diagnosis, critically analyzing their efficiency, potential pitfalls, and ongoing challenges. Through this research, the value of integrating rule-based expert systems in clinical diagnostic processes is highlighted, illustrating its capacity to enhance diagnostic accuracy and patient outcomes. (shrink)

Here is a template for introducing mathematical objects: “Objects are found in stages. For every stage S: (1) for any things found before S, you find at S the bland set whose members are exactly those things; (2) for anything, x, which was found before S, you find at S the result of tapping x with any magic wand (provided that the result is not itself a bland set); you find nothing else at S.” -/- This Template has rich (...) applications, it realizes John Conway’s (1976) Mathematicians’ Liberation Movement, and it generalizes a lovely idea due to Alonzo Church (1974). -/- Some parts of this Template are familiar: the bit about bland sets is just the ordinary story we tell about the cumulative iterative conception of set. But this talk of “magic wands” is new and different. Moreover, parts of the Template are left unspecified. -/- This under-specification is deliberate: we want to be able to flesh out the Template in umpteen different ways. The Main Theorem of the paper is that any loosely constructive way of fleshing out the Template is synonymous with a ZF-like theory. (shrink)

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)

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)

Undeniably, the greatest way for a Moslem to be closer to Allah, is recitation of Holy-Quran approves with the method conveyed from Messenger of Allah Mohammed from the feature of speech points of letters and the intrinsic and fleeting characteristics of the letters, So, there is a persistent need to teach all Moslems the science of Tajweed Al-Quran. ITS (Intelligent Tutoring System) is computer software that supplies direct and tailored training or response to students without human teacher interfering. The main (...) target of ITS is smoothing the learning process using the wide-ranging facilities of computer. The proposed system will be implemented using the ITSB Authoring tool. In this thesis, the researcher presents an intelligent tutoring system for teaching Reciting Al-Quran "Tajweed" with Rewaya: Hafs from ‘Aasem by the way of Shatebiyyah. It was a novel idea that the researcher combined the science of Tajweed Al-Quran and the science of artificial intelligence in his thesis. The researcher arranged the material into chapters, lessons, examples then, added all these to the proposed system. He also added questions, right answers and the level of difficulty for each lesson. He prepared an exam for each chapter and a final exam to test the knowledge of the learner in the whole material. The system was evaluated by teachers and students in reciting science and the outcome of the assessment was encouraging and promising. (shrink)

Daniel Isaacson has advanced an epistemic notion of arithmetical truth according to which the latter is the set of truths that we grasp on the basis of our understanding of the structure of natural numbers alone. Isaacson’s thesis is then the claim that Peano Arithmetic (PA) is the theory of finite mathematics, in the sense that it proves all and only arithmetical truths thus understood. In this paper, we raise a challenge for the thesis and show how it can be (...) overcome. We introduce the concept of purity for theories of arithmetic: a theory of arithmetic is pure when it only proves arithmetical truths. Then, we argue that, under Isaacson’s thesis, some PA-provable truths—including transfinite induction claims for infinite ordinals and some consistency statements—are seemingly not arithmetical in Isaacson’s sense, and hence that Isaacson’s thesis might entail the impurity of PA. Nonetheless, we conjecture that the advocate of Isaacson’s thesis can avoid this undesirable consequence: the arithmetical nature, as understood by Isaacson, of all contentious PA-provable statements can be justified. As a case study, we explore how this is done for transfinite induction claims with infinite ordinals below ε0. To this end, we show that the PA-proof of such claims employs exclusively resources from finite mathematics, and that ordinals below ε0 are finitary objects despite being infinite. (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)

J. N. (Jitendra Nath) Mohanty (1928–2023). -/- Professor J. N. Mohanty has characterized his life and philosophy as being both “inside” and “outside” East and West, i.e., inside and outside traditions of India and those of the West, living in both India and United States: geographically, culturally, and philosophically; while also traveling the world: Melbourne to Moscow. Most of his academic time was spent teaching at the University of Oklahoma, The New School Graduate Faculty, and finally Temple University. Yet his (...) preeminent work in Husserlian phenomenology developed alongside his eminent work in Indian philosophy: describing his interests as “a fusion of disparate horizons.” -/- J. N. Mohanty was born September 26, 1928, in Cuttack (Odisha, East India). After graduating from high school, he went on to study both Indian and Western philosophy in Calcutta, earning bachelor’s and master’s degrees. There he read Whitehead and Kant’s First Critique; although he wanted to include mathematics in his curriculum, he was led instead to include Indian philosophy and Sanskrit. On the shelves of his teacher, Ras Vihar Das, he came upon a copy of the English translation (Ideas I, 1931) of Edmund Husserl’s classic Ideen I (1913), which presented Husserl’s ground-breaking conception of phenomenology. In 1952–1954 he left India for the first time, reaching Göttingen to study mathematics and philosophy, which earned him a doctorate in mathematics and “philosophy of mathematical sciences” (in his own words). In Göttingen, Mohanty found the powerful mathematical world that Husserl himself had earlier interacted with, where several Husserl students had formed the Göttingen school of phenomenology. During these years Mohanty studied primarily mathematics, alongside Kant and also Vedic Sanskrit. From his friend Günter Patzig, interpreter of Aristotle and Frege, Mohanty was drawn to Frege in relation to mathematical logic. He attended lectures of Heidegger, intrigued by his ontological thinking. Yet, despite the Husserlian legacy, Mohanty was completely self-taught in his studies of Husserl (as he has reported). With a doctorate in mathematics, and ideas from Kant and Frege in his philosophical background, Mohanty set about crafting his own conception of philosophy grounded in phenomenology, drawing on Husserl’s extensive work, critically sifting through Husserl’s texts and their emerging concepts of intentionality, meaning, subject, intersubjectivity, and world. In between he wrote his first book-length study: on phenomenological insights in Nicolai Hartmann and A. N. Whitehead (1958). -/- Over many decades Mohanty formulated and argued, in analytical detail, for a conception of phenomenology and its place in philosophy, later presented in a clear and concise book titled Transcendental Phenomenology: An Analytic Account (1989). Over these very decades the same scholar explored classical and recent Indian philosophy, thinking through kindred ideas of consciousness, self, and knowledge drawn from the Indian philosophical contexts. While writing on Nyāya theory of truth, he also pondered whether the world and finite individual are illusory or real, and whether Marx, Arendt, Gandhi (whom he heard speak in Calcutta), or Vinoba Bhave (with whom he marched across India for the land-grant movement) could best navigate post-Independent India’s social and svarāj or self-rule reforms. The two Mohantys, thinking through a vision of self and world, turned out to be “non-different” or “non-dual” as they each practiced critical phenomenology from both inside and outside the respective philosophical and cultural traditions. Numerous students, fellows, and colleagues or collaborators have benefited immensely from this infusion and unified approach to diversity in philosophical thought. In the 2000s, moving into retirement, Mohanty wrote two long books devoted to his understanding of Husserl and phenomenology and the calling of philosophy itself. This two-volume study shows Mohanty himself thinking through Husserl, critically, in The Philosophy of Edmund Husserl: A Historical Introduction (2008), and Edmund Husserl’s Freiburg Years: 1916–1938. As Mohanty worked on Husserl, he carefully indicated where he agreed and where he rejected or changed ideas, all part of his practice in phenomenology of “description and interpretation.” It was the same pattern he used in addressing the thought of Husserl vis-à-vis Kant or Frege or even Quine. -/- As Mohanty developed his understanding of phenomenology over the years, he wrote books on theory of meaning and the concept of intentionality, developing a model of ideal meaning and its foundation in intentionality, drawing on Husserl’s results. He followed these with the book Husserl and Frege (1982), linking the thought of those foundational figures for the “continental” and “analytic” traditions, respectively, in twentieth-century Western philosophy. Over his long career Mohanty addressed both traditions in his clear and accessible writing style. While developing his views on phenomenology, Mohanty regularly looked to “Husserl and his others,” evaluating views in Heidegger, Sartre, Merleau-Ponty, Ricoeur, and then Derrida and others in the wake of Husserl. With his background in Kant, Mohanty also looked toward Heidegger and Hegel in relation to Husserl’s later work in the Crisis (1935–38). Similarly, he looked to contemporary analytic philosophers, adjudicating his own, oft-wise Husserlian views in relation to Frege, Nagel, and others. Amid his active scholarly career, Mohanty co-founded the journal Husserl Studies, and was editorial advisor to Philosophy & Phenomenological Research, Philosophy East & West, Journal of Indian Philosophy, Sophia, among others. -/- Yet all this while Mohanty was also thinking and writing about Indian philosophy and its relation to phenomenology. In his own retrospective, Indian philosophy is “the permanent background” of his Husserlian thinking, while Kant is the recurrent Western background of his Husserlian phenomenology. Mohanty’s form of “transcendental phenomenology” evolved, in his own perspective, against the background of his studies of Navya-Nyāya on logic and Vedānta on consciousness, in Indian philosophy, and against the background of Kant’s First Critique on the transcendental, in Western philosophy. Accordingly, Mohanty’s study of logical form and of the intentionality of consciousness seeks a fusion of East and West in the conception of transcendental phenomenology. (Cf. Mohanty’s apt response to critics in The Empirical and the Transcendental (2000).) Even in the context of North American Husserl scholarship, Mohanty has exercised an earnest fusion of East and West. For the so-called East Coast and West Coast interpretations of Husserl’s crucial notion of noema both find a sympathetic spirit in J. N. Mohanty’s careful and nuanced interpretation of Husserlian transcendental phenomenology. With Mohanty the two faces of the noema are the logical (Fregean) and the phenomenal (Kantian), and these views of intentional structure join in consciousness—in a way resonant with Indian thought. -/- - David Woodruff Smith (UC Irvine) and Purushottama Bilimoria (SFSU, San Francisco; University of Melbourne) -/- For photo of Prof Mohanty visit APA online memorial_minutes2023 Courtesy of APA Memorial Minutes (& Proceedings) 2023 . (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)

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)

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)

The Cell Ontology (CL) is designed to provide a standardized representation of cell types for data annotation. Currently, the CL employs multiple is_a relations, defining cell types in terms of histological, functional, and lineage properties, and the majority of definitions are written with sufficient generality to hold across multiple species. This approach limits the CL’s utility for cross-species data integration. To address this problem, we developed a method for the ontological representation of cells and applied this method to develop a (...) dendritic cell ontology (DC-CL). DC-CL subtypes are delineated on the basis of surface protein expression, systematically including both species-general and species-specific types and optimizing DC-CL for the analysis of flow cytometry data. This approach brings benefits in the form of increased accuracy, support for reasoning, and interoperability with other ontology resources. 104. Barry Smith, “Toward a Realistic Science of Environments”, Ecological Psychology, 2009, 21 (2), April-June, 121-130. Abstract: The perceptual psychologist J. J. Gibson embraces a radically externalistic view of mind and action. We have, for Gibson, not a Cartesian mind or soul, with its interior theater of contents and the consequent problem of explaining how this mind or soul and its psychological environment can succeed in grasping physical objects external to itself. Rather, we have a perceiving, acting organism, whose perceptions and actions are always already tuned to the parts and moments, the things and surfaces, of its external environment. We describe how on this basis Gibson sought to develop a realist science of environments which will be ‘consistent with physics, mechanics, optics, acoustics, and chemistry’. (shrink)

This paper concerns “human symbolic output,” or strings of characters produced by humans in our various symbolic systems; e.g., sentences in a natural language, mathematical propositions, and so on. One can form a set that consists of all of the strings of characters that have been produced by at least one human up to any given moment in human history. We argue that at any particular moment in human history, even at moments in the distant future, this set is finite. (...) But then, given fundamental results in recursion theory, the set will also be recursive, recursively enumerable, axiomatizable, and could be the output of a Turing machine. We then argue that it is impossible to produce a string of symbols that humans could possibly produce but no Turing machine could. Moreover, we show that any given string of symbols that we could produce could also be the output of a Turing machine. Our arguments have implications for Hilbert’s sixth problem and the possibility of axiomatizing particular sciences, they undermine at least two distinct arguments against the possibility of Artificial Intelligence, and they entail that expert systems that are the equals of human experts are possible, and so at least one of the goals of Artificial Intelligence can be realized, at least in principle. (shrink)

A practical viewpoint links reality, representation, and language to calculation by the concept of Turing (1936) machine being the mathematical model of our computers. After the Gödel incompleteness theorems (1931) or the insolvability of the so-called halting problem (Turing 1936; Church 1936) as to a classical machine of Turing, one of the simplest hypotheses is completeness to be suggested for two ones. That is consistent with the provability of completeness by means of two independent Peano arithmetics discussed in Section I. (...) Many modifications of Turing machines cum quantum ones are researched in Section II for the Halting problem and completeness, and the model of two independent Turing machines seems to generalize them. Then, that pair can be postulated as the formal definition of reality therefore being complete unlike any of them standalone, remaining incomplete without its complementary counterpart. Representation is formal defined as a one-to-one mapping between the two Turing machines, and the set of all those mappings can be considered as “language” therefore including metaphors as mappings different than representation. Section III investigates that formal relation of “reality”, “representation”, and “language” modeled by (at least two) Turing machines. The independence of (two) Turing machines is interpreted by means of game theory and especially of the Nash equilibrium in Section IV. Choice and information as the quantity of choices are involved. That approach seems to be equivalent to that based on set theory and the concept of actual infinity in mathematics and allowing of practical implementations. (shrink)