This paper presents the progicnet programme. It proposes a general framework for probabilistic logic that can guide inference based on both logical and probabilistic input. After an introduction to the framework as such, it is illustrated by means of a toy example from psychometrics. It is shown that the framework can accommodate a number of approaches to probabilistic reasoning: Bayesian statistical inference, evidential probability, probabilistic argumentation, and objective Bayesianism. The framework thus provides insight into the relations between these (...) approaches, it illustrates how the results of different approaches can be combined, and it provides a basis for doing efficient inference in each of the approaches. (shrink)

In this paper we study some logics related to the logic of place introduced by von Wright and studied by Segerberg. For every we study the logic of the class of frames whose accessibility relation R satisfies the following condition: if then there is such that . For a fixed the logic is the one axiomatized by K , which we call Kn.4B, where . We prove that these logics are canonical and hence complete, and that they have the finite (...) model property, being thus decidable. We also characterize their classes of frames. In the way of studying them we also study the logics , called Kn.4, and , called Kn.B. A translation between these logics and S5 is also presented, and the relation among them all is established. (shrink)

Though scholarship has explored Karin Costelloe-Stephen’s contributions to the history of psychoanalysis, as well as her relations to the Bloomsbury Group, her philosophical work has been almost completely ignored. This paper will examine her debate with Bertrand Russell over his criticism of Bergson. Costelloe-Stephen had employed the terminology of early analytic philosophy in presenting a number of arguments in defence of Bergson’s views. Costelloe-Stephen would object, among other things, to Russell’s use of an experiment which, as she points out, (...) was first conducted by Carl Stumpf. Russell appeals to Stumpf's experiment in his attempt to prove that sense data are terms in logical relations, a thesis presupposed by the project of logical analysis outlined in Our Knowledge of the External World. A reformulated version of Costelloe-Stephen's argument put forth by this paper shows that Russell's argument fails to provide adequate proof for his thesis. Further modifications of the argument can also address a reconstruction (based on contemporary reports) of Russell's reply to Costelloe-Stephen. In his reply, Russell would use, already in 1914, the term ‘analytic philosophy’ in contrasting his and Moore’s approach to a continental one, exemplified by Bergson and Costelloe-Stephen. (shrink)

After some generalities about connections between functions and relations in Sections 1 and 2 recalls the possibility of taking the semantic values of ‐ary Boolean connectives as ‐ary relations among truth‐values rather than as ‐ary truth functions. Section 3, the bulk of the paper, looks at correlates of these truth‐value relations as applied to formulas, and explores in a preliminary way how their properties are related to the properties of “logical relations” among formulas such as (...) equivalence, implication (entailment) and contrariety (logical incompatibility), concentrating for illustrative purposes on binary logical relations such as those just listed. To avoid an excess of footnotes, some points have been deferred to an Appendix as “Longer Notes”. (shrink)

An implication relation between pictures is defined, it is then shown how conjunctions, disjunctions, negations, and hypotheticals of pictures can be formed on the basis of this. It is argued that these logical operations on pictures correspond to natural cognitive operations employed when thinking about pictures.

Nonclassical logics have played an increasing role in recent years in disciplines ranging from mathematics and computer science to linguistics and philosophy. _Generalized Galois Logics_ develops a uniform framework of relational semantics to mediate between logical calculi and their semantics through algebra. This volume addresses normal modal logics such as K and S5, and substructural logics, including relevance logics, linear logic, and Lambek calculi. The authors also treat less-familiar and new logical systems with equal deftness.

This note gives a new proof of the 'operational extensionality' property of Abramsky's lazy lambda calculus-namely the coincidence of contextual equivalence with a co-inductively defined notion of 'applicative bisimilarity'. This purely syntactic results is here proved using a logical relation between the syntax and its denotational semantics. The proof exploits a mixed inductive/coinductive characterisation of the logical relation recently discovered by the author.

