Logical puzzles like the doctrinal paradox raise the problem of how to aggregate individual judgements into a collective judgement, or alternatively, how to merge collectively inconsistent knowledge bases. In this paper, we view judgement aggregation as a function on propositional logic valuations, and we investigate how logic constrains judgement aggregation. In particular, we show that there is no non-dictatorial decision method for aggregating sets of judgements in a logically consistent way if the decision method is local, i.e., only depends (...) on the individual judgements on the proposition under consideration. (shrink)

Logical puzzles like the doctrinal paradox raise the problem of how to aggregate individual judgements into a collective judgement, or alternatively, how to merge collectively inconsistent knowledge bases. In this paper, we view judgement aggregation as a function on propositional logic valuations, and we investigate how logic constrains judgement aggregation. In particular, we show that there is no non-dictatorial decision method for aggregating sets of judgements in a logically consistent way if the decision method is local, i.e., only depends (...) on the individual judgements on the proposition under consideration. (shrink)

James Sterba uses the Pauline Principle to argue that the occurrence of significant, horrendous evils is logically incompatible with the existence of a good God. The Pauline Principle states that (as a rule) one must never do evil so that good may come from it, and according to Sterba, this principle implies that God may not permit significant evils even if that permission would be necessary to secure other, greater goods. By contrast, I argue that the occurrence of significant evils (...) is logically compatible with the existence of a good God because victims of significant evils may themselves reasonably consent to their suffering. In particular, I argue that they may be able to accept their suffering if it turns out that there was no way for God to secure relevant greater goods (or prevent other, greater evils) except by way of allowing their suffering, and God also provides them with other compensating, heavenly comforts. After using this consent-based argument to address Sterba’s logical problem from evil, I briefly consider how this argument may also help address a related evidential problem from evil, which suggests that while it is possible that victims of significant evils would consent to their suffering, it is unlikely that they would do so. While I do not provide a definitive solution to this evidential problem of evil, I highlight one important example of a trade-off that God may need to make that would—along with the provision of compensating, heavenly comforts—potentially persuade victims of significant evils to consent to their suffering. Specifically, I argue that there may be a necessary trade-off that God needs to make between permitting significant evils (on the one hand) and protecting a certain, morally significant form of free will (on the other hand). (shrink)

What role, if any, does formal logic play in characterizing epistemically rational belief? Traditionally, belief is seen in a binary way - either one believes a proposition, or one doesn't. Given this picture, it is attractive to impose certain deductive constraints on rational belief: that one's beliefs be logically consistent, and that one believe the logical consequences of one's beliefs. A less popular picture sees belief as a graded phenomenon.

This collection of current research on logic programming languages presents results from a three-year, ESPRIT-funded effort to explore the integration of the foundational issues of functional, logic, and object-oriented programming. It offers valuable insights into the fast-developing extensions of logic programming with functions, constraints, concurrency, and objects. Chapters are grouped according to the unifying themes of functional programming, constraint, logic programming, and object-oriented programming.

In his new book, Logical Form, Andrea Iacona distinguishes between two different roles that have been ascribed to the notion of logical form: the logical role and the semantic role. These two roles entail a bifurcation of the notion of logical form. Both notions of logical form, according to Iacona, are descriptive, having to do with different features of natural language sentences. I agree that the notion of logical form bifurcates, but not that the (...) logical role is merely descriptive. In this paper, I focus on formalization, a process by which logical form, on its logical role, is attributed to natural language sentences. According to some, formalization is a form of explication, and it involves normative, pragmatic, as well as creative aspects. I present a view by which formalization involves explicit commitments on behalf of a reasoner or an interpreter, which serve the normative grounds for the evaluation of a given text. In previous work, I proposed the framework of semantic constraints for the explication of logical consequence. Here, I extend the framework to include formalization constraints. The various constraints then serve the role of commitments. I discuss specific issues raised by Iacona concerning univocality, co-reference and equivocation, and I show how our views on these matters diverge as a result of our different starting assumptions. (shrink)

In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the input/output system, (...) considering only the maximal subsets that do not yield output conflicting with a given input. When inputs are authorised to reappear as outputs, both maxichoice revision in the sense of Alchourr6n/Makinson and the default logic of Poole emerge as special cases, and there is a close relation with Reiter default logic. However, our focus is on the general case where inputs need not be outputs. We show in what contexts the consistency of input with output may be reduced to its consistency with a truth-functional combination of components of generators, and under what conditions constrained output may be obtained by a derivation that is constrained at every step. (shrink)

