Results for 'logic programming'

957 found
Order:
  1. The Logic of the Method of Agent-Based Simulation in the Social Sciences: Empirical and Intentional Adequacy of Computer Programs.Nuno David, Jaime Sichman & Helder Coleho - 2005 - Journal of Artificial Societies and Social Simulation 8 (4).
    The classical theory of computation does not represent an adequate model of reality for simulation in the social sciences. The aim of this paper is to construct a methodological perspective that is able to conciliate the formal and empirical logic of program verification in computer science, with the interpretative and multiparadigmatic logic of the social sciences. We attempt to evaluate whether social simulation implies an additional perspective about the way one can understand the concepts of program and computation. (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  2. A Deontic Logic for Programming Rightful Machines: Kant’s Normative Demand for Consistency in the Law.Ava Thomas Wright - 2023 - Logics for Ai and Law: Joint Proceedings of the Third International Workshop on Logics for New-Generation Artificial Intelligence (Lingai) and the International Workshop on Logic, Ai and Law (Lail).
    In this paper, I set out some basic elements of a deontic logic with an implementation appropriate for handling conflicting legal obligations for purposes of programming autonomous machine agents. Kantian justice demands that the prescriptive system of enforceable public laws be consistent, yet statutes or case holdings may often describe legal obligations that contradict; moreover, even fundamental constitutional rights may come into conflict. I argue that a deontic logic of the law should not try to work around (...)
    Download  
     
    Export citation  
     
    Bookmark  
  3. Proofs are Programs: 19th Century Logic and 21st Century Computing.Philip Wadler - manuscript
    As the 19th century drew to a close, logicians formalized an ideal notion of proof. They were driven by nothing other than an abiding interest in truth, and their proofs were as ethereal as the mind of God. Yet within decades these mathematical abstractions were realized by the hand of man, in the digital stored-program computer. How it came to be recognized that proofs and programs are the same thing is a story that spans a century, a chase with as (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  4. Computational logic. Vol. 1: Classical deductive computing with classical logic. 2nd ed.Luis M. Augusto - 2022 - London: College Publications.
    This is the 3rd edition. Although a number of new technological applications require classical deductive computation with non-classical logics, many key technologies still do well—or exclusively, for that matter—with classical logic. In this first volume, we elaborate on classical deductive computing with classical logic. The objective of the main text is to provide the reader with a thorough elaboration on both classical computing – a.k.a. formal languages and automata theory – and classical deduction with the classical first-order predicate (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. Incompleteness of a first-order Gödel logic and some temporal logics of programs.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - In Kleine Büning Hans (ed.), Computer Science Logic. CSL 1995. Selected Papers. Springer. pp. 1--15.
    It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger's temporal logic of programs (even of the fragment without the nexttime operator O) and (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  6. Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  7. (What) Is Feminist Logic? (What) Do We Want It to Be?Catharine Saint-Croix & Roy T. Cook - 2024 - History and Philosophy of Logic 45 (1):20-45.
    ‘Feminist logic’ may sound like an impossible, incoherent, or irrelevant project, but it is none of these. We begin by delineating three categories into which projects in feminist logic might fall: philosophical logic, philosophy of logic, and pedagogy. We then defuse two distinct objections to the very idea of feminist logic: the irrelevance argument and the independence argument. Having done so, we turn to a particular kind of project in feminist philosophy of logic: Valerie (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  8. Logic, Act and Product.Jacques P. Dubucs & Wioletta Miśkiewicz - 2009 - In Giuseppe Primiero (ed.), Acts of Knowledge: History, Philosophy and Logic. College Publications.
    Logic and psychology overlap in judgment, inference and proof. The problems raised by this commonality are notoriously difficult, both from a historical and from a philosophical point of view. Sundholm has for a long time addressed these issues. His beautiful piece of work [A Century of Inference: 1837-1936] begins by summarizing the main difficulty in the usual provocative manner of the author: one can start, he says, by the act of knowledge to go to the object, as the Idealist (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  9. Neo-Logicism and Its Logic.Panu Raatikainen - 2020 - History and Philosophy of Logic 41 (1):82-95.
    The rather unrestrained use of second-order logic in the neo-logicist program is critically examined. It is argued in some detail that it brings with it genuine set-theoretical existence assumptions and that the mathematical power that Hume’s Principle seems to provide, in the derivation of Frege’s Theorem, comes largely from the ‘logic’ assumed rather than from Hume’s Principle. It is shown that Hume’s Principle is in reality not stronger than the very weak Robinson Arithmetic Q. Consequently, only a few (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  10. Deontic logic as a study of conditions of rationality in norm-related activities.Berislav Žarnić - 2016 - In Olivier Roy, Allard Tamminga & Malte Willer (eds.), Deontic Logic and Normative Systems. London, UK: College Publications. pp. 272-287.
    The program put forward in von Wright's last works defines deontic logic as ``a study of conditions which must be satisfied in rational norm-giving activity'' and thus introduces the perspective of logical pragmatics. In this paper a formal explication for von Wright's program is proposed within the framework of set-theoretic approach and extended to a two-sets model which allows for the separate treatment of obligation-norms and permission norms. The three translation functions connecting the language of deontic logic with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  11. Logic in mathematics and computer science.Richard Zach - forthcoming - In Filippo Ferrari, Elke Brendel, Massimiliano Carrara, Ole Hjortland, Gil Sagi, Gila Sher & Florian Steinberger (eds.), Oxford Handbook of Philosophy of Logic. Oxford, UK: Oxford University Press.
    Logic has pride of place in mathematics and its 20th century offshoot, computer science. Modern symbolic logic was developed, in part, as a way to provide a formal framework for mathematics: Frege, Peano, Whitehead and Russell, as well as Hilbert developed systems of logic to formalize mathematics. These systems were meant to serve either as themselves foundational, or at least as formal analogs of mathematical reasoning amenable to mathematical study, e.g., in Hilbert’s consistency program. Similar efforts continue, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  12. Hilbert's program then and now.Richard Zach - 2002 - In Dale Jacquette (ed.), Philosophy of Logic. Malden, Mass.: North Holland. pp. 411–447.
    Hilbert’s program was an ambitious and wide-ranging project in the philosophy and foundations of mathematics. In order to “dispose of the foundational questions in mathematics once and for all,” Hilbert proposed a two-pronged approach in 1921: first, classical mathematics should be formalized in axiomatic systems; second, using only restricted, “finitary” means, one should give proofs of the consistency of these axiomatic systems. Although Gödel’s incompleteness theorems show that the program as originally conceived cannot be carried out, it had many partial (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  13. (1 other version)The Warsaw School of Logic: Main Pillars, Ideas, Significance.Wybraniec-Skardowska Urszula - forthcoming - Studia:1-11.
    The Warsaw School of Logic (WSL) was the famous branch of the Lvov-Warsaw School (LWS) – the most important movement in the history of Polish philosophy. Logic made the most important field in the activities of the WSL. The aim of this work is to highlight the role and significance of the WSL in the history of logic in the 20th century.
    Download  
     
    Export citation  
     
    Bookmark  
  14. The Joint Philosophical Program of Russell and Wittgenstein and Its Demise.Nikolay Milkov - 2013 - Nordic Wittgenstein Review 2 (1):81-105.
    Between April and November 1912, Bertrand Russell and Ludwig Wittgenstein were engaged in a joint philosophical program. Wittgenstein‘s meeting with Gottlob Frege in December 1912 led, however, to its dissolution – the joint program was abandoned. Section 2 of this paper outlines the key points of that program, identifying what Russell and Wittgenstein each contributed to it. The third section determines precisely those features of their collaborative work that Frege criticized. Finally, building upon the evidence developed in the preceding two (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  15. Quantified Propositional Gödel Logics.Matthias Baaz, Agata Ciabattoni & Richard Zach - 2000 - In Voronkov Andrei & Parigot Michel (eds.), Logic for Programming and Automated Reasoning. 7th International Conference, LPAR 2000. Springer. pp. 240-256.
    It is shown that Gqp↑, the quantified propositional Gödel logic based on the truth-value set V↑ = {1 - 1/n : n≥1}∪{1}, is decidable. This result is obtained by reduction to Büchi's theory S1S. An alternative proof based on elimination of quantifiers is also given, which yields both an axiomatization and a characterization of Gqp↑ as the intersection of all finite-valued quantified propositional Gödel logics.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  16. G'3 as the logic of modal 3-valued Heyting algebras.Marcelo E. Coniglio, Aldo Figallo-Orellano, Alejandro Hernández-Tello & Miguel Perez-Gaspar - 2022 - IfCoLog Journal of Logics and Their Applications 9 (1):175-197.
    In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as (...)
    Download  
     
    Export citation  
     
    Bookmark  
  17. Using criticalities as a heuristic for answer set programming.Orkunt Sabuncu, Ferda N. Alpaslan & Varol Akman - 2003 - In Vladimir Lifschitz & Ilkka Niemela (eds.), Logic Programming and Nonmonotonic Reasoning, Lecture Notes in Artificial Intelligence 2923 (7th International Conference, LPNMR 2004, Fort Lauderdale, FL, January 6-8, 2004 Proceedings). Berlin, Heidelberg: Springer. pp. 234-246.
    Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18. Logical model of Personality and Cognition with possible Applications.Miro Brada - 2016 - In Park Woosuk (ed.), KAIST/KSBS International Workshop. KAIST. pp. 89-100.
    Although the cognition is significant in strategic reasoning, its role has been weakly analyzed, because only the average intelligence is usually considered. For example, prisoner's dilemma in game theory, would have different outcomes for persons with different intelligence. I show how various levels of intelligence influence the quality of reasoning, decision, or the probability of psychosis. I explain my original methodology developed for my MA thesis in clinical psychology in 1998, and grant research in 1999, demonstrating the bias of the (...)
    Download  
     
    Export citation  
     
    Bookmark  
  19. The Importance of Teaching Logic to Computer Scientists and Electrical Engineers.Paul Mayer - forthcoming - IEEE.
    It is argued that logic, and in particular mathematical logic, should play a key role in the undergraduate curriculum for students in the computing fields, which include electrical engineering (EE), computer engineering (CE), and computer science (CS). This is based on 1) the history of the field of computing and its close ties with logic, 2) empirical results showing that students with better logical thinking skills perform better in tasks such as programming and mathematics, and 3) (...)
    Download  
     
    Export citation  
     
    Bookmark  
  20. Deductive Computing over Knowledge Bases: Prolog and Datalog.Luis M. Augusto - 2024 - Journal of Knowledge Structures and Systems 5 (1):1-62.
    Knowledge representation (KR) is actually more than representation: It involves also inference, namely inference of “new” knowledge, i.e. new facts. Logic programming is a suitable KR medium, but more often than not discussions on this programming paradigm focus on aspects other than KR. In this paper, I elaborate on the general theory of logic programming and give the essentials of two of its main implementations, to wit, Prolog and Datalog, from the viewpoint of deductive computing (...)
    Download  
     
    Export citation  
     
    Bookmark  
  21. Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.Corey Edward Mulvihill - 2015 - Dissertation, University of Waterloo
    Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while in the presence of weaker decidability conditions for terms they produce various superintuitionistic intermediate logics. In this thesis, I argue that there are important philosophical lessons to be learned from these results. To make the case, I begin with a historical discussion situating the development of Hilbert’s operators in relation to his evolving program (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  22. A logical hole in the chinese room.Michael John Shaffer - 2009 - Minds and Machines 19 (2):229-235.
    Searle’s Chinese Room Argument (CRA) has been the object of great interest in the philosophy of mind, artificial intelligence and cognitive science since its initial presentation in ‘Minds, Brains and Programs’ in 1980. It is by no means an overstatement to assert that it has been a main focus of attention for philosophers and computer scientists of many stripes. It is then especially interesting to note that relatively little has been said about the detailed logic of the argument, whatever (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  23. Hilbert's Program Revisited.Panu Raatikainen - 2003 - Synthese 137 (1-2):157-177.
    After sketching the main lines of Hilbert's program, certain well-known andinfluential interpretations of the program are critically evaluated, and analternative interpretation is presented. Finally, some recent developments inlogic related to Hilbert's program are reviewed.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  24. Information of the chassis and information of the program in synthetic cells.Antoine Danchin - 2009 - Systems and Synthetic Biology 3:125-134.
    Synthetic biology aims at reconstructing life to put to the test the limits of our understanding. It is based on premises similar to those which permitted invention of computers, where a machine, which reproduces over time, runs a program, which replicates. The underlying heuristics explored here is that an authentic category of reality, information, must be coupled with the standard categories, matter, energy, space and time to account for what life is. The use of this still elusive category permits us (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  25. Modeling the interaction of computer errors by four-valued contaminating logics.Roberto Ciuni, Thomas Macaulay Ferguson & Damian Szmuc - 2019 - In Rosalie Iemhoff, Michael Moortgat & Ruy de Queiroz (eds.), Logic, Language, Information, and Computation. Folli Publications on Logic, Language and Information. pp. 119-139.
    Logics based on weak Kleene algebra (WKA) and related structures have been recently proposed as a tool for reasoning about flaws in computer programs. The key element of this proposal is the presence, in WKA and related structures, of a non-classical truth-value that is “contaminating” in the sense that whenever the value is assigned to a formula ϕ, any complex formula in which ϕ appears is assigned that value as well. Under such interpretations, the contaminating states represent occurrences of a (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  26. The logic of metabolism and its fuzzy consequences.A. Danchin - 2014 - Environmental Microbiology 16 (1):19-28.
    Intermediary metabolism molecules are orchestrated into logical pathways stemming from history (L-amino acids, D-sugars) and dynamic constraints (hydrolysis of pyrophosphate or amide groups is the driving force of anabolism). Beside essential metabolites, numerous variants derive from programmed or accidental changes. Broken down, variants enter standard pathways, producing further variants. Macromolecule modification alters enzyme reactions specificity. Metabolism conform thermodynamic laws, precluding strict accuracy. Hence, for each regular pathway, a wealth of variants inputs and produces metabolites that are similar to but not (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  27. The Role of Starting Points to Order Investigation: Why and How to Enrich the Logic of Research Questions.William C. Bausman - 2022 - Philosophy, Theory, and Practice in Biology 6 (14).
    What methodological approaches do research programs use to investigate the world? Elisabeth Lloyd’s Logic of Research Questions (LRQ) characterizes such approaches in terms of the questions that the researchers ask and causal factors they consider. She uses the Logic of Research Questions Framework to criticize adaptationist programs in evolutionary biology for dogmatically assuming selection explanations of the traits of organisms. I argue that Lloyd’s general criticism of methodological adaptationism is an artefact of the impoverished LRQ. My Ordered Factors (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  28. Genuine Process Logic.Wolfgang Sohst - 2017 - Collected Lectures of MoMo Berlin.
    The Genuine Process Logic described here (abbreviation: GPL) places the object-bound process itself at the center of formalism. It should be suitable for everyday use, i.e. it is not primarily intended for the formalization of computer programs, but instead, as a counter-conception to the classical state logics. The new and central operator of the GPL is an action symbol replacing the classical state symbols, e.g. of equivalence or identity. The complete renunciation of object-language state expressions also results in a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  29. Bertrand Russell’s Philosophical Logic and its Logical Forms.Nikolay Milkov - 2023 - Athens Journal of Philosophy 2 (3):193-210.
    From 1901 till, at least, 1919, Russell persistently maintained that there are two kinds of logic, between which he sharply discriminated: mathematical logic and philosophical logic. In this paper, we discuss the concept of philosophical logic, as used by Russell. This was only a tentative program that Russell did not clarify in detail, so our task will be to make it explicit. We shall show that there are three (-and-a-half) kinds of Russellian philosophical logic: (i) (...)
    Download  
     
    Export citation  
     
    Bookmark  
  30. The philosophy of alternative logics.Andrew Aberdein & Stephen Read - 2009 - In Leila Haaparanta (ed.), The development of modern logic. New York: Oxford University Press. pp. 613-723.
    This chapter focuses on alternative logics. It discusses a hierarchy of logical reform. It presents case studies that illustrate particular aspects of the logical revisionism discussed in the chapter. The first case study is of intuitionistic logic. The second case study turns to quantum logic, a system proposed on empirical grounds as a resolution of the antinomies of quantum mechanics. The third case study is concerned with systems of relevance logic, which have been the subject of an (...)
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  31. Speculative Philosophy of Science vs. Logical Positivism: Preliminary Round.Joel Katzav - 2025 - In Sander Verhaegh (ed.), American Philosophy and the Intellectual Migration: Pragmatism, Logical Empiricism, Phenomenology, Critical Theory. Berlin: De Gruyter.
    I outline the theoretical framework of, and three research programs within American speculative philosophy of science during the period 1900-1931. One program applies verificationism to research in psychology, one investigates the methodology of research programs, and one analyses scientific explanation and other scientific concepts. The primary sources for my outline are works by Morris Raphael Cohen, Grace Andrus de Laguna, Theodore de Laguna, Edgar Arthur Singer Jr., Harold Robert Smart, and Marie Collins Swabey. I also use my outline to provide (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  32. Dynamic Tableaux for Dynamic Modal Logics.Jonas De Vuyst - 2013 - Dissertation, Vrije Universiteit Brussel
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  33. Arithmetic logical Irreversibility and the Halting Problem (Revised and Fixed version).Yair Lapin - manuscript
    The Turing machine halting problem can be explained by several factors, including arithmetic logic irreversibility and memory erasure, which contribute to computational uncertainty due to information loss during computation. Essentially, this means that an algorithm can only preserve information about an input, rather than generate new information. This uncertainty arises from characteristics such as arithmetic logical irreversibility, Landauer's principle, and memory erasure, which ultimately lead to a loss of information and an increase in entropy. To measure this uncertainty and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  34. A Philosophical Psychotherapy: Logic-Based Therapy in the Treatment of Addicted Populations.Guy Pierre Du Plessis - 2022 - Presentation at the 4th International Conference on Philosophical Counseling and Practice, National Philosophical Counseling Association, 11-12 February 2022.
    In my presentation I argue for the utility of a philosophical counseling method, called logic-based therapy (LBT), in the treatment of addicted populations. In the context of addiction treatment LBT could be also classified as a philosophical psychotherapy. Philosophical psychotherapy can be understood as an umbrella term for interventions designed to treat mental health disorders, with theoretical foundations that are philosophical. Philosophical psychotherapy would be distinct from philosophical counseling, as the latter does not directly treat mental health disorders. I (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. Graphical Method for Solving Neutrosophical Nonlinear Programming Models.Maissam Jdid & Florentin Smarandache - 2023 - Neutrosophic Systems with Applications 9.
    An important method for finding the optimal solution for linear and nonlinear models is the graphical method, which is used if the linear or nonlinear mathematical model contains one, two, or three variables. The models that contain only two variables are among the most models for which the optimal solution has been obtained graphically, whether these models are linear or non-linear in references and research that are concerned with the science of operations research, when the data of the issue under (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. Formalism, History & Reflections: Math & Logic (translated).Jesús Aparicio de Soto - 2022 - ResearchGate GmbH.
    Developments in the realm of formal sciences and math foundations during the twentieth century were marked by important methodological advances. Such new approaches partialy owe their appearance to the abandonment of the previous paradigm. To identify how this transition occured, in this essay we observe some aspects regarding the works of Gödel and Tarski, who, under a certain interpretations, restructure epistemological bases of math's formalisms. It'll be argued that the theoretical variabilities produced in abstract sciences upon weakening previous viewpoints forced (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  37. Structured and Unstructured Programming (11th edition).Rosanna Festa - 2023 - International Journal of Science, Engeneering and Technology 11 (5):2.
    Abstract-In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values true and false, usually denoted 1 and 0, whereas in elementary algebra the values of the variables are numbers. From Poincaré to Turing mathematics is developed at the basis of the fundamental processes.
    Download  
     
    Export citation  
     
    Bookmark  
  38. Platonic Division and the Origins of Aristotelian Logic.Justin Vlasits - 2017 - Dissertation, University of California, Berkeley
    Aristotle's syllogistic theory, as developed in his Prior Analytics, is often regarded as the birth of logic in Western philosophy. Over the past century, scholars have tried to identify important precursors to this theory. I argue that Platonic division, a method which aims to give accounts of essences of natural kinds by progressively narrowing down from a genus, influenced Aristotle's logical theory in a number of crucial respects. To see exactly how, I analyze the method of division as it (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  39. On rules of inference and the meanings of logical constants.Panu Raatikainen - 2008 - Analysis 68 (4):282-287.
    In the theory of meaning, it is common to contrast truth-conditional theories of meaning with theories which identify the meaning of an expression with its use. One rather exact version of the somewhat vague use-theoretic picture is the view that the standard rules of inference determine the meanings of logical constants. Often this idea also functions as a paradigm for more general use-theoretic approaches to meaning. In particular, the idea plays a key role in the anti-realist program of Dummett and (...)
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  40. An introduction to Pavel Tichy and transparent intensional logic.Andrew Holster - manuscript
    Pavel Tichy (1936-1994) was a Czech philosopher who originally studied and worked at Charles University in Prague, and spent the second half of his life in New Zealand as a political refugee. Early in his career he invented intensional logic, simultaneously with Richard Montague, but published his version in 1971, slightly after Montague's 1970 papers, and has never been recognised for this achievement. But this was only the beginning of his work. He developed a highly original theory of semantics (...)
    Download  
     
    Export citation  
     
    Bookmark  
  41. Philosophy as a Way of Life for Addiction Recovery: A Logic-Based Therapy Case Study.Guy du Plessis - 2021 - International Journal of Applied Philosophy 35 (2):159-170.
    In this essay I explore the notion of philosophy as a way of life as a recovery pathway for individuals in addiction recovery. My hypothesis is that philosophy as a way of life can be a compelling, and legitimate recovery pathway for individuals in addiction recovery, as one of many recovery pathways. I will focus on logic-based therapy applied in the context of addiction recovery. The aim of presenting a case study is to show how a client receiving LBT (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  42. Nietzsche’s Affirmation of Life: An Exemplar of an Uplifting Philosophy for Logic-based Therapy for Addiction Recovery.Guy Du Plessis - 2023 - Qeios 1 (1):1 - 21.
    In article I explore how Logic-based Therapy (LBT) can inform a philosophically oriented recovery pathway for individuals in addiction recovery. Considering that there is an ostensibly low efficacy rate for the treatment of addiction, there is significant value in highlighting the utility of LBT for the development of novel philosophically based addiction treatment and recovery-oriented programs, which would expand the treatment and recovery options. I propose that LBT may be a suitable intervention when challenging the unrealistic conclusions derived from (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43. Human-like Knowledge Invention: A Non Monotonic Reasoning framework.Antonio Lieto - 2023 - In Model Based Reasoning Conference, 2023, Rome. Springer.
    Inventing novel knowledge to solve problems is a crucial, creative, mechanism employed by humans, to extend their range of action. In this paper, we present TCL (typicality-based compositional logic): a probabilistic, non monotonic extension of standard Description Logics of typicality, and will show how this framework is able to endow artificial systems of a human-like, commonsense based, concept composition procedure that allows its employment in a number of applications (ranging from computational creativity to goal-based reasoning to recommender systems and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44.  44
    Mechanizing Induction.Ronald Ortner & Hannes Leitgeb - 2009 - In Dov Gabbay (ed.), The Handbook of the History of Logic. Elsevier. pp. 719--772.
    In this chapter we will deal with “mechanizing” induction, i.e. with ways in which theoretical computer science approaches inductive generalization. In the field of Machine Learning, algorithms for induction are developed. Depending on the form of the available data, the nature of these algorithms may be very different. Some of them combine geometric and statistical ideas, while others use classical reasoning based on logical formalism. However, we are not so much interested in the algorithms themselves, but more on the philosophical (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  45. The Physical Numbers: A New Foundational Logic-Numerical Structure For Mathematics And Physics.Gomez-Ramirez Danny A. J. - manuscript
    The boundless nature of the natural numbers imposes paradoxically a high formal bound to the use of standard artificial computer programs for solving conceptually challenged problems in number theory. In the context of the new cognitive foundations for mathematics' and physics' program immersed in the setting of artificial mathematical intelligence, we proposed a refined numerical system, called the physical numbers, preserving most of the essential intuitions of the natural numbers. Even more, this new numerical structure additionally possesses the property of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. Making Sense of Raw Input.Richard Evans, Matko Bošnjak, Lars Buesing, Kevin Ellis, David Pfau, Pushmeet Kohli & Marek Sergot - 2021 - Artificial Intelligence 299 (C):103521.
    How should a machine intelligence perform unsupervised structure discovery over streams of sensory input? One approach to this problem is to cast it as an apperception task [1]. Here, the task is to construct an explicit interpretable theory that both explains the sensory sequence and also satisfies a set of unity conditions, designed to ensure that the constituents of the theory are connected in a relational structure. However, the original formulation of the apperception task had one fundamental limitation: it assumed (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  47. Remarks on Axiomatic Rejection in Aristotle’s Syllogistic.Piotr Kulicki - 2002 - Studies in Logic and Theory of Knowledge 5:231-236.
    In the paper we examine the method of axiomatic rejection used to describe the set of nonvalid formulae of Aristotle's syllogistic. First we show that the condition which the system of syllogistic has to fulfil to be ompletely axiomatised, is identical to the condition for any first order theory to be used as a logic program. Than we study the connection between models used or refutation in a first order theory and rejected axioms for that theory. We show that (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  48. Sense and the computation of reference.Reinhard Muskens - 2004 - Linguistics and Philosophy 28 (4):473 - 504.
    The paper shows how ideas that explain the sense of an expression as a method or algorithm for finding its reference, preshadowed in Frege’s dictum that sense is the way in which a referent is given, can be formalized on the basis of the ideas in Thomason (1980). To this end, the function that sends propositions to truth values or sets of possible worlds in Thomason (1980) must be replaced by a relation and the meaning postulates governing the behaviour of (...)
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  49. From Art to Information System.Miro Brada - 2021 - AGI Laboratory.
    This insight to art came from chess composition concentrating art in a very dense form. To identify and mathematically assess the uniqueness is the key applicable to other areas eg. computer programming. Maximization of uniqueness is minimization of entropy that coincides as well as goes beyond Information Theory (Shannon, 1948). The reusage of logic as a universal principle to minimize entropy, requires simplified architecture and abstraction. Any structures (e.g. plugins) duplicating or dividing functionality increase entropy and so unreliability (...)
    Download  
     
    Export citation  
     
    Bookmark  
  50. Theories with the Independence Property, Studia Logica 2010 95:379-405.Mlj van de Vel - 2010 - Studia Logica 95 (3):379-405.
    A first-order theory T has the Independence Property provided deduction of a statement of type (quantifiers) (P -> (P1 or P2 or .. or Pn)) in T implies that (quantifiers) (P -> Pi) can be deduced in T for some i, 1 <= i <= n). Variants of this property have been noticed for some time in logic programming and in linear programming. We show that a first-order theory has the Independence Property for the class of basic (...)
    Download  
     
    Export citation  
     
    Bookmark  
1 — 50 / 957