According to traditional logical expressivism, logical operators allow speakers to explicitly endorse claims that are already implicitly endorsed in their discursive practice — endorsed in virtue of that practice’s having instituted certain logical relations. Here, I propose a different version of logical expressivism, according to which the expressive role of logical operators is explained without invoking logical relations at all, but instead in terms of the expression of discursive-practical attitudes. In defense of (...) this alternative, I present a deflationary account of the expressive role of vocabulary by which we ascribe logical relations. (shrink)

The central aim of this paper is to present a Boolean algebraic approach to the classical Aristotelian Relations of Opposition, namely Contradiction and (Sub)contrariety, and to provide a 3D visualisation of those relations based on the geometrical properties of Platonic and Archimedean solids. In the first part we start from the standard Generalized Quantifier analysis of expressions for comparative quantification to build the Comparative Quantifier Algebra CQA. The underlying scalar structure allows us to define the Aristotelian relations (...) in Boolean terms and to propose a 3D visualisation by transforming a cube into an octahedron. In part two, the architecture of the CQA is shown to carry over, both to the classical quantifiers of Predicate Calculus and to the modal operators—which are given a Generalized Quantifier style re-interpretation. In this way we provide an algebraic foundation for Blanché’s Aristotelian hexagon as well as a 3D alternative to his 2D star-like visualisation. In a final part, a richer scalar structure is argued to underly the realm of Modality, thus generalizing the 3D algebra with eight (2 3 ) operators to a 4D algebra with sixteen (2 4 ) operators. The visual representation of the latter structure involves a transformation of the hypercube to a rhombic dodecahedron. The resulting 3D visualisation allows a straightforward embedding, not only of the classical Blanché star of Aristotelian relations or the paracomplete and paraconsistent stars of Béziau (Log Investig 10, 218–232, 2003) but also of three additional isomorphic Aristotelian constellations. (shrink)

Do children understand how different numbers are related before they associate them with specific cardinalities? We explored how children rely on two abstract relations – contrast and entailment – to reason about the meanings of ‘unknown’ number words. Previous studies argue that, because children give variable amounts when asked to give an unknown number, all unknown numbers begin with an existential meaning akin to some. In Experiment 1, we tested an alternative hypothesis, that because numbers belong to a scale (...) of contrasting alternatives, children assign them a meaning distinct from some. In the “Don’t Give-a-Number task”, children were shown three kinds of fruit (apples, bananas, strawberries), and asked to not give either some or a number of one kind (e.g. Give everything, but not [some/five] bananas). While children tended to give zero bananas when asked to not give some, they gave positive amounts when asked to not give numbers. This suggests that contrast – plus knowledge of a number’s membership in a count list – enables children to differentiate the meanings of unknown number words from the meaning of some. Experiment 2 tested whether children’s interpretation of unknown numbers is further constrained by understanding numerical entailment relations – that if someone, e.g. has three, they thereby also have two, but if they do not have three, they also do not have four. On critical trials, children saw two characters with different quantities of fish, two apart (e.g. 2 vs. 4), and were asked about the number inbetween – who either has or doesn’t have, e.g. three. Children picked the larger quantity for the affirmative, and the smaller for the negative prompts even when all the numbers were unknown, suggesting that they understood that, whatever three means, a larger quantity is more likely to contain that many, and a smaller quantity is more likely not to. We conclude by discussing how contrast and entailment could help children scaffold the exact meanings of unknown number words. (shrink)

Implicational tonoid logics and their relational semantics have been introduced by Yang and Dunn. This paper extends this investigation to implicational partial Galois logics. For this, we first define some implicational partial gaggle logics as special kinds of implicational tonoid logics called “implicational partial Galois logics.” Next, we provide Routley–Meyer-style relational semantics for finitary those logics.

This book uncovers a logical structure that is common to many, if not all, of the kinds posited by scientific taxonomies. Specification relations, such as those holding between determinates and determinables (determination), are central to this logical investigation of kinds. The species–genus relation is a familiar specification relation for substantival kinds, but this book focuses on adjectival kinds—whose instances are properties—instead. Determination relations are then used to structure kinds at the same level of abstraction into property (...) spaces, which in turn leads to a theory for individuating properties (tropes). These determination relations are contrasted with realization relations, the latter being the favored way of understanding the connection between the mental and the physical. Particular attention is given to the distinction between multiple realizability and multiple determination, and it is argued that determination and realization are mutually exclusive. The claim that multiple realizability entails various senses of autonomy is defended from various reductionist challenges. These theories of determination and realization then provide general standards for establishing the autonomy of the special sciences or, conversely, their reduction. (shrink)