We revisit a typological puzzle due to Horn (Doctoral Dissertation, UCLA, 1972) regarding the lexicalization of logical operators: in instantiations of the traditional square of opposition across categories and languages, the O corner, corresponding to ‘nand’ (= not and), ‘nevery’ (= not every), etc., is never lexicalized. We discuss Horn’s proposal, which involves the interaction of two economy conditions, one that relies on scalar implicatures and one that relies on markedness. We observe that in order to express markedness and (...) to account for a bigger typological puzzle, namely the absence of lexicalizations of ‘XOR’ (= exclusive or), ‘all-or-none’, and many other imaginable logical operators, one must restrict the basic lexicalizable elements to a small set of primitives. We suggest that an ordering based perspective, following Keenan and Faltz (Boolean semantics for natural language, 1985), makes the stipulated primitives that we arrive at more natural. We also propose a modification to Horn’s proposal, based on recent work on implicatures, in which only the implicature condition is operative and in which markedness is part of the definition of the alternatives for scalar implicatures rather than an independent condition. (shrink)

A pioneering look at the fundamental role of logic in optimizationand constraint satisfaction While recent efforts to combine optimization and constraintsatisfaction have received considerable attention, little has beensaid about using logic in optimization as the key to unifying thetwo fields. Logic-Based Methods for Optimization develops for thefirst time a comprehensive conceptual framework for integratingoptimization and constraint satisfaction, then goes a step furtherand shows how extending logical inference to optimization allowsfor more powerful as well as flexible modeling and (...) solutiontechniques. Designed to be easily accessible to industryprofessionals and academics in both operations research andartificial intelligence, the book provides a wealth of examples aswell as elegant techniques and modeling frameworks ready forimplementation. Timely, original, and thought-provoking,Logic-Based Methods for Optimization: * Demonstrates the advantages of combining the techniques inproblem solving * Offers tutorials in constraint satisfaction/constraintprogramming and logical inference * Clearly explains such concepts as relaxation, cutting planes,nonserial dynamic programming, and Bender's decomposition * Reviews the necessary technologies for software developersseeking to combine the two techniques * Features extensive references to important computationalstudies * And much more. (shrink)

Constraint programming is the fruit of several decades of research carried out in mathematical logic, automated deduction, operations research and arti?cial intelligence. The tools and programming languages arising from this research?eldhaveenjoyedrealsuccessintheindustrialworldastheycontributetosolving hard combinatorial problems in diverse domains such as production planning, communication networks, robotics and bioinformatics. This volume contains the extended and reviewed versions of a selection of papers presented at the Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, which was held from June (...) 30 to July 2, 2003. The venue chosen for the seventh edition of this annual workshop was the Computer and Automation Research Institute of the Hungarian Academy of Sciences in Budapest, Hungary. This institute is one of the 20 members of the Working Group on Constraints of the European Research Consortium for Informatics and Mathematics. For many participants this workshop provided the?rst opportunity to visit their ERCIM partner in Budapest. CoLogNET is the European-funded network of excellence dedicated to s- porting and enhancing cooperation and research on all areas of computational logic, and continues the work done previously by the Compulog Net. In part- ular, the aim of the logic and constraint logic programming area of CoLogNET is to foster and support all research activities related to logic programming and constraint logic programming. The editors would like to take the opportunity and thank all the authors who submitted papers to this volume, as well as the reviewers for their helpful work. (shrink)

Palmer's “isomorphism constraint” presupposes the logical possibility of two qualitatively disparate sets of sensory experiences exhibiting the same relationships. Two arguments are presented to demonstrate that, because such a state of affairs cannot be coherently specified, its occurrence is not logically possible. The prospects for behavioral and biological science are better than Palmer suggests; those for functionalism are worse.

This book constitutes the refereed proceedings of the 20th International Conference on Logic Programming, ICLP 2004, held in Saint-Malo, France in September 2004. The 28 revised full papers and 16 poster papers presented together with 2 invited papers were carefully reviewed and selected from 70 submissions. The papers are organized in topical sections on program analysis, constraints, alternative programming paradigms, answer set programming, and implementation.

