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. (...) We demonstrate that the logic of social simulation implies at least two distinct types of program verifications that reflect an epistemological distinction in the kind of knowledge one can have about programs. Computer programs seem to possess a causal capability (Fetzer, 1999) and an intentional capability that scientific theories seem not to possess. This distinction is associated with two types of program verification, which we call empirical and intentional verification. We demonstrate, by this means, that computational phenomena are also intentional phenomena, and that such is particularly manifest in agent-based social simulation. Ascertaining the credibility of results in social simulation requires a focus on the identification of a new category of knowledge we can have about computer programs. This knowledge should be considered an outcome of an experimental exercise, albeit not empirical, acquired within a context of limited consensus. The perspective of intentional computation seems to be the only one possible to reflect the multiparadigmatic character of social science in terms of agent-based computational social science. We contribute, additionally, to the clarification of several questions that are found in the methodological perspectives of the discipline, such as the computational nature, the logic of program scalability, and the multiparadigmatic character of agent-based simulation in the social sciences. (shrink)

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 (...) such conflicts but, instead, identify and expose them so that the rights and duties that generate inconsistencies in public law can be explicitly qualified and the conflicts resolved. I then argue that a credulous, non-monotonic deontic logic can describe inconsistent legal obligations while meeting Kant’s demand for consistency in the prescriptive system of public law. Finally, I propose an implementation of this logic via a modified form of “answer set programming,” which I demonstrate with some simple examples. (shrink)

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 (...) many twists and turns as a thriller. At the end of the story is a new principle for designing programming languages that will guide computers into the 21st century. -/- For my money, Gentzen’s natural deduction and Church’s lambda calculus are on a par with Einstein’s relativity and Dirac’s quantum physics for elegance and insight. And the maths are a lot simpler. I want to show you the essence of these ideas. I’ll need a few symbols, but not too many, and I’ll explain as I go along. -/- To simplify, I’ll present the story as we understand it now, with some asides to fill in the history. First, I’ll introduce Gentzen’s natural deduction, a formalism for proofs. Next, I’ll introduce Church’s lambda calculus, a formalism for programs. Then I’ll explain why proofs and programs are really the same thing, and how simplifying a proof corresponds to executing a program. Finally, I’ll conclude with a look at how these principles are being applied to design a new generation of programming languages, particularly mobile code for the Internet. (shrink)