Systems TRC and TRCU of illative combinatory logic are introduced and shown to be equivalent in consistency strength and expressive power to Quine's set theory ‘New Foundations’ and the fragment NFU + Infinity of NF described by Jensen, respectively. Jensen demonstrated the consistency of NFU + Infinity relative to ZFC; the question of the consistency of NF remains open. TRC and TRCU are presented here as classical first-order theories, although they can be presented as equational theories; they are not constructive.

Presupposing that most predicates do not correspond directly to genuine relations, I argue that all genuine relations are symmetric. My main argument depends on the premise that there are no brute necessities, interpreted so as to require logical and metaphysical necessity to coincide for sentences composed entirely of logical vocabulary and primitive predicates. Given this premise, any set of purportedly primitive predicates by which one might hope to express the facts about non-symmetric relations order their (...) relata will generate an objectionable multiplication of possibilities. In the final section I give a different argument, based on the weaker premise that brute necessities should not be multiplied without necessity. (shrink)

Van Fraassen, like Popper before him, assumes that confirmation and disconfirmation relations are logical relations and thus hold only among abstract items. This raises a problem about how experience, for Popper, and observables, for van Fraassen, enter into epistemic evaluations. Each philosopher offers a drastic proposal: Popper holds that basic statements are accepted by convention; van Fraassen introduces his “pragmatic tautology.” Another alternative is to reject the claim that all evaluative relations are logical relations. (...) Ayer proposed this option in responding to Popper, as did Sosa in a different context. I argue that this option should be pursued and propose a line of research that the option suggests.Keywords: Popper; van Fraassen; Representation; Confirmation; Logic; Cognitive abilities. (shrink)

. According to John Buridan, the time for which a statement is true is underdetermined by the grammatical form of the sentence – the intention of the speaker is required. As a consequence, truth-bearers are not sentence types, nor sentence tokens plus facts of the context of utterance, but statements. Statements are also the bearers of logical relations, since the latter can only be established among entities having determined truth-conditions. This role of the intention of the speaker in (...) the determination of what is said by an utterance is not isolated in medieval semantics. (shrink)

This paper extends the results of an earlier paper by the author . New subsystems of the combinatory logic TRC shown in that paper to be equivalent to NF are introduced; these systems are analogous to subsystems of NF with predicativity restrictions on set comprehension introduced and shown to be consistent by Crabbé. For one of these systems, an exact equivalence in consistency strength and expressive power with the analogous subsystem of NF is established.

One of the great successes in the study of language has been the application of formal methods, including those of formal logic. Even so, this chapter argues against one way of accounting for this success, by arguing that the study of natural language semantics and of logical consequence relations are not the same. There is indeed a lot we can glean about logic from looking at our languages, and at our inferential practices, but the semantic properties of natural (...) languages do not determine genuine logical consequence relations. We can get from natural language semantics to logical consequence, but only by a significant process of identification of logical constants, abstraction, and idealization. The chapter also discusses different approaches to the nature of logical consequence, and examines which allow logic and natural language to come closer together. (shrink)

