Results for 'deductive systems'

1000+ found
Order:
  1.  88
    Refutation Systems in Modal Logic.Valentin Goranko - 1994 - Studia Logica 53 (2):299 - 324.
    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.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  2.  96
    Computational Logic. Vol. 1: Classical Deductive Computing with Classical Logic.Luis M. Augusto - 2018 - London: College Publications.
    This is the first of a two-volume work combining two fundamental components of contemporary computing into classical deductive computing, a powerful form of computation, highly adequate for programming and automated theorem proving, which, in turn, have fundamental applications in areas of high complexity and/or high security such as mathematical proof, software specification and verification, and expert systems. Deductive computation is concerned with truth-preservation: This is the essence of the satisfiability problem, or SAT, the central computational problem in (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. On the Mutual Definability of the Notions of Entailment, Rejection, and Inconsistency.Urszula Wybraniec-Skardowska - 2016 - Axioms 5 (15).
    In this paper, two axiomatic theories T− and T′ are constructed, which are dual to Tarski’s theory T+ (1930) of deductive systems based on classical propositional calculus. While in Tarski’s theory T+ the primitive notion is the classical consequence function (entailment) Cn+, in the dual theory T− it is replaced by the notion of Słupecki’s rejection consequence Cn− and in the dual theory T′ it is replaced by the notion of the family Incons of inconsistent sets. The author (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  4. Logical Consequence in Modal Logic II: Some Semantic Systems for S4.George Weaver - 1974 - Notre Dame Journal of Formal Logic 15:370.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  5.  97
    Eliminating Undecidability and Incompleteness in Formal Systems.Pete Olcott - manuscript
    To eliminate incompleteness, undecidability and inconsistency from formal systems we only need to convert the formal proofs to theorem consequences of symbolic logic to conform to the sound deductive inference model. -/- Within the sound deductive inference model there is a (connected sequence of valid deductions from true premises to a true conclusion) thus unlike the formal proofs of symbolic logic provability cannot diverge from truth.
    Download  
     
    Export citation  
     
    Bookmark  
  6. Discovering Empirical Theories of Modular Software Systems. An Algebraic Approach.Nicola Angius & Petros Stefaneas - 2016 - In Vincent Müller (ed.), Computing and Philosophy: Selected Papers from IACAP 2014 (Synthese Library). Springer. pp. 99-115.
    This paper is concerned with the construction of theories of software systems yielding adequate predictions of their target systems’ computations. It is first argued that mathematical theories of programs are not able to provide predictions that are consistent with observed executions. Empirical theories of software systems are here introduced semantically, in terms of a hierarchy of computational models that are supplied by formal methods and testing techniques in computer science. Both deductive top-down and inductive bottom-up approaches (...)
    Download  
     
    Export citation  
     
    Bookmark  
  7. Meta-Ethics and Analysis of Language From Wittgenstein to Deontic Logic Systems.Maurilio Lovatti - 2007 - Analysis and Metaphysics 6:120-135.
    In this paper, partly historical and partly theoretical, after having shortly outlined the development of the meta-ethics in the 1900?s starting from the Tractatus of Wittgenstein, I argue it is possible to sustain that emotivism and intuitionism are unsatisfactory ethical conceptions, while on the contrary, reason (intended in a logical-deductive sense) plays an effective role both in ethical discussions and in choices. There are some characteristics of the ethical language (prescriptivity, universalizability and predominance) that cannot be eluded (pain the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. Rejection in Łukasiewicz's and Słupecki's Sense.Urszula Wybraniec-Skardowska - 2018 - In Urszula Wybraniec-Skardowska & Ángel Garrido (eds.), The Lvov-Warsaw School. Past and Present. Basel, Switzerland: pp. 575-597.
    The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (...)
    Download  
     
    Export citation  
     
    Bookmark  
  9.  74
    Rejection in Łukasiewicz's and Słupecki' Sense.Urszula Wybraniec-Skardowska - 2018 - Lvov-Warsaw School. Past and Present.
    The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz [20]. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions [22, 23]. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  10.  50
    Proving Unprovability in Some Normal Modal Logics.Valentin Goranko - 1991 - Bulletin of the Section of Logic 20 (1):23-29.
    This note considers deductive systems for the operator a of unprovability in some particular propositional normal modal logics. We give thus complete syntactic characterization of these logics in the sense of Lukasiewicz: for every formula  either `  or a  (but not both) is derivable. In particular, purely syntactic decision procedure is provided for the logics under considerations.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  11. Modal Logic with Names.George Gargov & Valentin Goranko - 1993 - Journal of Philosophical Logic 22 (6):607 - 636.
    We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...)
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  12.  86
    The Logicality of Language: A New Take on Triviality, `Ungrammaticality', and Logical Form.Guillermo Del Pinal - 2019 - Noûs 53 (4):785-818.
    Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth‐conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the ‘logicality of language’, accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter‐examples consisting of acceptable tautologies and contradictions, the logicality of language is often (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  13. The Logicality of Language: A New Take on Triviality, “Ungrammaticality”, and Logical Form.Guillermo Del Pinal - 2019 - Noûs 53 (4):785-818.
    Recent work in formal semantics suggests that the language system includes not only a structure building device, as standardly assumed, but also a natural deductive system which can determine when expressions have trivial truth-conditions (e.g., are logically true/false) and mark them as unacceptable. This hypothesis, called the `logicality of language', accounts for many acceptability patterns, including systematic restrictions on the distribution of quantifiers. To deal with apparent counter-examples consisting of acceptable tautologies and contradictions, the logicality of language is often (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  14.  76
    Hierarchies of Modal and Temporal Logics with Reference Pointers.Valentin Goranko - 1996 - Journal of Logic, Language and Information 5 (1):1-24.
    We introduce and study hierarchies of extensions of the propositional modal and temporal languages with pairs of new syntactic devices: point of reference-reference pointer which enable semantic references to be made within a formula. We propose three different but equivalent semantics for the extended languages, discuss and compare their expressiveness. The languages with reference pointers are shown to have great expressive power (especially when their frugal syntax is taken into account), perspicuous semantics, and simple deductive systems. For instance, (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  15. Supervaluationism and Classical Logic.Pablo Cobreros - 2011 - In Rick Nouwen, Robert van Rooij, Hans-Christian Schmitz & Uli Sauerland (eds.), Vagueness in Communication, Lecture Notes in Computer Science, Vol. 6517. Springer.
    This paper is concerned with the claim that supervaluationist consequence is not classical for a language including an operator for definiteness. Although there is some sense in which this claim is uncontroversial, there is a sense in which the claim must be qualified. In particular I defend Keefe's position according to which supervaluationism is classical except when the inference from phi to Dphi is involved. The paper provides a precise content to this claim showing that we might provide complete (and (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  16. On Deductionism.Dan Bruiger - manuscript
    Deductionism assimilates nature to conceptual artifacts (models, equations), and tacitly holds that real physical systems are such artifacts. Some physical concepts represent properties of deductive systems rather than of nature. Properties of mathematical or deductive systems can thereby sometimes falsely be ascribed to natural systems.
    Download  
     
    Export citation  
     
    Bookmark  
  17.  54
    On Graph-Theoretic Fibring of Logics.A. Sernadas, C. Sernadas, J. Rasga & M. Coniglio - 2009 - Journal of Logic and Computation 19 (6):1321-1357.
    A graph-theoretic account of fibring of logics is developed, capitalizing on the interleaving characteristics of fibring at the linguistic, semantic and proof levels. Fibring of two signatures is seen as a multi-graph (m-graph) where the nodes and the m-edges include the sorts and the constructors of the signatures at hand. Fibring of two models is a multi-graph (m-graph) where the nodes and the m-edges are the values and the operations in the models, respectively. Fibring of two deductive systems (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  18.  44
    Teoria zdań odrzuconych.Urszula Wybraniec-Skardowska - 1969 - Dissertation, Opole University
    This is the PhD dissertation, written under supervision of Professor Jerzy Słupecki, published in the book: U.Wybraniec-Skardowska i Grzegorz Bryll "Z badań nad teorią zdań odrzuconych" ( "Studies of theory of rejected sentences"), Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Seria B: Studia i Monografie nr 22, pp. 5-131. It is the first, original publication on the theory of rejected sentences on which are based, among other, papers: "Theory of rejected propositions. I"and "Theory of rejected propositions II" with Jerzy Słupecki (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  19. A Different Approach to Logic: Absolute Logic.Mauro Avon - 2020 - Dissertation, Università Degli Studi di Udine
    The paper is about 'absolute logic': an approach to logic that differs from the standard first-order logic and other known approaches. It should be a new approach the author has created proposing to obtain a general and unifying approach to logic and a faithful model of human mathematical deductive process. In first-order logic there exist two different concepts of term and formula, in place of these two concepts in our approach we have just one notion of expression. In our (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20.  74
    Rejection in Łukasiewicz's and Słupecki's Sense.Wybraniec-Skardowska Urszula - 2018 - In The Lvov-Warsaw School, Past and Present. Cham: pp. 575-597.
    The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  21. Some Comments on Ian Rumfitt’s Bilateralism.Nils Kürbis - 2016 - Journal of Philosophical Logic 45 (6):623-644.
    Ian Rumfitt has proposed systems of bilateral logic for primitive speech acts of assertion and denial, with the purpose of ‘exploring the possibility of specifying the classically intended senses for the connectives in terms of their deductive use’ : 810f). Rumfitt formalises two systems of bilateral logic and gives two arguments for their classical nature. I assess both arguments and conclude that only one system satisfies the meaning-theoretical requirements Rumfitt imposes in his arguments. I then formalise an (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  22. The Founding of Logic.John Corcoran - 1994 - Ancient Philosophy 14 (S1):9-24.
    Since the time of Aristotle's students, interpreters have considered Prior Analytics to be a treatise about deductive reasoning, more generally, about methods of determining the validity and invalidity of premise-conclusion arguments. People studied Prior Analytics in order to learn more about deductive reasoning and to improve their own reasoning skills. These interpreters understood Aristotle to be focusing on two epistemic processes: first, the process of establishing knowledge that a conclusion follows necessarily from a set of premises (that is, (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  23.  39
    How to Prove the Consistency of Arithmetic.Jaakko Hintikka & Besim Karakadilar - 2006 - Acta Philosophica Fennica 78:1.
    It is argued that the goal of Hilbert's program was to prove the model-theoretical consistency of different axiom systems. This Hilbert proposed to do by proving the deductive consistency of the relevant systems. In the extended independence-friendly logic there is a complete proof method for the contradictory negations of independence-friendly sentences, so the existence of a single proposition that is not disprovable from arithmetic axioms can be shown formally in the extended independence-friendly logic. It can also be (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  24.  44
    Probabilities on Sentences in an Expressive Logic.Marcus Hutter, John W. Lloyd, Kee Siong Ng & William T. B. Uther - 2013 - Journal of Applied Logic 11 (4):386-420.
    Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive languages like higher-order logic are ideally suited for representing and reasoning about structured knowledge. Uncertain knowledge can be modeled by using graded probabilities rather than binary truth-values. The main technical problem studied in this paper is the following: Given a set of sentences, each having some probability of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  25.  72
    Expressing Truth Directly Within a Formal System with No Need for Model Theory.Pete Olcott - manuscript
    Because formal systems of symbolic logic inherently express and represent the deductive inference model formal proofs to theorem consequences can be understood to represent sound deductive inference to deductive conclusions without any need for other representations.
    Download  
     
    Export citation  
     
    Bookmark  
  26. Philosophy of Logic – Reexamining the Formalized Notion of Truth.Pete Olcott - manuscript
    Because formal systems of symbolic logic inherently express and represent the deductive inference model formal proofs to theorem consequences can be understood to represent sound deductive inference to true conclusions without any need for other representations such as model theory.
    Download  
     
    Export citation  
     
    Bookmark  
  27. Judaic Logic: A Formal Analysis of Biblical, Talmudic and Rabbinic Logic.Avi Sion - 1995, 1997 - Geneva, Switzerland: Slatkine; CreateSpace & Kindle; Lulu..
    Judaic Logic is an original inquiry into the forms of thought determining Jewish law and belief, from the impartial perspective of a logician. Judaic Logic attempts to honestly estimate the extent to which the logic employed within Judaism fits into the general norms, and whether it has any contributions to make to them. The author ranges far and wide in Jewish lore, finding clear evidence of both inductive and deductive reasoning in the Torah and other books of the Bible, (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  28.  45
    Mrs.Sahar Zabihidan - manuscript
    For many years, the human need for the group, social life, and the impact of this form of life on mental health and body have been discussed. This is said to be less about loneliness and the role played by human beings. Loneliness is a global issue experienced by all humans more or less and with their lives. In other words, many people with races, cultures, social classes, and at different ages and times each experience some kind of loneliness. It (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29. Against Deductive Closure.Paul D. Thorn - 2017 - Theoria 83 (2):103-119.
    The present article illustrates a conflict between the claim that rational belief sets are closed under deductive consequences, and a very inclusive claim about the factors that are sufficient to determine whether it is rational to believe respective propositions. Inasmuch as it is implausible to hold that the factors listed here are insufficient to determine whether it is rational to believe respective propositions, we have good reason to deny that rational belief sets are closed under deductive consequences.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  30. Communist Conventions for Deductive Reasoning.Sinan Dogramaci - 2015 - Noûs 49 (4):776-799.
    In section 1, I develop epistemic communism, my view of the function of epistemically evaluative terms such as ‘rational’. The function is to support the coordination of our belief-forming rules, which in turn supports the reliable acquisition of beliefs through testimony. This view is motivated by the existence of valid inferences that we hesitate to call rational. I defend the view against the worry that it fails to account for a function of evaluations within first-personal deliberation. In the rest of (...)
    Download  
     
    Export citation  
     
    Bookmark   21 citations  
  31. Deductive Cogency, Understanding, and Acceptance.Finnur Dellsén - 2018 - Synthese 195 (7):3121-3141.
    Deductive Cogency holds that the set of propositions towards which one has, or is prepared to have, a given type of propositional attitude should be consistent and closed under logical consequence. While there are many propositional attitudes that are not subject to this requirement, e.g. hoping and imagining, it is at least prima facie plausible that Deductive Cogency applies to the doxastic attitude involved in propositional knowledge, viz. belief. However, this thought is undermined by the well-known preface paradox, (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  32.  51
    On the Aim of Scientific Theories in Relating to the World: A Defence of the Semantic Account.Michael Baur - 1990 - Dialogue 29 (3):323-.
    According to the received view of scientific theories, a scientific theory is an axiomatic-deductive linguistic structure which must include some set of guidelines (“correspondence rules”) for interpreting its theoretical terms with reference to the world of observable phenomena. According to the semantic view, a scientific theory need not be formulated as an axiomatic-deductive structure with correspondence rules, but need only specify models which are said to be “isomorphic” with actual phenomenal systems. In this paper, I consider both (...)
    Download  
     
    Export citation  
     
    Bookmark  
  33.  99
    Logics of Formal Inconsistency Enriched with Replacement: An Algebraic and Modal Account.Walter Carnielli, Marcelo E. Coniglio & David Fuenmayor - manuscript
    One of the most expected properties of a logical system is that it can be algebraizable, in the sense that an algebraic counterpart of the deductive machinery could be found. Since the inception of da Costa's paraconsistent calculi, an algebraic equivalent for such systems have been searched. It is known that these systems are non self-extensional (i.e., they do not satisfy the replacement property). More than this, they are not algebraizable in the sense of Blok-Pigozzi. The same (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34.  75
    A Unified Framework for Building Ontological Theories with Application and Testing in the Field of Clinical Trials.Heller Barbara, Herre Heinrich & Barry Smith - 2001 - In IFOMIS Reports. Leipzig: University of Leipzig.
    The objective of this research programme is to contribute to the establishment of the emerging science of Formal Ontology in Information Systems via a collaborative project involving researchers from a range of disciplines including philosophy, logic, computer science, linguistics, and the medical sciences. The re­searchers will work together on the construction of a unified formal ontology, which means: a general framework for the construction of ontological theories in specific domains. The framework will be constructed using the axiomatic-deductive method (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. Deductively Sound Formal Proofs.P. Olcott - manuscript
    Could the intersection of [formal proofs of mathematical logic] and [sound deductive inference] specify formal systems having [deductively sound formal proofs of mathematical logic]? All that we have to do to provide [deductively sound formal proofs of mathematical logic] is select the subset of conventional [formal proofs of mathematical logic] having true premises and now we have [deductively sound formal proofs of mathematical logic].
    Download  
     
    Export citation  
     
    Bookmark  
  36.  69
    Philosophy of Logic – Reexamining the Formalized Notion of Truth.Pete Olcott - manuscript
    Tarski "proved" that there cannot possibly be any correct formalization of the notion of truth entirely on the basis of an insufficiently expressive formal system that was incapable of recognizing and rejecting semantically incorrect expressions of language. -/- The only thing required to eliminate incompleteness, undecidability and inconsistency from formal systems is transforming the formal proofs of symbolic logic to use the sound deductive inference model.
    Download  
     
    Export citation  
     
    Bookmark  
  37. Letter From a Gentleman in Dunedin to a Lady in the Countryside.Charles Pigden - 2010 - In Hume on Is and Ought.
    I argue 1) That in his celebrated Is/Ought passage, Hume employs ‘deduction’ in the strict sense, according to which if a conclusion B is justly or evidently deduced from a set of premises A, A cannot be true and B false, or B false and the premises A true. 2) That Hume was following the common custom of his times which sometimes employed ‘deduction’ in a strict sense to denote inferences in which, in the words of Dr Watts’ Logick, ‘the (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark  
  38.  18
    Logic of Faith and Dead. The Idea and Outline of the Theoretical Conception.Wybraniec-Skardowska Urszula - 2019 - Philosophia Christine 55 (2):125-149.
    This paper discusses the theoretical assumptions behind the conception of the logic of faith and deed (LF&D) and outlines its formal-axiomatic frame and its method of construction, which enable us to understand it as a kind of deductive science. The paper is divided into several sections, starting with the logical analysis of the ambiguous terms of 'faith’ and 'action', and focusing in particular on the concepts of religious faith and deed as a type of conscious activity relating to a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  39. Analogy.Todd Davies - 1985 - In CSLI Informal Notes Series. Stanford, CA, USA: Center for the Study of Language and Information, No. IN-CSLI-85-4,.
    This essay (a revised version of my undergraduate honors thesis at Stanford) constructs a theory of analogy as it applies to argumentation and reasoning, especially as used in fields such as philosophy and law. The word analogy has been used in different senses, which the essay defines. The theory developed herein applies to analogia rationis, or analogical reasoning. Building on the framework of situation theory, a type of logical relation called determination is defined. This determination relation solves a puzzle about (...)
    Download  
     
    Export citation  
     
    Bookmark  
  40. Deductive Reasoning Under Uncertainty: A Water Tank Analogy.Guy Politzer - 2016 - Erkenntnis 81 (3):479-506.
    This paper describes a cubic water tank equipped with a movable partition receiving various amounts of liquid used to represent joint probability distributions. This device is applied to the investigation of deductive inferences under uncertainty. The analogy is exploited to determine by qualitative reasoning the limits in probability of the conclusion of twenty basic deductive arguments (such as Modus Ponens, And-introduction, Contraposition, etc.) often used as benchmark problems by the various theoretical approaches to reasoning under uncertainty. The probability (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  41. Is There a Deductive Argument for Semantic Externalism? Reply to Yli-Vakkuri.Sarah Sawyer - 2018 - Analysis 78 (4):675-681.
    Juhani Yli-Vakkuri has argued that the Twin Earth thought experiments offered in favour of semantic externalism can be replaced by a straightforward deductive argument from premisses widely accepted by both internalists and externalists alike. The deductive argument depends, however, on premisses that, on standard formulations of internalism, cannot be satisfied by a single belief simultaneously. It does not therefore, constitute a proof of externalism. The aim of this article is to explain why.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  42. Epistemic Closure Under Deductive Inference: What is It and Can We Afford It?Assaf Sharon & Levi Spectre - 2013 - Synthese 190 (14):2731-2748.
    The idea that knowledge can be extended by inference from what is known seems highly plausible. Yet, as shown by familiar preface paradox and lottery-type cases, the possibility of aggregating uncertainty casts doubt on its tenability. We show that these considerations go much further than previously recognized and significantly restrict the kinds of closure ordinary theories of knowledge can endorse. Meeting the challenge of uncertainty aggregation requires either the restriction of knowledge-extending inferences to single premises, or eliminating epistemic uncertainty in (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  43. Recommender Systems and Their Ethical Challenges.Silvia Milano, Mariarosaria Taddeo & Luciano Floridi - 2020 - AI and Society (4):957-967.
    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.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  44. La conception déductive de l'explication scientifique et l'économie.Philippe Mongin - 2002 - Social Science Information 41 (2):139-165.
    This essay presents and discusses the currently most famous among the deductive conceptions of explanation, i.e., the deductive-nomological one, and proceeds to apply it to microeconomic theory. After restating the basic ideas, the essay investigates some of the important objections raised against it, with a view to decide whether or not they invalidate the proposed application to economics.
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   1 citation  
  45. Deductive Arguments.Jake Wright - manuscript
    This essay presents deductive arguments to an introductory-level audience via a discussion of Aristotle's three types of rhetoric, the goals of and differences between deductive and non-deductive arguments, and the major features of deductive arguments (e.g., validity and soundness).
    Download  
     
    Export citation  
     
    Bookmark  
  46. Small Steps and Great Leaps in Thought: The Epistemology of Basic Deductive Rules.Joshua Schechter - 2019 - In Magdalena Balcerak Jackson & Brendan Balcerak Jackson (eds.), Reasoning: New Essays on Theoretical and Practical Thinking. Oxford: Oxford University Press.
    We are justified in employing the rule of inference Modus Ponens (or one much like it) as basic in our reasoning. By contrast, we are not justified in employing a rule of inference that permits inferring to some difficult mathematical theorem from the relevant axioms in a single step. Such an inferential step is intuitively “too large” to count as justified. What accounts for this difference? In this paper, I canvass several possible explanations. I argue that the most promising approach (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  47. Semiotic Systems, Computers, and the Mind: How Cognition Could Be Computing.William J. Rapaport - 2012 - International Journal of Signs and Semiotic Systems 2 (1):32-71.
    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 (...)
    Download  
    Translate
     
     
    Export citation  
     
    Bookmark   14 citations  
  48. Developmental Systems Theory.Paul Griffiths & Adam Hochman - 2015 - eLS:1-7.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  49. Dynamic Systems as Tools for Analysing Human Judgement.Joachim Funke - 2001 - Thinking and Reasoning 7 (1):69 – 89.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  50. Enactive Autonomy in Computational Systems.Mario Villalobos & Joe Dewhurst - 2018 - Synthese 195 (5):1891-1908.
    In this paper we will demonstrate that a computational system can meet the criteria for autonomy laid down by classical enactivism. The two criteria that we will focus on are operational closure and structural determinism, and we will show that both can be applied to a basic example of a physically instantiated Turing machine. We will also address the question of precariousness, and briefly suggest that a precarious Turing machine could be designed. Our aim in this paper is to challenge (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
1 — 50 / 1000