‘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 (...) Plumwood's feminist argument for a relevance logic. Plumwood's work serves as our primary case study as we turn to the project of considering three different ways we might understand her argument and revisionist arguments like it: as a priori theorizing, as ameliorative conceptual engineering, or as instances of anti-exceptionalist approaches to logic. After arguing that the anti-exceptionalist approach seems to provide the most promising means of understanding the kind of project undertaken in a feminist challenge to classical logic, we briefly address the consequences that this might have for logic instruction. Here, we argue for the perhaps unexpected conclusion that feminist programs ought to offer more, not less, instruction in logic for those who take interest. (shrink)

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 (...) of the authors' temporal logic of linear discrete time with gaps follows. (shrink)

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 (...) calculus with a view to computational implementations, namely in automated theorem proving and logic programming. The present third edition improves on the previous ones by providing an altogether more algorithmic approach: There is now a wholly new section on algorithms and there are in total fourteen clearly isolated algorithms designed in pseudo-code. Other improvements are, for instance, an emphasis on functions in Chapter 1 and more exercises with Turing machines. (shrink)

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 (...) successes, and generated important advances in logical theory and metatheory, both at the time and since. The article discusses the historical background and development of Hilbert’s program, its philosophical underpinnings and consequences, and its subsequent development and influences since the 1930s. (shrink)

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 (...) does; one can also start by the object to go to the act, in the Realist mood; never the two shall meet. He is himself inclined to accept the first perspective as the right one and he has eventually developed an original version of antirealism which starts, not from considerations about the publicity of meaning, in the manner of Dummett, but from an epistemic standpoint, trying to search in a non-Fregean tradition of analysis of judgement and cognate notions a way of founding constructivist semantics. The present paper ploughes the same field. We concentrate on the significance, for Sundholm’s program, of the perspective that has been opened by Twardowski in his important essay on acts and products (1912. (shrink)

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.

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. (...) Much of Stoic logic appears surprisingly modern: a recursively formulated syntax with some truth-functional propositional operators; analogues to cut rules, axiom schemata and Gentzen’s negation-introduction rules; an implicit variable-sharing principle and deliberate rejection of Thinning and avoidance of paradoxes of implication. These latter features mark the system out as a relevance logic, where the absence of duals for its left and right introduction rules puts it in the vicinity of McCall’s connexive logic. Methodologically, the choice of meticulously formulated meta-logical rules in lieu of axiom and inference schemata absorbs some structural rules and results in an economical, precise and elegant system that values decidability over completeness. (shrink)

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 (...) sections, section 4 recasts along previously undeveloped lines Wittgenstein‘s logical–philosophical discoveries in the two years following his encounter with Frege in 1912. The paper concludes, in section 5, with an overview of the dramatic consequences the Frege-Wittgenstein critique had for Russell‘s philosophical development. (shrink)

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 (...) the language of the extended set-theoretical approach are introduced, and used in proving the correspondence between the deontic theorems, on one side, and the perfection properties of the norm-set and the ``counter-set'', on the other side. In this way the possibility of reinterpretation of standard deontic logic as the theory of perfection properties that ought to be achieved in norm-giving activity has been formally proved. The extended set-theoretic approach is applied to the problem of rationality of principles of completion of normative systems. The paper concludes with a plaidoyer for logical pragmatics turn envisaged in the late phase of Von Wright's work in deontic logic. (shrink)

This paper is concerned with counterfactual logic and its implications for the modal status of mathematical claims. It is most directly a response to an ambitious program by Yli-Vakkuri and Hawthorne (2018), who seek to establish that mathematics is committed to its own necessity. I claim that their argument fails to establish this result for two reasons. First, their assumptions force our hand on a controversial debate within counterfactual logic. In particular, they license counterfactual strengthening— the inference from (...) ‘If A were true then C would be true’ to ‘If A and B were true then C would be true’—which many reject. Second, the system they develop is provably equivalent to appending Deduction Theorem to a T modal logic. It is unsurprising that the combination of Deduction Theorem with T results in necessitation; indeed, it is precisely for this reason that many logicians reject Deduction Theorem in modal contexts. If Deduction Theorem is unacceptable for modal logic, it cannot be assumed to derive the necessity of mathematics. (shrink)

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 (...) classic IQ method, and how the intelligence limits thinking. Based on that I defined Personality Model, providing insight into understanding of psychosis (schizophrenia, bi-polar), which has not been explained yet by psychology or psychiatry. In addition, it enables to analyze and assess non-linear problems, utilizable in computer programming, visualization (animation) or other fields including Baduk game. I've already applied some principles in complex information system www.each.co.uk, and video-animations exhibited in London, Germany, Tokyo. I need to mention my experience in chess composition between 1994 and 2000, winning a few international prizes and inventing a special class of fairy rules redefining the mate. The chess composition principles or patterns show the way to organize logical series to higher advanced mechanisms (like calculus), applicable to other fields. One of such principles is a logical aesthetic innovation: new strategy, defined by Italian composers. Finally I show how the simple redefinition of the classic utility concept links economics and psychology to explain irrational / destructive behavior. All presented results (from the research) can be repeated. (shrink)

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 (...) significance Searle intended CRA to have. The problem with the CRA is that it involves a very strong modal claim, the truth of which is both unproved and highly questionable. So it will be argued here that the CRA does not prove what it was intended to prove. (shrink)

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 (...) the exact replicas of core metabolites. As corollary, a shadow, paralogous metabolism, is associated to standard metabolism. We focus on a logic of paralogous metabolism based on diversion of the core metabolic mimics into pathways where they are modified to minimize their input in the core pathways where they create havoc. We propose that a significant proportion of paralogues of well-characterized enzymes have evolved as the natural way to cope with paralogous metabolites. A second type of denouement uses a process where protecting/deprotecting unwanted metabolites - conceptually similar to the procedure used in the laboratory of an organic chemist - is used to enter a completely new catabolic pathway. (shrink)

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 (...) rudimentary facts of arithmetic are logically derivable from Hume’s Principle. And that hardly counts as a vindication of logicism. (shrink)

Answer Set Programming is a new paradigm based on logic programming. The main component of answer set programming is a system that finds the answer sets of logic programs. During the computation of an answer set, systems are faced with choice points where they have to select a literal and assign it a truth value. Generally, systems utilize some heuristics to choose new literals at the choice points. The heuristic used is one of the key (...) factors for the performance of the system. A new heuristic for answer set programming has been developed. This heuristic is inspired by hierarchical planning. The notion of criticality, which was introduced for generating abstraction hierarchies in hierarchical planning, is used in this heuristic. The resulting system (CSMODELS) uses this new heuristic in a static way. CSMODELS is based on the system SMODELS. The experimental results show that this new heuristic is promising for answer set programming. A comparison of search times with SMODELS demonstrate CSMODELS’ usefulness. (shrink)

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.

A system of logic usually comprises a language for which a model-theory and a proof-theory are defined. The model-theory defines the semantic notion of model-theoretic logical consequence (⊨), while the proof-theory defines the proof- theoretic notion of logical consequence (or logical derivability, ⊢). If the system in question is sound and complete, then the two notions of logical consequence are extensionally equivalent. The concept of full formalization is a more restrictive one and requires in addition the preservation of the (...) standard meanings of the logical terms in all the admissible interpretations of the logical calculus, as it is proof-theoretically defined. Although classical first-order logic is sound and complete, its standard formalizations fall short to be full formalizations since they allow non-intended interpretations. This fact poses a challenge for the logical inferentialism program, whose main tenet is that the meanings of the logical terms are uniquely determined by the formal axioms or rules of inference that govern their use in a logical calculus, i.e., logical inferentialism requires a categorical calculus. This paper is the first part of a more elaborated study which will analyze the categoricity problem from its beginning until the most recent approaches. I will first start by describing the problem of a full formalization in the general framework in which Carnap (1934/1937, 1943) formulated it for classical logic. Then, in sections IV and V, I shall discuss the way in which the mathematicians B.A. Bernstein (1932) and E.V. Huntington (1933) have previously formulated and analyzed it in algebraic terms for propositional logic and, finally, I shall discuss some critical reactions Nagel (1943), Hempel (1943), Fitch (1944), and Church (1944) formulated to these approaches. (shrink)

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 (...) especially detailed reform program. Finally, the fourth case study is paraconsistent logic, perhaps the most controversial of serious proposals. (shrink)

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 (...) well as the one of Gödel 3-valued logic G3. From this, the three logics coincide up-to language, taking into acccount that 1 is the only designated truth-value in these logics. -/- From the algebraic point of view, Canals-Frau and Figallo have studied the 3-valued modal implicative semilattices, where the modal operator is the well-known Moisil-Monteiro-Baaz Δ operator, and the supremum is definable from this. We prove that the subvariety obtained from this by adding a bottom element 0 is term-equivalent to the variety generated by the 3-valued algebra of G'3. The algebras of that variety are called G'3-algebras. From this result, we obtain the equations which axiomatize the variety of G'3-algebras. Moreover, we prove that this variety is semisimple, and the 3-element and the 2-element chains are the unique simple algebras of the variety. Finally an extension of G'3 to first-order languages is presented, with an algebraic semantics based on complete G'3-algebras. The corresponding soundness and completeness theorems are obtained. (shrink)

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.

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 (...) to interact with reality via construction of self-consistent models producing predictions which can be instantiated into experiments. While the present theory of information has much to say about the program, with the creative properties of recursivity at its heart, we almost entirely lack a theory of the information supporting the machine. We suggest that the program of life codes for processes meant to trap information which comes from the context provided by the environment of the machine. (shrink)

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 (...) loss of information, the concept of arithmetic logical entropy can be used. The Turing machine and its equivalent, general recursive functions can be understood through the λ calculus and the Turing/Church thesis. However, there are certain recursive functions that cannot be fully understood or predicted by other algorithms due to the loss of information during logical-arithmetic operations. In other words, the behaviour of these functions cannot be completely determined at every stage of the computation due to a lack of information in their definition. While there are some cases where the behaviour of recursive functions is highly predictable, the lack of information in most cases makes it impossible for algorithms to determine if a program will halt or not. This inability to predict the outcome of the computation is the essence of the halting problem of the Turing machine. Even in cases where more information is available about the program, it is still difficult to determine with certainty if the program will halt or not. This also highlights the importance of the Turing oracle machine, which introduces information from outside the computation to compensate for the lack of information and ultimately decide the result of the computation. (shrink)

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) (...) “pure logic”; (ii) philosophical logic investigating the logical forms of propositions; (iii) philosophical logic exploring the logical forms of facts: in epistemology; and in the external world. In particular, Russell’s program or philosophical logic of the facts of the external world remained less than sketchily outlined. We shall discuss it in some detail in the hope that it can start a new life. (shrink)

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 (...) study is classical data. In this research, we will present a study through, which we present the graphical method for solving Neutrosophical nonlinear models in the following case: A nonlinear programming issue, the objective function is a nonlinear function, and the constraints are linear functions. Note that we can use the same method if (i) the objective function follower is a linear follower and the constraints are nonlinear; (ii) the objective function is a non-linear follower and the constraints are non-linear. In the three cases, the nonlinear models are neutrosophic, and as we know, the mathematical model is a nonlinear model if any of the components of the objective function or the constraints are nonlinear expressions, and the nonlinear expressions may be in both. At the left end of the constraints are neutrosophic values, at least one or all of them. Then, the possible solutions to the neutrosophic nonlinear programming problem are the set of rays that fulfills all the constraints. As for the region of possible solutions, it is the region that contains all the rays that fulfill the constraints. The optimal solution is the beam that fulfills all constraints and at which the function reaches a maximum or minimum value, depending on the nature of the issue under study (noting that it is not necessary to be alone). (shrink)

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 (...) completely new metalinguistic framework, both regarding the axioms and the expressive possibilities of this system. A mixture with state logical terms is readily possible. (shrink)

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 Smart, and Marie Collins Swabey. I also use my outline to provide a (...) partial comparison of American speculative philosophy of science and 1930s logical positivism. My comparison suggests that logical positivism was a proposal for substantially narrowing down and winding back American philosophy of science and was based on positions that were already problematized in the American context. -/- . (shrink)

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 (...) in the foundations of mathematics and in relation to philosophical motivations leading to the development of intuitionistic logic. This sets the stage for a brief description of the relevant part of Dummett’s program to recast debates in metaphysics, and in particular disputes about realism and anti-realism, as closely intertwined with issues in philosophical logic, with the acceptance of classical logic for a domain reflecting a commitment to realism for that domain. Then I review extant results about what is provable and what is not when one adds epsilon to intuitionistic logic, largely due to Bell and DeVidi, and I give several new proofs of intermediate logics from intuitionistic logic+ε without identity. With all this in hand, I turn to a discussion of the philosophical significance of choice operators. Among the conclusions I defend are that these results provide a finer-grained basis for Dummett’s contention that commitment to classically valid but intuitionistically invalid principles reflect metaphysical commitments by showing those principles to be derivable from certain existence assumptions; that Dummett’s framework is improved by these results as they show that questions of realism and anti-realism are not an “all or nothing” matter, but that there are plausibly metaphysical stances between the poles of anti-realism and realism, because different sorts of ontological assumptions yield intermediate rather than classical logic; and that these intermediate positions between classical and intuitionistic logic link up in interesting ways with our intuitions about issues of objectivity and reality, and do so usefully by linking to questions around intriguing everyday concepts such as “is smart,” which I suggest involve a number of distinct dimensions which might themselves be objective, but because of their multivalent structure are themselves intermediate between being objective and not. Finally, I discuss the implications of these results for ongoing debates about the status of arbitrary and ideal objects in the foundations of logic, showing among other things that much of the discussion is flawed because it does not recognize the degree to which the claims being made depend on the presumption that one is working with a very strong logic. (shrink)

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 (...) to abandon some of the components of hegemonic programs. (shrink)

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 (...) Proposal extends the LRQ to characterize approaches with sequences of questions and factors. I highlight the importance that ordering one’s investigation plays in approaches at the level of adaptationism by analyzing two research programs in community ecology: competitionists and neutralists. Competitionists and neutralists take opposed starting points and use explanatory and developmental heuristics to consider more factors in due time. On the Ordered Factors Proposal, these approaches are not only the ecological factors they are open to considering but also the order in which they will consider them. My disagreement with Lloyd’s over how to characterize methodological approaches reflects different views about methodological monism and pluralism. (shrink)

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 (...) suggest that LBT has utility beyond philosophical counseling and is a viable intervention in the treatment of certain mental health disorders, like substance use disorders. I provide a brief overview of LBT and then discuss a LBT case study with a client suffering diagnosed with a substance use disorder. In the case study the client was advised to apply the moral philosophy of Friedrich Nietzsche as an uplifting philosophical framework to counteract his unproductive worldview and fallacious thinking. Considering that there is an ostensibly low efficacy rate for the treatment of addiction, articulating the value of philosophical psychotherapies in the context of addiction treatment can assist in the development of novel philosophically-based addiction treatment and recovery-oriented programs––thus expanding the treatment and recovery options available for those seeking recovery from addiction. (shrink)

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 (...) flaw. However, since different programs and machines can interact with (or be nested into) one another, we need to account for different kind of errors, and this calls for an evaluation of systems with multiple contaminating values. In this paper, we make steps toward these evaluation systems by considering two logics, HYB1 and HYB2, whose semantic interpretations account for two contaminating values beside classical values 0 and 1. In particular, we provide two main formal contributions. First, we give a characterization of their relations of (multiple-conclusion) logical consequence—that is, necessary and sufficient conditions for a set Δ of formulas to logically follow from a set Γ of formulas in HYB1 or HYB2 . Second, we provide sound and complete sequent calculi for the two logics. (shrink)

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.

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 (...) his followers. In the theory of truth, a key distinction now is made between substantial theories and minimalist or deflationist views. According to the former, truth is a genuine substantial property of the truth-bearers, whereas according to the latter, truth does not have any deeper essence, but all that can be said about truth is contained in T-sentences (sentences having the form: ‘P’ is true if and only if P). There is no necessary analytic connection between the above theories of meaning and truth, but they have nevertheless some connections. Realists often favour some kind of truth-conditional theory of meaning and a substantial theory of truth (in particular, the correspondence theory). Minimalists and deflationists on truth characteristically advocate the use theory of meaning (e.g. Horwich). Semantical anti-realism (e.g. Dummett, Prawitz) forms an interesting middle case: its starting point is the use theory of meaning, but it usually accepts a substantial view on truth, namely that truth is to be equated with verifiability or warranted assertability. When truth is so understood, it is also possible to accept the idea that meaning is closely related to truth-conditions, and hence the conflict between use theories and truth-conditional theories in a sense disappears in this view. (shrink)

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 (...) was originally conceived by Plato and received by Aristotle. I argue that, while Plato allowed that some divisions fail to rigorously investigate the essence, he began a program continued by Aristotle (and others in antiquity and the middle ages) of seeking norms for division that would apply in any domain whatsoever. This idea of a rigorous, general method was taken up and developed by Aristotle in his syllogistic. Aristotle also used Plato's conception of predication as parthood in his semantics for syllogistic propositions. As part of my argument, I prove that a semantics based on Platonic divisional structures is sound and complete for the deduction system used in the literature to model Aristotle's syllogistic. (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)

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 (...) called Transparent Intensional Logic, which is the basis of an important research program based in the Czech Republic and Slovenia. He published a wide range of original work in semantics, philosophy of logic and language, philosophy of science, and metaphysics; but despite the indisputable quality of this work, he has gained little contemporary recognition. This article provides a brief introduction to his work, focussing mainly on basic ideas of his intensional semantics and his theory of 'constructions'. (shrink)

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 (...) illogical premises in practical reasoning that contribute to addiction, because it can contest irrational beliefs in a way that could mitigate the fragmentation anxiety that often arises when individuals relinquish maladaptive self-object organizations. (shrink)

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 (...) is provided with techniques and a worldview that can contribute to a philosophically oriented recovery program. In the case study the client was advised to apply the moral philosophy of Friedrich Nietzsche as an uplifting philosophical framework to counteract his unproductive worldview and fallacious thinking. Considering that there is an ostensibly low efficacy rate for the treatment of addiction, articulating the value of philosophy as a way of life as a recovery pathway provides a conceptual and methodological framework for the development of novel philosophically-based addiction treatment and recovery-oriented programs—thus expanding the treatment and recovery options available for those seeking recovery from addiction. (shrink)

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 (...) being a bounded object allowing us to work with quite similar axioms like the classic Peano axioms, but in a finite environment and with an enriched physical dimension. Finally, we present several enlightening examples and we conclude that the physical numbers provide a natural formal setting for approaching classic problems in number theory from a more hybrid perspective, i.e. with a potential participation in the generation of solutions, not only of working mathematicians but also of more sophisticated artificial interactive (mathematical) intelligent agents (within the context of cognitive-computational metamathematics or artificial mathematical intelligence) and more controlled by physically-inspired principles. Finally, this paper addresses a highly new, bottom-up and paradigm-shifting approach to the foundations of physics: One should refine and improve the conceptual formal setting of the language that we use for understanding physical phenomena (e.g. the mathematical grounding concepts and theories) for being able to understand better more subtle and complex physical phenomena. (shrink)

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 (...) affective computing). -/- The framework relies on 3 main ingredients: a non monotonic extension of standard Description Logics (allowing to reason on exceptions to inheritance in standard knowledge bases) a probabilistic extension coming from the field of logic programming (the DISPONTE semantics) a cognitive heuristics known ad HEAD-Modifier determining preference rules for the inheritance mechanisms of the novel concepts to be generated via commonsense rules. -/- We report the obtained results and the lessons learned of this research path in the context of model-based AI applications. -/- . (shrink)

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 (...) (eg. British Airways IT system). The ideas here were verified by my chess compositions, art works and complex information system as an author of each co uk, and were presented at conferences in Santorini, Adelaide, Geneva, Daejon and virtually. (shrink)