Dung’s (1995) argumentation framework takes as input two abstract entities: a set of arguments and a binary relation encoding attacks between these arguments. It returns acceptable sets of arguments, called extensions, w.r.t. a given semantics. While the abstract nature of this setting is seen as a great advantage, it induces a big gap with the application that it is used to. This raises some questions about the compatibility of the setting with a logical formalism (i.e., whether it is possible (...) to instantiate it properly from a logical knowledge base), and about the significance of the various semantics in the application context. In this paper we tackle the above questions. We first propose to fill in the previous gap by extending Dung’s (1995) framework. The idea is to consider all the ingredients involved in an argumentation process. We start with the notion of an abstract monotonic logic which consists of a language (defining the formulas) and a consequence operator. We show how to build, in a systematic way, arguments from a knowledge base formalised in such a logic. We then recall some basic postulates that any instantiation should satisfy. We study how to choose an attack relation so that the instantiation satisfies the postulates. We show that symmetric attack relations are generally not suitable. However, we identify at least one ‘appropriate’ attack relation. Next, we investigate under stable, semi-stable, preferred, grounded and ideal semantics the outputs of logic-based instantiations that satisfy the postulates. For each semantics, we delimit the number of extensions an argumentation system may have, characterise the extensions in terms of subsets of the knowledge base, and finally characterise the set of conclusions that are drawn from the knowledge base. The study reveals that stable, semi-stable and preferred semantics either lead to counter-intuitive results or provide no added value w.r.t. naive semantics. Besides, naive semantics either leads to arbitrary results or generalises the coherence-based approach initially developed by Rescher and Manor (1970). Ideal and grounded semantics either coincide and generalise the free consequence relation developed by Benferhat, Dubois, and Prade (1997), or return arbitrary results. Consequently, Dung’s (1995) framework seems problematic when applied over deductive logical formalisms. (shrink)

Discussing the relations between logic and probability, this book compares classical 17th- and 18th-century theories of probability with contemporary theories, explores recent logical theories of probability, and offers a new account of probability as a part of logic.

Logics of binary relations corresponding, among others, to the class RRA of representable relation algebras and the class FRA of full relation algebras are presented together with the proof systems in the style of dual tableaux. Next, the logics are extended with relational constants interpreted as point relations. Applications of these logics to reasoning in non-classical logics are recalled. An example is given of a dual tableau proof of an equation which is RRA-valid, while not RA-valid.

In this paper, with reference to relationships of the traditional square of opposition, we establish all the relations of the square of opposition between complex sentences built from the 16 binary and four unary propositional connectives of the classical propositional calculus. We illustrate them by means of many squares of opposition and, corresponding to them—octagons, hexagons or other geometrical objects.

I identify a notion of logical grounding, clarify it, and show how it can be used (i) to characterise various consequence relations, and (ii) to give a precise syntactic account of the notion of “groundedness” at work in the literature on the paradoxes of truth.

Description: Ancient Indian logic by itself is a very vast subject. The ancient Sanskrit term nyaya which was first used in a different or in a much more general sense, was later specifically applied to the Nyaya school. The physics and physiology and psychology of the Nyaya doctrine are not specifically its own, being from the first indistinguishable from those of its sister Sastra, the Vaisesika. What characterizes it specifically is the development of the nyaya or five-membered method of demonstration (...) and its insistence on the four sources of knowledge, corresponding to the first four members of its demonstrative formula, or 'Syllogism.' The importance of Nyaya is in its doctrine of the pramanas, or sources of proof, and in its formulation of the nyaya, or method of demonstration. Indian Logic in its Early Schools by H.N. Randle is an interpretation of Indian logical theory in its historical development based on the study of original texts wherever reference to Nyaya as a method of logic has been made, and thus, covers a very wide field of Indian philosophy. An indispensable work for students of Indian philosophy, it is especially important for those who are interested in Nyayadarsana in its relation to the early logic of other schools. (shrink)

Sentences that ascribe action are logically related, but it is not always obvious why. According to event semantics, implications and non-implications result from referential relations between unpronounced constituents. Taking as starting point examples including free relative clauses, this paper advances the alternative view that examples as such present logical relations as forms of predicative dependence indicated with pronounced constituents. To this end, I argue that Verbal Phrases and verbal traces follow the pattern of Verbal Phrase Anaphora and, (...) more controversially, that they can be semantically interpreted in terms of higher-order quantification that represent actions as properties, but neither as events nor event-kinds. (shrink)