Sport occupies a significant role in modern society and has a wide following. In his Leftist Theories of Sport, Morgan examines what he considers to be a degradation of modern sport and the lack of proper critical theory to address this challenge. In the latter part of LTS, Morgan presents a reconstructed critical theory with ‘a liberal twist’ in terms of an analysis of what he sees as the internal ‘gratuitous’ logic of sport, and a call for critical deliberation in (...) sporting practice communities. I depart from Morgan’s ideas of the ‘gratuitous’ logic of sport which, I believe, has significant potential and operative force. I interpret the logic of sport as forms of self-imposed constraints at three levels: in the logic of the rules, in norms for fair play, and in a particular interpretation of sporting excellence as a form of human excellence. Using the practical case of performance-enhancing drugs, I demonstrate how this interpretation can exert operative power. I conclude by pointing to th... (shrink)

In this paper I discuss a prevailing view by which logical terms determine forms of sentences and arguments and therefore the logical validity of arguments. This view is common to those who hold that there is a principled distinction between logical and nonlogical terms and those holding relativistic accounts. I adopt the Tarskian tradition by which logical validity is determined by form, but reject the centrality of logical terms. I propose an alternative framework for logic (...) where logical terms no longer play a distinctive role. This account employs a new notion of semantic. (shrink)

The article presents several adaptive fuzzy hedge logics. These logics are designed to perform a specific kind of hedge detection. Given a premise set Γ that represents a series of communicated statements, the logics can check whether some predicate occurring in Γ may be interpreted as being (implicitly) hedged by technically, strictly speaking or loosely speaking, or simply non-hedged. The logics take into account both the logical constraints of the premise set as well as conceptual information concerning the meaning (...) of potentially hedged predicates (stored in the memory of the interpreter in question). The proof theory of the logics is non-monotonic in order to enable the logics to deal with possible non-monotonic interpretation dynamics (this is illustrated by means of several concrete proofs). All the adaptive fuzzy hedge logics are also sound and strongly complete with respect to their [0,1]-semantics. (shrink)

The article presents several adaptive fuzzy hedge logics. These logics are designed to perform a specific kind of hedge detection. Given a premise set Γ that represents a series of communicated statements, the logics can check whether some predicate occurring in Γ may be interpreted as being (implicitly) hedged by technically, strictly speaking or loosely speaking, or simply non-hedged. The logics take into account both the logical constraints of the premise set as well as conceptual information concerning the meaning (...) of potentially hedged predicates (stored in the memory of the interpreter in question). The proof theory of the logics is non-monotonic in order to enable the logics to deal with possible non-monotonic interpretation dynamics (this is illustrated by means of several concrete proofs). All the adaptive fuzzy hedge logics are also sound and strongly complete with respect to their [0,1]-semantics. (shrink)

Unlike statutory law, which relies on the explicit formulation of rules, common law is thought to emerge from a complex doctrine of precedential constraint, according to which decisions in earlier cases constrain later courts while still allowing these courts the freedom to address new situations in creative ways. Although this doctrine is applied by legal practitioners on a daily basis, it has proved to be considerably more difficult to develop an adequate theoretical account of the doctrine itself. Drawing on (...) recent work in legal theory, as well as AI and law, this book develops a new account of precedential constraint and the balance achieved in the common law between constraint and freedom. This account, which involves construction of a group priority ordering among reasons, is then applied to other topics including the semantics of open-textured predicates and the practice of making exceptions to general rules. (shrink)

Logic arguably plays a role in the normativity of reasoning. In particular, there are plausible norms of belief/disbelief whose antecedents are constituted by claims about what follows from what. But is logic also relevant to the normativity of agnostic attitudes? The question here is whether logical entailment also puts constraints on what kinds of things one can suspend judgment about. In this paper I address that question and I give a positive answer to it. In particular, I advance two (...) logical norms of agnosticism, where the first one allows us to assess situations in which the subject is agnostic about the conclusion of a valid argument and the second one allows us to assess situations in which the subject is agnostic about one of the premises of a valid argument. (shrink)

A natural suggestion and increasingly popular account of how to revise our logical beliefs treats revision of logic analogously to the revision of scientific theories. I investigate this approach and argue that simple applications of abductive methodology to logic result in revision-cycles, developing a detailed case study of an actual dispute with this property. This is problematic if we take abductive methodology to provide justification for revising our logical framework. I then generalize the case study, pointing to similarities (...) with more recent and popular heterodox logics such as naïve logics of truth. I use this discussion to motivate a constraint—logical partisanhood—on the uses of such methodology: roughly: both the proposed alternative and our actual background logic must be able to agree that moving to the alternative logic is no worse than staying put. (shrink)