Most formalisms for representing common-sense knowledge allow incomplete and potentially inconsistent information. When strong negation is also allowed, contradictory conclusions can arise. A criterion for deciding between them is needed. The aim of this paper is to investigate an inherent and autonomous comparison criterion, based on specificity as defined in [POO 85, SIM 92]. In contrast to other approaches, we consider not only defeasible, but also strict knowledge. Our criterion is context-sensitive, i. e., preference among defeasible rules is determined dynamically (...) during the dialectical analysis.We show how specificity can be defined in terms of two different approaches: activation sets and derivation trees. This allows us to get a syntactic criterion that can be implemented in a computationally attractive way. The resulting definitions may be applied in general rulebased formalisms. We present theorems linking both characterizations. Finally we discuss other frameworks for defeasible reasoning in which preference handling is considered explicitly. (shrink)

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 (...) the raw sensory input had already been parsed using a set of discrete categories, so that all the system had to do was receive this already-digested symbolic input, and make sense of it. But what if we don't have access to pre-parsed input? What if our sensory sequence is raw unprocessed information? The central contribution of this paper is a neuro-symbolic framework for distilling interpretable theories out of streams of raw, unprocessed sensory experience. First, we extend the definition of the apperception task to include ambiguous (but still symbolic) input: sequences of sets of disjunctions. Next, we use a neural network to map raw sensory input to disjunctive input. Our binary neural network is encoded as a logic program, so the weights of the network and the rules of the theory can be solved jointly as a single SAT problem. This way, we are able to jointly learn how to perceive (mapping raw sensory information to concepts) and apperceive (combining concepts into declarative rules). (shrink)

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 (...) this relation must be given in the form of a logic program. The resulting system does not only throw light on the properties of sense and their relation to computation, but also shows circular behaviour if some ingredients of the Liar Paradox are added. The connection is natural, as algorithms can be inherently circular and the Liar is explained as expressing one of those. Many ideas in the present paper are closely related to those in Moschovakis (1994), but receive a considerably lighter formalization. (shrink)