There is a new theory of information based on logic. The definition of Shannon entropy as well as the notions on joint, conditional, and mutual entropy as defined by Shannon can all be derived by a uniform transformation from the corresponding formulas of logical information theory. Information is first defined in terms of sets of distinctions without using any probability measure. When a probability measure is introduced, the logical entropies are simply the values of the probability measure on (...) the sets of distinctions. The compound notions of joint, conditional, and mutual entropies are obtained as the values of the measure, respectively, on the union, difference, and intersection of the sets of distinctions. These compound notions of logical entropy satisfy the usual Venn diagram relationships since they are values of a measure. The uniform transformation into the formulas for Shannon entropy is linear so it explains the long-noted fact that the Shannon formulas satisfy the Venn diagram relations--as an analogy or mnemonic--since Shannon entropy is not a measure on a given set. What is the logic that gives rise to logical information theory? Partitions are dual to subsets, and the logic of partitions was recently developed in a dual/parallel relationship to the Boolean logic of subsets. Boole developed logical probability theory as the normalized counting measure on subsets. Similarly the normalized counting measure on partitions is logical entropy--when the partitions are represented as the set of distinctions that is the complement to the equivalence relation for the partition. In this manner, logical information theory provides the set-theoretic and measure-theoretic foundations for information theory. The Shannon theory is then derived by the transformation that replaces the counting of distinctions with the counting of the number of binary partitions it takes, on average, to make the same distinctions by uniquely encoding the distinct elements--which is why the Shannon theory perfectly dovetails into coding and communications theory. (shrink)

Modalities explained through the idea of a logical space.

In explaining the notion of a fundamental property or relation, metaphysicians will often draw an analogy with languages. The fundamental properties and relations stand to reality as the primitive predicates and relations stand to a language: the smallest set of vocabulary God would need in order to write the “book of the world.” This paper attempts to make good on this metaphor. To that end, a modality is introduced that, put informally, stands to propositions as logical truth (...) stands to sentences. The resulting theory, formulated in higher-order logic, also vindicates the Humean idea that fundamental properties and relations are freely recombinable and a variant of the structural idea that propositions can be decomposed into their fundamental constituents via logical operations. Indeed, it is seen that, although these ideas are seemingly distinct, they are not independent, and fall out of a natural and general theory about the granularity of reality. (shrink)

Some, but not all, closed terms of the lambda calculus have types; these types are exactly the theorems of intuitionistic implicational logic. An extension of these simple (→) types to intersection (or →∧) types allows all closed lambda terms to have types. The corresponding →∧ logic, related to the Meyer–Routley minimal logic B+ (without ∨), is weaker than the →∧ fragment of intuitionistic logic. In this paper we provide an introduction to the above work and also determine the →∧ logics (...) that correspond to certain interesting subsystems of the full →∧ type theory. (shrink)

A good metaphysical account of logical form, must make clear why logical form is logical. However, this task has proved to be very elusive. Here, I analyze different attempts to meet this challenge and defend an inferential externalism where logical form is grounded on external logical relations as our most promising option.

Intra-theoretical logical pluralism is a form of meaning-invariant pluralism about logic, articulated recently by Hjortland :355–373, 2013). This version of pluralism relies on it being possible to define several distinct notions of provability relative to the same logical calculus. The present paper picks up and explores this theme: How can a single logical calculus express several different consequence relations? The main hypothesis articulated here is that the divide between the internal and external consequence relations in (...) Gentzen systems generates a form of intra-theoretical logical pluralism. (shrink)

It is a commonplace of the history of analytic philosophy that Carnap swiftly adopted Tarskian semantics in the mid-1930s. There is no doubt that, in a very general sense, this is true. But to what extent are the innovative technical details characteristic of Tarski's method, specifically the handling of quantification by way of a satisfaction relation between formulas and variable assignments, reflected in Carnap's writings on semantics? Curiously enough, their essentials are in place just before Carnap took the purported Tarskian (...) turn, namely in the definition of analyticity he formulated some time between September 1932 and April 1933, but are missing from his publications on semantics after 1935 until the final chapter of Meaning and Necessity of 1947, at which point we find Carnap reverting to the use of specifically Tarskian techniques in the context of his novel semantics for quantified modal languages. (shrink)

We present a dual tableau system, RLK, which is itself a deterministic decision procedure verifying validity of K-formulas. The system is constructed in the framework of the original methodology of relational proof systems, determined only by axioms and inference rules, without any external techniques. Furthermore, we describe an implementation of the system RLK in Prolog, and we show some of its advantages.