We present an overview of linear-time temporal logics with Presburger constraints whose models are sequences of tuples of integers. Such formal specification languages are well-designed to specify and verify systems that can be modelled with counter systems. The paper recalls the general framework of LTL over concrete domains and presents the main decidability and complexity results related to fragments of Presburger LTL. Related formalisms are also briefly presented.

We study probabilistic logic under the viewpoint of the coherence principle of de Finetti. In detail, we explore how probabilistic reasoning under coherence is related to model- theoretic probabilistic reasoning and to default reasoning in System . In particular, we show that the notions of g-coherence and of g-coherent entailment can be expressed by combining notions in model-theoretic probabilistic logic with concepts from default reasoning. Moreover, we show that probabilistic reasoning under coherence is a generalization of default reasoning in System (...) . That is, we provide a new probabilistic semantics for System , which neither uses infinitesimal probabilities nor atomic bound (or big-stepped) probabilities. These results also provide new algorithms for probabilistic reasoning under coherence and for default reasoning in System , and they give new insight into default reasoning with conditional objects. (shrink)

This volume presents a collection of refereed papers reflecting the state of the art in the area of over-constrained systems. Besides 11 revised full papers, selected from the 24 submissions to the OCS workshop held in conjunction with the First International Conference on Principles and Practice of Constraint Programming, CP '95, held in Marseilles in September 1995, the book includes three comprehensive background papers of central importance for the workshop papers and the whole field. Also included is an introduction (...) by one of the volume editors together with a bibliography listing 243 entries. All in all this is a very useful reference book relevant for all researchers and practitioners interested in hierarchical, partial, and over-constrained systems. (shrink)

In this paper we present an executable approach to model interactions between agents that involve sensitive, privacy-related information. The approach is formal and based on deontic, epistemic and action logic. It is conceptually related to the Belief-Desire-Intention model of Bratman. Our approach uses the concept of sphere as developed by Waltzer to capture the notion that information is provided mostly with restrictions regarding its application. We use software agent technology to create an executable approach. Our agents hold beliefs about the (...) world, have goals and commitment to the goals. They have the capacity to reason about different courses of action, and communicate with one another. The main new ingredient of our approach is the idea to model information itself as an intentional agent whose main goal it is to preserve the integrity of the information and regulate its dissemination. We demonstrate our approach by applying it to an important process in the insurance industry: applying for a life insurance.In this paper we will: (1) describe the challenge organizational complexity poses in moral reasoning about informational relationships; (2) propose an executable approach, using software agents with reasoning capacities grounded in modal logic, in which moral constraints on informational relatio nships can be modeled and investigated; (3) describe the details of our approach, in which information itself is modeled as an intentional agent in its own right; (4) test and validate it by applying it to a concrete ‘hard case’ from the insurance industry; and (5) conclude that our approach upholds and offers potential for both research and practical application. (shrink)

The article presents several adaptive fuzzy hedge logics . These logics are designed to perform a specific kind of hedge detection. Given a premise set Γ that represents a series of communicated statements, the logics can check whether some predicate occurring in Γ may be interpreted as being (implicitly) hedged by technically , strictly speaking or loosely speaking , or simply non-hedged. The logics take into account both the logical constraints of the premise set as well as conceptual information (...) concerning the meaning of potentially hedged predicates (stored in the memory of the interpreter in question). The proof theory of the logics is non-monotonic in order to enable the logics to deal with possible non-monotonic interpretation dynamics (this is illustrated by means of several concrete proofs). All the adaptive fuzzy hedge logics are also sound and strongly complete with respect to their [0,1]-semantics. (shrink)