We all know that problems of transportation and allocation appear frequently in practical life. We need to transfer materials from production centers to consumption centers to secure the areas’ need for the transported material or allocate machines or people to do a specific job at the lowest cost, or in the shortest time. We know that the cost factors Time is one of the most important factors that decision-makers care about because it plays an “important” role in many of the (...) practical and scientific issues that we face in our daily lives, and we need careful study to enable us to avoid losses. For this, the linear programming method was used, which is one of the research methods. Processes, where the problem data is converted into a linear mathematical model for which the optimal solution achieves the desired goal. Since these models are linear models, we can solve them using the direct simplex method and its modifications, but the specificity that these models enjoy has enabled scholars and researchers to find special methods that help us in obtaining the optimal solution. Whatever the method used, the goal is to determine the number of units transferred from any material from production centers to consumption centers, or to allocate a machine or person to do a job so that the cost or time is as short as possible. These issues were addressed according to classical logic, but the ideal solution was a specific value appropriate to the conditions in which the data was collected and does not take into account the changes that may occur in the work environment. In order to obtain results that are more accurate and enjoy a margin of freedom, we present in this book a study of transport issues and neutrosophic allocation issues and some methods for solving them. By neutrosophic issues we mean These are the problems in which the data are neutrosophic values, i.e. the required quantities and the available quantities. (shrink)

Action Languages are formal methods of talking about actions and their effects on fluents. One recent approach in planning is to define the domains of the planning problems using action languages. The aim of this research is to find a plan for a system defined in the action language C by translating it into a causal theory and then finding an equivalent logic program. The planning problem will then be reduced to finding the answer set (stable model) of this (...) logic program. This planner will be added as an extension to the Causal Calculator (CCALC) which is a model checker for the language of the causal theories. (shrink)

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 (...) any formula of syllogistic enriched with classical connectives is decidable using models in the domain with three members. (shrink)