The aim of this paper is to emphasize the fact that for all finitely-many-valued logics there is a completely systematic relation between sequent calculi and tableau systems. More importantly, we show that for both of these systems there are al- ways two dual proof sytems (not just only two ways to interpret the calculi). This phenomenon may easily escape one’s attention since in the classical (two-valued) case the two systems coincide. (In two-valued logic the assignment of a (...) truth value and the exclusion of the opposite truth value describe the same situation.). (shrink)

In this dissertation we present proof systems for several modal logics. These proof systems are based on analytic (or semantic) tableaux. -/- Modal logics are logics for reasoning about possibility, knowledge, beliefs, preferences, and other modalities. Their semantics are almost always based on Saul Kripke’s possible world semantics. In Kripke semantics, models are represented by relational structures or, equivalently, labeled graphs. Syntactic formulas that express statements about knowledge and other modalities are evaluated in terms of such models. (...) -/- This dissertation focuses on modal logics with dynamic operators for public announcements, belief revision, preference upgrades, and so on. These operators are defined in terms of mathematical operations on Kripke models. Thus, for example, a belief revision operator in the syntax would correspond to a belief revision operation on models. -/- The ‘dynamic’ semantics of dynamic modal logics are a clever way of extending languages without compromising on intuitiveness. We present ‘dynamic’ tableau proof systems for these dynamic semantics, with the express aim to make them conceptually simple, easy to use, modular, and extensible. This we do by reflecting the semantics as closely as possible in the components of our tableau system. For instance, dynamic operations on Kripke models have counterpart dynamic relations between tableaux. -/- Soundness, completeness, and decidability are three of the most important properties that a proof system may have. A proof system is sound if and only if any formula for which a proof exists, is true in every model. A proof system is complete if and only if for any formula that is true in all models, a proof exists. A proof system is decidable if and only if any formula can be proved to be a theorem or not a theorem in a finite number of steps. All proof systems in this dissertation are sound, complete, and decidable. -/- Part of our strategy to create modular tableau systems is to delay concerns over decidability until after soundness and completeness have been established. Decidability is attained through the operations of folding and through operations on ‘tableau cascades’, which are graphs of tableaux. -/- Finally, we provide a proof-of-concept implementation of our dynamic tableau system for public announcement logic in the Clojure programming language. (shrink)

Priest has provided a simple tableau calculus for Chellas's conditional logic Ck. We provide rules which, when added to Priest's system, result in tableau calculi for Chellas's CK and Lewis's VC. Completeness of these tableaux, however, relies on the cut rule.