The papers presented in this volume examine topics of central interest in contemporary philosophy of logic. They include reflections on the nature of logic and its relevance for philosophy today, and explore in depth developments in informal logic and the relation of informal to symbolic logic, mathematical metatheory and the limiting metatheorems, modal logic, many-valued logic, relevance and paraconsistent logic, free logics, extensional v. intensional logics, the logic of fiction, epistemic logic, formal logical and semantic paradoxes, the concept of (...) truth, the formal theory of entailment, objectual and substitutional interpretation of the quantifiers, infinity and domain constraints, the Löwenheim-Skolem theorem and Skolem paradox, vagueness, modal realism v. actualism, counterfactuals and the logic of causation, applications of logic and mathematics to the physical sciences, logically possible worlds and counterpart semantics, and the legacy of Hilbert’s program and logicism. The handbook is meant to be both a compendium of new work in symbolic logic and an authoritative resource for students and researchers, a book to be consulted for specific information about recent developments in logic and to be read with pleasure for its technical acumen and philosophical insights. Key Features - Written by leading logicians and philosophers - Comprehensive authoritative coverage of all major areas of contemporary research in symbolic logic - Clear, in-depth expositions of technical detail - Progressive organization from general considerations to informal to symbolic logic to nonclassical logics - Presents current work in symbolic logic within a unified framework - Accessible to students, engaging for experts and professionals - Insightful philosophical discussions of all aspects of logic -Useful bibliographies in every chapter - Written by leading logicians and philosophers - Comprehensive authoritative coverage of all major areas of contemporary research in symbolic logic - Clear, in-depth expositions of technical detail - Progressive organization from general considerations to informal to symbolic logic to nonclassical logics - Presents current work in symbolic logic within a unified framework - Accessible to students, engaging for experts and professionals - Insightful philosophical discussions of all aspects of logic - Useful bibliographies in every chapter. (shrink)

The year 2012 has witnessed worldwide celebrations of Alan Turing’s 100th birthday. A great number of conferences and workshops were organized by logicians, computer scientists and researchers in AI, showing the continued flourishing of computer science, and the fruitful interfaces between logic and computer science. Logic is no longer just the concept that Frege had about one hundred years ago, let alone that of Aristotle twenty centuries before. One of the prominent features of contemporary logic is its interdisciplinary character, connecting (...) across mathematics, philosophy, modern computer science, and even the cognitive and social sciences. -/- China is no exception. This special issue explores interfaces of logic with AI and other disciplines, and it attempts to give a bird’s eye view of the developing landscape of logic and AI in China. Our contributors come from computer science, AI, philosophy and linguistics, united by their interest in using formal logical tools and notions to deal with substantial problems in their fields. We are aware that AI is a vast area, and that the limitations of space in a volume like this may provide a somewhat incomplete or biased view. Still we hope that the six papers selected here illustrate the concerns and curiosity driving Chinese researchers, on topics shared with our colleagues around the world. -/- One of the active research areas in AI is planning under uncertainty, with incomplete knowledge, where a well-established logical framework is the action language of Son and Baral (Son and Baral 2001). This language can express the notions of sensing actions and making conditional plans. However, its current semantics is not yet satisfactory, since according to the semantics an agent would not have knowledge of what happens after a plan is executed, which can be a serious problem in a safety-critical environment. In their paper Proof Systems for Planning under Cautious Semantics (Shen and Zhao 2013), Yuping Shen and Xishun Zhao address this problem and propose a cautious and weakly cautious semantics for the action language. This new semantics enables the agent to know exactly what happens after executing an action. Hoare style proof systems are then proposed and proved to be sound and complete. What is more, the proposed new system reduces the reasoning complexity of the action language. -/- In Preferential Semantics for Plausible Subsumption in Possibility Theory (Qi and Zhang 2013), Guilin Qi and Zhizheng Zhang investigate another important issue in AI: how to handle exceptions in a knowledge-based system. This has become a hot topic in recent years, especially in ontological design, where description logics are widely used. The question then arises whether we can get a nonmonotonic extension of description logic. To answer this, the authors first propose three preferential semantics for plausible subsumption in the framework of possibility theory (Dubois and Prade 1985) and study their properties and their relationships. Then they introduce preferential subsumptions to a description logic-based knowledge system, and define an entailment relation of plausible subsumption. Moreover, they study reductions of the new semantics to standard semantics for an expressive description logic. -/- Counterfactual reasoning has been explored extensively by philosophers, cf. Lewis (1973), Stalnaker (1968). But in the last two decades, causal models have been proposed for modeling counterfactual reasoning by researchers in AI. In A Lewisian Logic of Causal Counterfactuals (Zhang 2013), Jiji Zhang studies classes of causal models and provides formal characterizations. In particular, a new logic system is proposed and proved complete for the class of ‘Lewisian models’ satisfying all the principles of David Lewis’s logic of counterfactuals. Moreover, Zhang compares his new framework with those of Lewis and Stalnaker, and also establishes formal connections with more recent approaches by Galles and Pearl, and by Halpern. -/- Consistency is a fundamental notion in logic, but it also plays a key role in many techniques for solving constraint satisfaction problems (Mackworth 1977). In Variable-Centered Consistency in Model RB (Li et al. 2013), Liang Li, Tian Liu and Ke Xu start with a discussion of i-consistency in ‘Model RB’ and ‘Model RD’, two models of random constraint satisfaction problems with growing domain size, then compare it with the notion of t-consistency and strong t-consistency in well-known earlier work by Freuder. After that, the authors define a new kind of variable-centered consistency, and show an upper bound on a suitably chosen parameter in Model RB and Model RD, such that up to this bound, all typical instances of Model RB are variable-centered consistent. -/- Language understanding is a cognitive process that human beings carry out every day. Metaphor is a pervasive phenomenon in natural languages, and its cognitive role calls for interpretation. There is a growing body of literature on cognitive mechanisms underlying metaphor. The paper An Ontology-Based Approach to Metaphor Cognitive Computation (Huang et al. 2013) by Xiaoxi Huang, Huaxin Huang, Beishui Liao, and Cihua Xu proposes a theoretical framework for metaphor understanding based on recent results from cognitive science (Shutova 2010). They then introduce ontology as a knowledge representation method, and present a new ontological model to formalize metaphor-based knowledge. An algorithmic description is provided using a quantitative measure of integrated degree, and its effectiveness is demonstrated. -/- Puzzles and their solution mechanisms are a recurrent theme in many fields. Dynamic epistemic logic (van Ditmarsch et al. 2007); (van Benthem 2011) is a recent framework that can handle information dynamics in knowledge puzzles. In Reasoning About Agent Types and the Hardest Logic Puzzle Ever (Liu and Wang 2013), Fenrong Liu and Yanjing Wang propose a new dynamic-epistemic logic that can specify different types of agents and analyse agents’ knowledge, communication and reasoning. To demonstrate its power, Smullyan’s well-known Knights and Knaves puzzles are formalized, as well as the Hardest Logic Puzzle Ever (HLPE) of Boolos (Boolos 1996). Moreover, a spectrum of new puzzles is found involving knowledge-based agent types, and their solution complexity is shown to be harder than that for existing logic puzzles. It is also shown that a version of HLPE in which the agents do not know the others’ types does not have a solution at all. -/- Finally, we would like to thank the editor of Minds and Machines, Gregory Wheeler, for his efficient assistance and kind support. We also thank Ties Nijssen at Springer for his encouragement to start this project at the first place. And of course, our appreciation goes to our authors, as well as all the colleagues who have helped us review the papers in this collection. (shrink)

