38 resultados para philosophical logic
em Queensland University of Technology - ePrints Archive
Resumo:
Concerns have been raised over ADHD from within a range of different disciplines, concerns which are not only voiced from within the hard sciences themselves, but also from within the social sciences. This paper will add the discipline of philosophy to that number, arguing that an analysis of two traditionally philosophical topics - namely "truth" and "free-will" - allows us a new and unsettling perspective on conduct disorders like ADHD. More specifically, it will be argued that ADHD not only fails to meet its own ontological and epistemological standards as an 'objective' pathology, but it also constitutes one more element in what has already become a significant undermining of a crucial component of social life: moral responsibility.
Resumo:
This paper has two central purposes: the first is to survey some of the more important examples of fallacious argument, and the second is to examine the frequent use of these fallacies in support of the psychological construct: Attention Deficit Hyperactivity Disorder (ADHD). The paper divides 12 familiar fallacies into three different categories—material, psychological and logical—and contends that advocates of ADHD often seem to employ these fallacies to support their position. It is suggested that all researchers, whether into ADHD or otherwise, need to pay much closer attention to the construction of their arguments if they are not to make truth claims unsupported by satisfactory evidence, form or logic.
Resumo:
Sets out a system of corporate governance regulation, aimed at combining legal and social methods of governing director behaviour and at creating a framework flexible enough to accommodate different business and ethical cultures. Outlines the theoretical basis of corporate governance and the broad responsibilities of directors, and discusses the extent to which they can and should be regulated. Discusses the constitution of a regulatory framework encompassing law, soft law and best practice, and ethics.
Resumo:
How interactive new media art can effectively communicate an indigenous philosophical concept. The sophistication and complexity of the philosophical concept concerning relationships between land and people and between people, intrinsic to the laws and customs of Australian Indigenous society, has begun to be communicated and accessed beyond the realm of anthropological and ethnological domains of Western scholarship. The exciting scope and rapid development of new media arts presents an innovative means of creating an interactive relationship with the general Australian public, addressing the urgent need for an understanding of Indigenous Australian concepts of relationship to land, and to each other, absent from Western narratives. The study is framed by an Indigenous concept of place, and relationships between land and people and between people; and explores how this concept can be clearly communicated through interactive new media arts. It involves: a creative project, the development of an interactive new media art project, a website work-in-progress titled site\sight\cite; and an exegesis, a Novella of Ideas, on the origins, influences, objectives, and potential of creative practices and processes engaged in the creative project. Research undertaken for the creative project and exegesis extended my creative practice into the use of interdisciplinary arts, expressly for the expression of philosophical concepts, consolidating 23 years experience in Indigenous community arts development. The creative project and exegesis contributes to an existing body of Indigenous work in a range of areas - including education, the arts and humanities - which bridges old and new society in Australia. In this study, old and new society is defined by the time of the initial production of art and foundations of knowledge, in the country of its origins, in Indigenous Australia dating back at least 40,000 years.
Resumo:
While it is commonly accepted that computability on a Turing machine in polynomial time represents a correct formalization of the notion of a feasibly computable function, there is no similar agreement on how to extend this notion on functionals, that is, what functionals should be considered feasible. One possible paradigm was introduced by Mehlhorn, who extended Cobham's definition of feasible functions to type 2 functionals. Subsequently, this class of functionals (with inessential changes of the definition) was studied by Townsend who calls this class POLY, and by Kapron and Cook who call the same class basic feasible functionals. Kapron and Cook gave an oracle Turing machine model characterisation of this class. In this article, we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalise the corresponding properties of the class of feasible functions, thus giving further evidence that the notion of feasibility of functionals mentioned above is correctly chosen. We also improve the Kapron and Cook result on machine representation.Our proofs are based on essential applications of logic. We introduce a weak fragment of second order arithmetic with second order variables ranging over functions from NN which suitably characterises basic feasible functionals, and show that it is a useful tool for investigating the properties of basic feasible functionals. In particular, we provide an example how one can extract feasible programs from mathematical proofs that use nonfeasible functions.
Resumo:
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds for learnability of these classes both from positive facts and from positive and negative facts. Building on Angluin’s notion of finite thickness and Wright’s work on finite elasticity, Shinohara defined the property of bounded finite thickness to give a sufficient condition for learnability of indexed families of computable languages from positive data. This paper shows that an effective version of Shinohara’s notion of bounded finite thickness gives sufficient conditions for learnability with ordinal mind change bound, both in the context of learnability from positive data and for learnability from complete (both positive and negative) data. Let Omega be a notation for the first limit ordinal. Then, it is shown that if a language defining framework yields a uniformly decidable family of languages and has effective bounded finite thickness, then for each natural number m >0, the class of languages defined by formal systems of length <= m: • is identifiable in the limit from positive data with a mind change bound of Omega (power)m; • is identifiable in the limit from both positive and negative data with an ordinal mind change bound of Omega × m. The above sufficient conditions are employed to give an ordinal mind change bound for learnability of minimal models of various classes of length-bounded Prolog programs, including Shapiro’s linear programs, Arimura and Shinohara’s depth-bounded linearly covering programs, and Krishna Rao’s depth-bounded linearly moded programs. It is also noted that the bound for learning from positive data is tight for the example classes considered.
Resumo:
Power system stabilizers (PSS) work well at the particular network configuration and steady state conditions for which they were designed. Once conditions change, their performance degrades. This can be overcome by an intelligent nonlinear PSS based on fuzzy logic. Such a fuzzy logic power system stabilizer (FLPSS) is developed, using speed and power deviation as inputs, and provides an auxiliary signal for the excitation system of a synchronous motor in a multimachine power system environment. The FLPSS's effect on the system damping is then compared with a conventional power system stabilizer's (CPSS) effect on the system. The results demonstrate an improved system performance with the FLPSS and also that the FLPSS is robust
Resumo:
Fuzzy logic has been applied to control traffic at road junctions. A simple controller with one fixed rule-set is inadequate to minimise delays when traffic flow rate is time-varying and likely to span a wide range. To achieve better control, fuzzy rules adapted to the current traffic conditions are used.