ABSTRACT: This 1974 paper builds on our 1969 paper (Corcoran-Weaver [2]). Here we present three (modal, sentential) logics which may be thought of as partial systematizations of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of these three logics coincide with one another and with those of standard formalizations of Lewis's S5. These logics, when regarded as logistic systems (cf. Corcoran [1], p. 154), are seen to be (...) equivalent; but, when regarded as consequence systems (ibid., p. 157), one diverges from the others in a fashion which suggests that two standard measures of semantic complexity may not be as closely linked as previously thought. -/- This 1974 paper uses the linear notation for natural deduction presented in [2]: each two-dimensional deduction is represented by a unique one-dimensional string of characters. Thus obviating need for two-dimensional trees, tableaux, lists, and the like—thereby facilitating electronic communication of natural deductions. The 1969 paper presents a (modal, sentential) logic which may be thought of as a partial systematization of the semantic and deductive properties of a sentence operator which expresses certain kinds of necessity. The logical truths [sc. tautologies] of this logic coincides those of standard formalizations of Lewis’s S4. Among the paper's innovations is its treatment of modal logic in the setting of natural deduction systems--as opposed to axiomatic systems. The author’s apologize for the now obsolete terminology. For example, these papers speak of “a proof of a sentence from a set of premises” where today “a deduction of a sentence from a set of premises” would be preferable. 1. Corcoran, John. 1969. Three Logical Theories, Philosophy of Science 36, 153–77. J P R -/- 2. Corcoran, John and George Weaver. 1969. Logical Consequence in Modal Logic: Natural Deduction in S5 Notre Dame Journal of Formal Logic 10, 370–84. MR0249278 (40 #2524). 3. Weaver, George and John Corcoran. 1974. Logical Consequence in Modal Logic: Some Semantic Systems for S4, Notre Dame Journal of Formal Logic 15, 370–78. MR0351765 (50 #4253). (shrink)

A modal logic for representing analogical proportions is presented. This logic is a modal interpretation of H. Prade and G. Richard's homogeneous analogy. A tableaux system is given with some examples an intuitions.

The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of finite-valued (...) first order logics in a general way, and to present some of the more important results in this area. In Systems covered are the resolution calculus, sequent calculus, tableaux, and natural deduction. This report is actually a template, from which all results can be specialized to particular logics. (shrink)

FDE is a logic that captures relevant entailment between implication-free formulae and admits of an intuitive informational interpretation as a 4-valued logic in which “a computer should think”. However, the logic is co-NP complete, and so an idealized model of how an agent can think. We address this issue by shifting to signed formulae where the signs express imprecise values associated with two distinct bipartitions of the set of standard 4 values. Thus, we present a proof system which consists of (...) linear operational rules and only two branching structural rules, the latter expressing a generalized rule of bivalence. This system naturally leads to defining an infinite hierarchy of tractable depth-bounded approximations to FDE. Namely, approximations in which the number of nested applications of the two branching rules is bounded. (shrink)

A textbook for modal and other intensional logics based on the Open Logic Project. It covers normal modal logics, relational semantics, axiomatic and tableaux proof systems, intuitionistic logic, and counterfactual conditionals.

Could there be a single logical system that would allow us to work simultaneously with classical, paraconsistent, and paracomplete negations? These three negations were separately studied in logics whose negations bear their names. Initially we will restrict our analysis to propositional logics by analyzing classical negation, ¬c, as treated by Classical Propositional Logic (LPC); the paraconsistent negation, ¬p, as treated through the hierarchy of Paraconsistent Propositional Calculi Cn (0 ≤ n ≤ ω); and the paracomplete negation, ¬q, as treated by (...) the hierarchy of Paracomplete Propositional Calculi Pn (0 ≤ n ≤ ω). In “Logics that are both paraconsistent and paracomplete” (1989), Newton da Costa proposed a system with approximate characteristics to what we are looking for. In the hierarchy of Non-Alethical Propositional Calculi Nn (0 ≤ n ≤ ω), only one negation is introduced (as primitive), called a “non-alethic” (¬n), whose operation preserves the properties of classical, or paraconsistent or paracomplete negation -- depending on the well or ill behavior of the formula connected to it. However, as we shall see, in the hierarchy Nn we can not reiterate negations with different behaviors in a same formula (e.g., ¬p¬cα or ¬q¬c¬p α), or even analyze a formula like ¬cα → ¬pα. In view of these problems, can we really say that the hierarchy Nn allows us to understand the relationships and interactions of the three types of negations? In order to deal with this, given the initial problem, we will present four axiomatic systems (KG) in which, unlike Nn, the three negations are directly introduced -- offering a semantics and a method of proofs by analytic tableaux. Through the KG Systems we will show how the negations interact, obtaining non-demonstrable theorems in LPC, Cn, Pn, and Nn (0 ≤ n ≤ ω). Finally, we will also offer a first-order extension for the KG Systems. (shrink)

In this paper I introduce the idea of a higher-order modal logic—not a modal logic for higher-order predicate logic, but rather a logic of higher-order modalities. “What is a higher-order modality?”, you might be wondering. Well, if a first-order modality is a way that some entity could have been—whether it is a mereological atom, or a mereological complex, or the universe as a whole—a higher-order modality is a way that a first-order modality could have been. First-order modality is modeled in (...) terms of a space of possible worlds—a set of worlds structured by an accessibility relation, i.e., a relation of relative possibility—each world representing a way that the entire universe could have been. A second-order modality would be modeled in terms of a space of spaces of (first-order) possible worlds, each space representing a way that (first-order) possible worlds could have been. And just as there is a unique actual world which represents the way that things actually are, there is a unique actual space which represents the way that first-order modality actually is. -/- One might wonder what the accessibility relation itself is like. Presumably, if it is logical or metaphysical modality that is being dealt with, it is reflexive; but is it also symmetric, or transitive? Especially in the case of metaphysical modality, the answer is not clear. And whichever of these properties it may or may not have, could that itself have been different? Could at least some rival modal logics represent different ways that first-order modality could have been? -/- To be clear, the idea behind my proposal is not just that some things which are possible or necessary might not have been so at the first order, as determined by the actual accessibility relation, but also that the actual accessibility relation, and hence the nature or structure of actual modality, could have been different at some higher order of modality. Even if the accessibility relation is actually both symmetric and transitive, perhaps it could (second-order) have been otherwise: There is a (second-order) possible space of worlds in which it is different, where it fails to be symmetric, or transitive. We must, therefore, introduce the notion of a higher-order accessibility relation, one that in this case relates spaces of first-order worlds. The question then arises as to whether that relation is symmetric, or transitive. We can then consider third-order modalities, spaces of spaces of spaces of possible worlds, where the second-order accessibility relation differs from how it actually is. I can see no reason why there should be a limit to this hierarchy of higher-order modalities, any more than I can see a reason why there should be a limit to the hierarchy of higher-order properties. There will thus be an infinity of orders, one for each positive integer, and each order will have an accessibility relation of its own. To keep things as clear as possible, a space of first-order points (i.e., of possible worlds) shall be called a galaxy, a space of second-order points, a universe, and a space of any higher order, a cosmos. However, to keep things as simple as possible, in what follows I will deal with but a single cosmos, and hence will not deal with modalities higher than the third order. -/- The accessibility relation is not the only thing that might be thought to vary between spaces of worlds: Perhaps the contents of the spaces can vary as well. While I presume that the contents of the worlds themselves remain constant—it makes doubtful sense to suppose that in one space some entity e exists in a world w and in another space e doesn’t exist in that same world w—we may suppose that different spaces differ as to which worlds they contain, just as different worlds may differ as to which objects they contain. Thus we might have a higher-order analogue of a variable-domain modal logic. There seem, then, to be three ways in which spaces can differ: First, as to the properties of the accessibility relation; second, as to which worlds the relation relates; and third, as to which worlds or spaces are parts of their domains. -/- The paper will be structured as follows. In Section 2 I provide some reasons why one might want to pursue this kind of project in the first place. In Section 3 I outline the syntax and semantics of my proposed logic. Section 4 covers semantic tableaux for this system; and after giving the rules for their construction, I construct a few of them myself to establish some logical consequences of the system and give the reader a feel for how it works. In Sections 5, 6 and 7 I explore some of its potential philosophical implications for areas besides logic, namely the philosophy of language; metaphysics, including the metaphysics of modality and the philosophy of time, and finally the philosophy of religion, before concluding the paper in Section 8. (shrink)

This work studies some problems connected to the role of negation in logic, treating the positive fragments of propositional calculus in order to deal with two main questions: the proof of the completeness theorems in systems lacking negation, and the puzzle raised by positive paradoxes like the well-known argument of Haskel Curry. We study the constructive com- pleteness method proposed by Leon Henkin for classical fragments endowed with implication, and advance some reasons explaining what makes difficult to extend this (...) constructive method to non-classical fragments equipped with weaker implications (that avoid Curry's objection). This is the case, for example, of Jan Lukasiewicz's n-valued logics and Wilhelm Ackermann's logic of restricted implication. Besides such problems, both Henkin's method and the triviality phenomenon enable us to propose a new positive tableau proof system which uses only positive meta-linguistic resources, and to mo- tivate a new discussion concerning the role of negation in logic proposing the concept of paratriviality. In this way, some relations between positive reasoning and infinity, the possibilities to obtain a ¯first-order positive logic as well as the philosophical connection between truth and meaning are dis- cussed from a conceptual point of view. (shrink)

Motivated by H. Curry’s well-known objection and by a proposal of L. Henkin, this article introduces the positive tableaux, a form of tableau calculus without refutation based upon the idea of implicational triviality. The completeness of the method is proven, which establishes a new decision procedure for the (classical) positive propositional logic. We also introduce the concept of paratriviality in order to contribute to the question of paradoxes and limitations imposed by the behavior of classical implication.

In this paper we give an analytic tableau calculus P L 1 6 for a functionally complete extension of Shramko and Wansing’s logic. The calculus is based on signed formulas and a single set of tableau rules is involved in axiomatising each of the four entailment relations ⊧ t, ⊧ f, ⊧ i, and ⊧ under consideration—the differences only residing in initial assignments of signs to formulas. Proving that two sets of formulas are in one of the first three entailment (...) relations will in general require developing four tableaux, while proving that they are in the ⊧ relation may require six. (shrink)

According to the standard view in philosophy, intentionality is the mark of genuine action. In psychology, human cognition and agency are now widely explained in terms of the workings of two distinct systems (or types of processes), and intentionality is not a central notion in this dual-system theory. Further, it is often claimed, in psychology, that most human actions are automatic, rather than consciously controlled. This raises pressing questions. Does the dual-system theory preserve the philosophical account of intentional action? (...) How much of our behavior is intentional according to this view? And what is the role of consciousness? I will propose here a revised account of intentional action within the dual-system framework, and we will see that most of our behavior can qualify as intentional, even if most of it is automatic. An important lesson will be that philosophical accounts of intentional action need to pay more attention to the role of consciousness in action. (shrink)

Temporal epistemic logics are known, from results of Halpern and Vardi, to have a wide range of complexities of the satisfiability problem: from PSPACE, through non-elementary, to highly undecidable. These complexities depend on the choice of some key parameters specifying, inter alia, possible interactions between time and knowledge, such as synchrony and agents' abilities for learning and recall. In this work we develop practically implementable tableau-based decision procedures for deciding satisfiability in single-agent synchronous temporal-epistemic logics with interactions between time and (...) knowledge. We discuss some complications that occur, even in the single-agent case, when interactions between time and knowledge are assumed and show how the method of incremental tableaux can be adapted to work in EXPSPACE, respectively 2EXPTIME, for these logics, thereby also matching the upper bounds obtained for them by Halpern and Vardi. (shrink)

Dung’s argumentation frameworks are formalisms widely used to model interaction among arguments. Although their study has been profusely developed in the field of Artificial Intelligence, it is not common to see its treatment among those less connected to computer science within the logical-philosophical community. In this paper we propose to bring to that audience a proof-theory for argument justification based on tableaux, very similar to those the Logic students are familiar with. The tableaux enable to calculate whether an (...) argument or subset of arguments are accepted or rejected in accordance to Dung’s preferred and grounded extension-based semantics. Soundness and completeness results regarding those semantics are provided. (shrink)

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

Far from being indiscriminately critical of the ideas he associated with the morality system, Bernard Williams offered vindicatory explanations of its crucial building blocks, such as the moral/non-moral distinction, the idea of obligation, the voluntary/involuntary distinction, and the practice of blame. The rationale for these concessive moves, I argue, is that understanding what these ideas do for us when they are not in the service of the system is just as important to leading us out of the system as the (...) critique of that system. I then show how regarding the aspiration to shelter life from luck as the system’s organizing ambition explains why the system elaborates and combines these building blocks in the way it does. Finally, I argue that the ultimate problem with the resulting construction is its frictionless purity. It robs valuable concepts of their grip on the world we live in, and, by insisting on purity from contingency, threatens to issue in nihilism about value and scepticism about agency. (shrink)

Background: The castor bean is a large grassy or semi-wooden shrub or small tree. Any part of the castor plant parts can suffering from a disease that weakens the ability to grow and eliminates its production. Therefore, in this paper will identify the pests and diseases present in castor culture and detect the symptoms in each disease. Also images is showing the symptom form in this disease. Objectives: The main objective of this expert system is to obtain appropriate diagnosis of (...) the disease. Methods: In this paper, the expert system is designed for the ability of agricultural engineers to detect and diagnose disease of castor like as: seeding blight, alternaria blight, cercospora leaf spot, powdery mildew and wilt. This system presents the disease symptoms, survival and spread, favorable conditions and image for each disease. Clips and Delphi expert system languages are used for designing and implementing the proposed expert system. Results: The expert system in the diagnosis of castor diseases was assessed by farmers and agricultural engineers and they were satisfied and accepted with its quality of performance. Conclusions: The expert system is easy for farmers and people have experience in the plant of castor to detect and diagnosis the symptoms that may face this plant from several disease. (shrink)

This paper investigates the nature of dispositional properties in the context of artificial intelligence systems. We start by examining the distinctive features of natural dispositions according to criteria introduced by McGeer (2018) for distinguishing between object-centered dispositions (i.e., properties like ‘fragility’) and agent-based abilities, including both ‘habits’ and ‘skills’ (a.k.a. ‘intelligent capacities’, Ryle 1949). We then explore to what extent the distinction applies to artificial dispositions in the context of two very different kinds of artificial systems, one based (...) on rule-based classical logic and the other on reinforcement learning. Here we defend three substantive claims. First, we argue that artificial systems are not equal in the kinds of dispositional properties they instantiate. In particular, we show that logical systems instantiate merely object-centered dispositions whereas reinforcement learning systems allow for the instantiation of agent-based abilities. Second, we explore the similarities and differences between the agent-centered abilities of artificial systems and those of humans, especially as relates to the important distinction made in the human case between habits and skills/intelligent capacities. The upshot is that the agent-centered abilities of truly intelligent artificial systems are distinctive enough to constitute a third type of agent-based ability — blended agent-based ability — raising substantial questions as to how we understand the nature of their agency. Third, we explore one aspect of this problem, focussing on whether systems of this type are properly considered ‘responsible agents’, at least in some contexts and for some purposes. The ramifications of our analysis will turn out to be directly relevant to various ethical concerns of artificial intelligence. (shrink)

This article presents the first, systematic analysis of the ethical challenges posed by recommender systems through a literature review. The article identifies six areas of concern, and maps them onto a proposed taxonomy of different kinds of ethical impact. The analysis uncovers a gap in the literature: currently user-centred approaches do not consider the interests of a variety of other stakeholders—as opposed to just the receivers of a recommendation—in assessing the ethical impacts of a recommender system.

It is now widely accepted that a scientifically credible conception of human nature must reject the folkbiological idea of a fixed, inner essence that makes us human. We argue here that to understand human nature is to understand the plastic process of human development and the diversity it produces. Drawing on the framework of developmental systems theory and the idea of developmental niche construction we argue that human nature is not embodied in only one input to development, such as (...) the genome, and that it should not be confined to universal or typical human characteristics. Both similarities and certain classes of differences are explained by a human developmental system that reaches well out into the 'environment'. We point to a significant overlap between our account and the ‘Life History Trait Cluster’ account of Grant Ramsey, and defend the developmental systems account against the accusation that trying to encompass developmental plasticity and human diversity leads to an unmanageably complex account of human nature. (shrink)

Chest pain is the pain felt in the chest by infants, children and adolescents. In most cases the pain is not associated with the heart. It is mainly recognized by the observance or report of pain by the infant, child or adolescent by reports of distress by parents or care givers. Chest pain is not unusual in children. Lots of children are seen in ambulatory clinics, emergency rooms and hospitals and cardiology clinics. Usually there is a benign cause for the (...) pain for utmost children. Certain patients have conditions that are serious and perhaps life-threatening. Chest pain in pediatric patients needs careful physical examination and a detailed history that would point to the possibility of a serious cause. Researches of pediatric chest pain are scarce. It has been difficult to create evidence-based guidelines for evaluation. In this paper we propose an expert system to help doctors and parents, and care giver in diagnosing chest pain in infants and children. This expert System is design and implemented in SL5 Object language. (shrink)

We propose a new approach to the study of introspection. Instead of asking what form introspection actually takes in humans or other animals, we ask what forms it could take, in natural or artificial minds. What are the dimensions along which forms of introspection could vary? This is a relatively unexplored question, but it is one that has the potential to open new avenues of study and reveal new connections between existing ones. It may, for example, focus attention on possible (...) forms of introspection radically different from the human one and help to integrate competing theories of human introspection in a non-adversarial manner. We introduce and motivate the project, provide a preliminary mapping of the space of possible forms of introspection, and sketch a programme for interdisciplinary research on the topic. (shrink)

Griffiths and Russell D. Gray (1994, 1997, 2001) have argued that the fundamental unit of analysis in developmental systems theory should be a process – the life cycle – and not a set of developmental resources and interactions between those resources. The key concepts of developmental systems theory, epigenesis and developmental dynamics, both also suggest a process view of the units of development. This chapter explores in more depth the features of developmental systems theory that favour treating (...) processes as fundamental in biology and examines the continuity between developmental systems theory and ideas about process in the work of several major figures in early 20th century biology, most notable C.H Waddington. (shrink)

Developmental systems theory (DST) is a wholeheartedly epigenetic approach to development, inheritance and evolution. The developmental system of an organism is the entire matrix of resources that are needed to reproduce the life cycle. The range of developmental resources that are properly described as being inherited, and which are subject to natural selection, is far wider than has traditionally been allowed. Evolution acts on this extended set of developmental resources. From a developmental systems perspective, development does not proceed (...) according to a preformed plan; what is inherited is much more than DNA; and evolution is change not only in gene frequencies, but in entire developmental systems. (shrink)

In this reply to James H. Fetzer’s “Minds and Machines: Limits to Simulations of Thought and Action”, I argue that computationalism should not be the view that (human) cognition is computation, but that it should be the view that cognition (simpliciter) is computable. It follows that computationalism can be true even if (human) cognition is not the result of computations in the brain. I also argue that, if semiotic systems are systems that interpret signs, then both humans and (...) computers are semiotic systems. Finally, I suggest that minds can be considered as virtual machines implemented in certain semiotic systems, primarily the brain, but also AI computers. In doing so, I take issue with Fetzer’s arguments to the contrary. (shrink)

In fact, people get neck problems due to something such as sports or woke and Wrong sleep habits. In this paper an expert system was designed to help users to correctly diagnose neck problems world (muscle spasm, Muscle aches, Meningitis, herniated cervical disc, Fibromyalgia, Cervical spondylosis, Trigger points) with some information about the disease and self-care. Java language was used to design and implement this expert system.

With the advent of computers in the experimental labs, dynamic systems have become a new tool for research on problem solving and decision making. A short review of this research is given and the main features of these systems (connectivity and dynamics) are illustrated. To allow systematic approaches to the influential variables in this area, two formal frameworks (linear structural equations and finite state automata) are presented. Besides the formal background, the article sets out how the task demands (...) of system identification and system control can be realised in these environments, and how psychometrically acceptable dependent variables can be derived. (shrink)

Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.

In "Freedom and Resentment" P.F. Strawson, famously, advances a strong form of naturalism that aims to discredit kcepticism about moral responsibility by way of approaching these issues through an account of our reactive attitudes. However, even those who follow Strawson's general strategy on this subject accept that his strong naturalist program needs to be substantially modified, if not rejected. One of the most influential and important efforts to revise and reconstruct the Strawsonian program along these lines has been provided by (...) R. Jay Wallace, who presents a "narrower" construal of our reactive attitudes in his own account of what is involved in holding an agent responsible. In this paper I argue that Wallace's narrow construal of responsibility comes at too high a cost and that naturalists of a broadly Strawsonian cast should reject it. Related to this point, I argue that Wallace's narrow conception of responsibility is a product of his effort to construct his account within the confines of "the morality system" (i.e. as described by Bernard Williams) and that this way of construing responsibility leads into series of unnecessary and misleading oppositions. A more plausible middle path, I maintain, can be found between Strawson's excessively strong naturalist program and Wallace's narrow and restrictive view of responsibility. (shrink)

This paper is an original attempt to understand the foundations of economic reasoning. It endeavors to rigorously define the relationship between subjective interpretations and objective valuations of such interpretations in the context of theoretical economics. This analysis is substantially expanded through a dynamic approach, where the truth of a valuation results in an updated interpretation or changes in the agent's subjective belief regarding the effectiveness of the selected action as well as the objective reality of the effectiveness of all other (...) possible actions (i.e. consequence realization). Complications arise when the economic agent is presented with a set of actions that render ambiguous preference, or when the effectiveness of an action cannot be perceived upon its selection, thereby necessitating a different theory of choice and consequence realization. (shrink)

There is no doubt that custard apple diseases are among the important reasons that destroy the Custard Apple plant and its agricultural crops. This leads to obvious damage to these plants and they become inedible. Discovering these diseases is a good step to provide the appropriate and correct treatment. Determining the treatment with high accuracy depends on the method used to correctly diagnose the disease, expert systems can greatly help in avoiding damage to these plants. The expert system correctly (...) diagnoses Custard Apple disease to make it easier for farmers to find the right treatment based on the appropriate diagnosis. Objectives: A specialized syllable language system was established for the diagnosis of Custard Apple plant disease. (shrink)

From Hegel's philosophy of nature, this essay develops a critique of economic models and market society, based on Hegel's notion of what it takes for a formally described system to be embodied and real.

In this paper the central ideas and history of the theory of complex systems are described. It is shown how this theory lends itself to different interpretations and, correspondingly, to different political conclusions.

In this paper we apply the popular Best System Account of laws to typical eternal worlds – both classical eternal worlds and eternal worlds of the kind posited by popular contemporary cosmological theories. We show that, according to the Best System Account, such worlds will have no laws that meaningfully constrain boundary conditions. It’s generally thought that lawful constraints on boundary conditions are required to avoid skeptical arguments. Thus the lack of such laws given the Best System Account may seem (...) like a severe problem for the view. We show, however, that at eternal worlds, lawful constraints on boundary conditions do little to help fend off skeptical worries. So with respect to handling these skeptical worries, the proponent of the Best System Account is no worse off than their competitors. (shrink)

Reserve systems are a tool to allocate scarce resources when stakeholders do not have a single objective. This paper introduces some basic concepts about reserve systems for pandemic medical resource allocation. At the onset of the Covid-19 pandemic, we proposed that reserve systems can help practitioners arrive at compromises between competing stakeholders. More than a dozen states and local jurisdictions adopted reserve systems in initial phases of vaccine distribution. We highlight several design issues arising in some (...) of these implementations. We also offer suggestions about ways practitioners can take advantage of the flexibility offered by reserve systems. (shrink)

This paper studies proof systems for the logics of super-strict implication ST2–ST5, which correspond to C.I. Lewis’ systems S2–S5 freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating STn in Sn and backsimulating Sn in STn, respectively(for n=2,...,5). Next, G3-style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive of G3-style calculi, that they are sound (...) and complete, and it is shown that the proof search for G3. ST2 is terminating and therefore the logic is decidable. (shrink)

Background: Mint is a grassy, perennial plant, belonging to the oral platoon, fast growing and spreading, its leaves are green in color, fragrant, tart, refreshing, square-shaped leg, bifurcated, erect, ranging in height from (10 - 201 cm). Home to Europe and Asia. The mint plant has many benefits, the most important of which are pain relief, treatment of gallbladder disorders, the expulsion of gases, anti-inflammatory, and relaxing nerves. While the mint plant is the ideal option for the start of gardens, (...) it is prone to some common diseases that affect the plant's growth. Objectives: The main goal of this expert system is to get the appropriate diagnosis of disease and the correct treatment. Methods: In this paper, the design of the proposed Expert System was produced to help Farmers and those interested in agriculture in diagnosing many of the Mint diseases such as Mint rust, Verticillium wilt, Anthracnose, Powdery mildew, Black Stem Rot, Stem and stolon canker, Septoria leaf spot. The proposed expert system presents an overview of mint diseases are given, the cause of diseases outlined and the treatment of disease whenever possible is given out. CLIPS Expert System language was used for designing and implementing the proposed expert system. Results: The proposed Mint diseases diagnosis expert system was evaluated by Agricultural Students at AL Azhar University and some friends interested in agriculture and they were satisfied with its performance. Conclusions: The proposed expert system is very useful for Farmers and those interested in agriculture. (shrink)

The human body is a system made of systems. The body is divided into bodily systems proper, such as the endocrine and circulatory systems, which are subdivided into many sub-systems at a variety of levels, whereby all systems and subsystems engage in massive causal interaction with each other and with their surrounding environments. Here we offer an explicit definition of bodily system and provide a framework for understanding their causal interactions. Medical sciences provide at best (...) informal accounts of basic notions such as system, process, and function, and while such informality is acceptable in documentation created for human beings, it falls short of what is needed for computer representations. In our analysis we will accordingly provide the framework for a formal definition of bodily system and of associated notions. (shrink)

Cognition is commonly taken to be computational manipulation of representations. These representations are assumed to be digital, but it is not usually specified what that means and what relevance it has for the theory. I propose a specification for being a digital state in a digital system, especially a digital computational system. The specification shows that identification of digital states requires functional directedness, either for someone or for the system of which it is a part. In the case or digital (...) representations, to be a token of a representational type, where the function of the type is to represent. [An earlier version of this paper was discussed in the web-conference "Interdisciplines" https://web.archive.org/web/20100221125700/http://www.interdisciplines.org/adaptation/papers/7 ]. (shrink)

Abstract: Background: In spite of the fact that computers continue to improve in speed and functions operation, they remain complex to use. Problems frequently happen, and it is hard to resolve or find solutions for them. This paper outlines the significance and feasibility of building a desktop PC problems diagnosis system. The system gathers problem symptoms from users’ desktops, rather than the user describes his/her problems to primary search engines. It automatically searches global databases of problem symptoms and solutions, and (...) also allows ordinary users to contribute exact problem reports in a structured manner. Objectives: The main goal of this Knowledge Based System is to get the suitable problem desktop PC symptoms and the correct way to solve the errors. Methods: In this paper the design of the proposed Knowledge Based System which was produced to help users of desktop PC in knowing many of the problems and error such as : Power supply problems, CPU errors, RAM dumping error, hard disk errors and bad sectors and suddenly restarting PC. The proposed Knowledge Based System presents an overview about desktop PC hardware errors are given, the cause of fault are outlined and the solution to the problems whenever possible is given out. CLIPS Knowledge Based System language was used for designing and implementing the proposed expert system. Results: The proposed PC desktop troubleshooting Knowledge Based System was evaluated by IT students and they were satisfied with its performance. (shrink)

We present an elementary system of axioms for the geometry of Minkowski spacetime. It strikes a balance between a simple and streamlined set of axioms and the attempt to give a direct formalization in first-order logic of the standard account of Minkowski spacetime in [Maudlin 2012] and [Malament, unpublished]. It is intended for future use in the formalization of physical theories in Minkowski spacetime. The choice of primitives is in the spirit of [Tarski 1959]: a predicate of betwenness and a (...) four place predicate to compare the square of the relativistic intervals. Minkowski spacetime is described as a four dimensional ‘vector space’ that can be decomposed everywhere into a spacelike hyperplane - which obeys the Euclidean axioms in [Tarski and Givant, 1999] - and an orthogonal timelike line. The length of other ‘vectors’ are calculated according to Pythagora’s theorem. We conclude with a Representation Theorem relating models of our system that satisfy second order continuity to the mathematical structure called ‘Minkowski spacetime’ in physics textbooks. (shrink)

An increasing number of regulations propose the notion of ‘AI audits’ as an enforcement mechanism for achieving transparency and accountability for artificial intelligence (AI) systems. Despite some converging norms around various forms of AI auditing, auditing for the purpose of compliance and assurance currently have little to no agreed upon practices, procedures, taxonomies, and standards. We propose the ‘criterion audit’ as an operationalizable compliance and assurance external audit framework. We model elements of this approach after financial auditing practices, and (...) argue that AI audits should similarly provide assurance to their stakeholders about AI organizations’ ability to govern their algorithms in ways that mitigate harms and uphold human values. We discuss the necessary conditions for the criterion audit, and provide a procedural blueprint for performing an audit engagement in practice. We illustrate how this framework can be adapted to current regulations by deriving the criteria on which ‘bias audits’ for hiring algorithms can be performed, as required by the recently effective New York City Local Law 144 of 2021. We conclude by offering critical discussion on the benefits, inherent limitations, and implementation challenges of applying practices of the more mature financial auditing industry to AI auditing where robust guardrails against quality assurance issues are only starting to emerge. Our discussion as informed by experiences in performing these audits in practice highlights the critical role that an audit ecosystem plays in ensuring the effectiveness of such methodology. (shrink)

In recent years, an active research program has emerged that aims to develop a Humean best-system account (BSA) of laws of nature that improves on Lewis’s canonical articulation of the view. Its guiding idea is that the laws are cognitive tools tailored to the specific needs and limitations of creatures like us. While current versions of this “pragmatic Humean” research program fare much better than Lewis’s account along many dimensions, I will argue that they have trouble making sense of certain (...) key features of the practice of fundamental physics. Indeed, these features seem to go against the very idea that laws are useful for agents like us. In my view, Humeans can address these issues by paying more attention to the explanatory role of laws. Following this idea, I will propose an account on which what makes a systematization the best is a kind of explanatory power, understood along the lines of the unificationist theory of explanation. The resulting view, I will argue, can make sense of those features of laws that other pragmatic accounts of laws have trouble explaining. (shrink)

A computational theory of consciousness should include a quantitative measure of consciousness, or MoC, that (i) would reveal to what extent a given system is conscious, (ii) would make it possible to compare not only different systems, but also the same system at different times, and (iii) would be graded, because so is consciousness. However, unless its design is properly constrained, such an MoC gives rise to what we call the boundary problem: an MoC that labels a system as (...) conscious will do so for some – perhaps most – of its subsystems, as well as for irrelevantly extended systems (e.g., the original system augmented with physical appendages that contribute nothing to the properties supposedly supporting consciousness), and for aggregates of individually conscious systems (e.g., groups of people). This problem suggests that the properties that are being measured are epiphenomenal to consciousness, or else it implies a bizarre proliferation of minds. We propose that a solution to the boundary problem can be found by identifying properties that are intrinsic or systemic: properties that clearly differentiate between systems whose existence is a matter of fact, as opposed to those whose existence is a matter of interpretation (in the eye of the beholder). We argue that if a putative MoC can be shown to be systemic, this ipso facto resolves any associated boundary issues. As test cases, we analyze two recent theories of consciousness in light of our definitions: the Integrated Information Theory and the Geometric Theory of consciousness. (shrink)

Michael Lewin geht es in seinem Buch um die Vernunft als ein wohlbegründetes und in zeitgenössischen Kontexten fortführbares Forschungsprogramm. Dabei handelt es sich um eine Theorienreihe zu vielfältigen Arten und Funktionen der Ideen, mit deren Hilfe die Vernunft das Verstehen und Wollen steuert und selbstreflexiv wird. Dazu entwickelt der Autor unter dem Stichpunkt „reflektierter Perspektivismus“ das Programm einer perspektivistischen Metaphilosophie, die den Hintergrundparametern forschungsprogrammatische Festlegungen (in Anlehnung an Imre Lakatos), Ansprüche und (Wissens-)Ziele hinter den philosophischen Positionierungen nachspürt und dadurch ihre (...) Grenzen und Möglichkeiten offenlegt. (shrink)

Consciousness has been the bone of contention for philosophers throughout centuries. Indian philosophy largely adopted lived experience as the starting point for its explorations of consciousness. For this reason, from the very beginning, experience was an integral way of grasping consciousness, whose validity as a tool was considered self-evident. Thus, in Indian philosophy, the question was not to move from the brain to mind but to understand experience of an individual and how such an experience is determined through mental structures (...) (and secondarily, the preoccupation with the brain and its relation to the mind). In contrast, cognitive science (the study of mind and cognition through 1 interdisciplinary methods, with emphasis on computational methods) found its debates soaked in discussion which primarily involved the brain and mind. Experience was not considered a primary source of information and its validity had to be established to consider it a source of information of mind. With the rise of physicalism and realization that mental states are correlative to brain states, the body was virtually neglected from involvement in understanding the mind and the attempts to reduce mind to the brain were rampant. The inability to explain subjective experience of an individual through neuroscientific findings alone has urged philosophers to explore other ways of understanding the ontology of mind. Over the last few years, embodied cognition and enactive approach have brought back the body as a central participant in this debate, providing fertile grounds to explain the relation of brain, body and mind. This paper proposes that we understand the brain as a complex system from which the mind emerges. This emergence is marked by the development of novel property of self-consciousness in human beings. The mind is a process which is embedded throughout the body and thus, the body acts as an actualizing medium for the individual. Thus, the brain is a necessary condition for the mind to be while the mind is embedded throughout the body. The brain and mind are in reciprocal causal relationship with one another, as is the body and environment with one another. In this paper, embodied cognition is understood through principles of Merleau Ponty's idea of embodiment, than through Andy Clark and Francis Varela's alone. (shrink)