Logic is a celebrated representation language because of its formal generality. But there are two senses in which a logic may be considered general, one that concerns a technical ability to discriminate between different types of individuals, and another that concerns constitutive norms for reasoning as such. This essay embraces the former, permutation-invariance conception of logic and rejects the latter, Fregean conception of logic. The question of how to apply logic under this pure invariantist view is addressed, and a methodology (...) is given. The pure invariantist view is contrasted with logical pluralism, and a methodology for applied logic is demonstrated in remarks on a variety of issues concerning non-monotonic logic and non-monotonic inference, including Charles Morgan’s impossibility results for non-monotonic logic, David Makinson’s normative constraints for non-monotonic inference, and Igor Douven and Timothy Williamson’s proposed formal constraints on rational acceptance. (shrink)

K. R. Popper distinguished between two main uses of logic, the demonstrational one, in mathematical proofs, and the derivational one, in the empirical sciences. These two uses are governed by the following methodological constraints: in mathematical proofs one ought to use minimal logical means (logical minimalism), while in the empirical sciences one ought to use the strongest available logic (logical maximalism). In this paper I discuss whether Popper’s critical rationalism is compatible with a revision of logic in (...) the empirical sciences, given the condition of logical maximalism. Apparently, if one ought to use the strongest logic in the empirical sciences, logic would remain immune to criticism and, thus, non-revisable. I will show that critical rationalism is theoretically compatible with a revision of logic in the empirical sciences. However, a question that remains to be clarified by the critical rationalists is what kind of evidence would lead them to revise the system of logic that underlies a physical theory, such as quantum mechanics? Popper’s falsificationist methodology will be compared with the recently advocated extension of the abductive methodology from the empirical sciences to logic by T. Williamson, since both of them arrive at the same conclusion concerning the status of classical logic. (shrink)

We present two approaches to investigate the validity of connexive principles and related formulas and properties within coherence-based probability logic. Connexive logic emerged from the intuition that conditionals of the formif not-A,thenA, should not hold, since the conditional’s antecedentnot-Acontradicts its consequentA. Our approaches cover this intuition by observing that the only coherent probability assessment on the conditional event$${A| \overline{A}}$$A|A¯is$${p(A| \overline{A})=0}$$p(A|A¯)=0. In the first approach we investigate connexive principles within coherence-based probabilistic default reasoning, by interpreting defaults and negated defaults in terms (...) of suitable probabilistic constraints on conditional events. In the second approach we study connexivity within the coherence framework of compound conditionals, by interpreting connexive principles in terms of suitable conditional random quantities. After developing notions of validity in each approach, we analyze the following connexive principles:Aristotle’s theses,Aristotle’s Second Thesis,Abelard’s First Principle, andBoethius’ theses. We also deepen and generalize some principles and investigate further properties related to connexive logic (likenon-symmetry). Both approaches satisfyminimalrequirements for a connexive logic. Finally, we compare both approaches conceptually. (shrink)

"Philosophical logic" describes two distinct areas: the investigation of the fundamental concepts of logic, the formal investigation of alternatives and extensions to classical logic. The first is a philosophical discipline, concerned with notions like truth, propositions, necessity, logical consequence, vagueness, and reasoning. The second is a technical discipline, devoted to developing formal logical systems-modal logics, second-order logics, intuitionistic logics, relevance logics, logics of vagueness and conditionals-and proving things about them. Most texts in philosophical logic focus on one of (...) these areas, but in this book John MacFarlane treats them together in an integrated way, showing how philosophical considerations motivate the technical projects, and how the constraints revealed by the technical projects illuminate the philosophical issues. Topics covered include quantifiers, modal logic, indicative conditionals, model-theoretic and proof-theoretic characterizations of logical consequence, intuitionistic logic, fundamental logical disagreement, relevance logic, the relation of logic and reasoning, and vagueness. Each chapter is organized around suggested readings and includes exercises. Key Features: An integrated treatment of the technical and philosophical issues comprising philosophical logic Written by a leading authority on logicism and logical form and a successful expositor and teacher Designed to serve students taking only one course in logic beyond the introductory level Provides tools and concepts necessary to understand work in many areas of analytic philosophy Includes exercises, suggested readings, and suggestions for further exploration in each chapter. (shrink)

Monists say that the nature of truth is invariant, whichever sentence you consider; pluralists say that the nature of truth varies between different sets of sentences. The orthodoxy is that logic and logical form favour monism: there must be a single property that is preserved in any valid inference; and any truth-functional complex must be true in the same way as its components. The orthodoxy, I argue, is mistaken. Logic and logical form impose only structural constraints on a (...) metaphysics of truth. Monistic theories are not guaranteed to satisfy these constraints, and there is a pluralistic theory that does so. (shrink)

Relevance logic is ordinarily seen as a subsystem of classical logic under the translation that replaces arrows by horseshoes. If, however, we consider the arrow as an additional connective alongside the horseshoe, then another perspective emerges: the theses of relevance logic, specifically the system R, may also be seen as the output of a conservative extension of the relation of classical consequence. We describe two ways in which this may be done. One is by defining a suitable closure relation out (...) of the set of theses of relevance logic; the other is by adding to the usual natural deduction system for it further rules with ‘projective constraints’, whose application restricts the subsequent application of other rules. The significance of the two constructions is also discussed. (shrink)

Is logic normative for reasoning? In the wake of work by Gilbert Harman and John MacFarlane, this question has been reduced to: are there any adequate bridge principles which link logical facts to normative constraints on reasoning? Hitherto, defenders of the normativity of logic have exclusively focussed on identifying adequate validity bridge principles: principles linking validity facts—facts of the form 'gamma entails phi'—to normative constraints on reasoning. This paper argues for two claims. First, for the time being at least, (...) Harman’s challenge cannot be surmounted by articulating validity bridge principles. Second, Harman’s challenge can be met by articulating invalidity bridge principles: principles linking invalidity facts of the form 'gamma does not entail phi' to normative constraints on reasoning. In doing so, I provide a novel defence of the normativity of logic. (shrink)

Donald Davidson contributed to the discussion of logical form in two ways. On the one hand, he made several influential suggestions on how to give the logical forms of certain constructions of natural language. His account of adverbial modification and so called action-sentences is nowadays, in some form or other, widely employed in linguistics (Harman (forthcoming) calls it "the standard view"). Davidson's approaches to indirect discourse and quotation, while not as influential, also still attract attention today. On the (...) other hand, Davidson provided a general account of what logical form is. This paper is concerned with this general account. Its foremost aim is to give a faithful and detailed picture of what, according to Davidson, it means to give the logical form of a sentence. The structure of the paper is as follows. (1) I will first informally introduce a notion of logical form as the form that matters in certain kinds of entailments, and indicate why philosophers have taken an interest in such a notion. (2) The second section develops constraints that we should arguably abide by in giving an account of logical form. (3) I then turn to Davidson’s view of what is involved in giving such an account. To this end, I will try to reconstruct Davidson’s view of the connection between an assignment of logical forms, a truth theory and a meaning theory. (4) Finally, I will briefly discuss possible problems of Davidson’s account as developed in this paper. (shrink)

Propositional logic, with the aid of SAT solvers, has become capable of solving a range of important and complicated problems. Expanding this range, to contain additional varieties of problems, is subject to the complexity resulting from encoding counting constraints in conjunctive normal form. Due to the limitation of the expressive power of propositional logic, generally, such an encoding increases the numbers of variables and clauses excessively. This work eliminates the indicated drawback by interpolating constraint symbols and the set of (...) natural numbers \ into the alphabet of propositional logic and adjusting the underlying language accordingly. In the extended logic counting constraints are naturally formulated, while many important aspects, such as Boolean nature and the soundness and completeness theorems, are kept preserved. (shrink)

In their brief online presentation "Qu'est-ce que l'Oulipo?", Jacques Roubaud and Marcel Bénabou explain how Oulipians proceed in the exploration of the lipo, littérature potentielle: "Certes, MAIS COMMENT?", they ask, before replying: "En inventant des contraintes. Des contraintes nouvelles et anciennes, difficiles et moins diiffficiles et trop diiffiiciiiles. La Littérature Oulipienne est une LITTÉRATURE SOUS CONTRAINTES." The vigorous tone conveyed by spelling and typography points to the distinct challenge posed by Oulipian writing, which relies on the difficulty of the (...) class='Hi'>constraint in its effort to reach as far as possible into the uncharted territory of potential literature.... (shrink)

The SRL of King is a sound, complete and decidable logic designed specifically to support formalisms for the HPSG of Pollard and Sag. The SRL notion of modellability in a signature is particularly important for HPSG, and the present paper modifies an elegant method due to Blackburn and Spaan in order to prove that – modellability in each computable signature is 1 0 – modellability in some finite signature is 1 0 -hard, and – modellability in some finite signature is (...) decidable. (shrink)

This paper seeks to defend the following conclusions: The program advanced by Carnap and other necessarians for probability logic has little to recommend it except for one important point. Credal probability judgments ought to be adapted to changes in evidence or states of full belief in a principled manner in conformity with the inquirer’s confirmational commitments—except when the inquirer has good reason to modify his or her confirmational commitment. Probability logic ought to spell out the constraints on rationally coherent confirmational (...) commitments. In the case where credal judgments are numerically determinate confirmational commitments correspond to Carnap’s credibility functions mathematically represented by so—called confirmation functions. Serious investigation of the conditions under which confirmational commitments should be changed ought to be a prime target for critical reflection. The necessarians were mistaken in thinking that confirmational commitments are immune to legitimate modification altogether. But their personalist or subjectivist critics went too far in suggesting that we might dispense with confirmational commitments. There is room for serious reflection on conditions under which changes in confirmational commitments may be brought under critical control. Undertaking such reflection need not become embroiled in the anti inductivism that has characterized the work of Popper, Carnap and Jeffrey and narrowed the focus of students of logical and methodological issues pertaining to inquiry. (shrink)

Includes tutorials, invited lectures, and refereed papers on all aspects of logic programming including: Constraints, Concurrency and Parallelism, Deductive Databases, Implementations, Meta and Higher-order Programming, Theory, and Semantic Analysis. September 2-6, 1996, Bonn, Germany Every four years, the two major international scientific conferences on logic programming merge in one joint event. JICSLP'96 is the thirteenth in the two series of annual conferences sponsored by The Association for Logic Programming. It includes tutorials, invited lectures, and refereed papers on all aspects of (...) logic programming including: Constraints, Concurrency and Parallelism, Deductive Databases, Implementations, Meta and Higher-order Programming, Theory, and Semantic Analysis. The contributors are international, with strong contingents from the United States, United Kingdom, France, and Japan. Logic Programming series, Research Reports and Notes. (shrink)