Logical Expressions

This sentence G ↔ ¬(F ⊢ G) and its negation G ↔ ~(F ⊢ ¬G) are shown to meet the conventional definition of incompleteness: Incomplete(T) ↔ ∃φ ((T ⊬ φ) ∧ (T ⊬ ¬φ)). They meet conventional definition of incompleteness because neither the sentence nor its negation is provable in F (or any other formal system).

The idea of rejection originated by Aristotle. The notion of rejection was introduced into formal logic by Łukasiewicz. He applied it to complete syntactic characterization of deductive systems using an axiomatic method of rejection of propositions. The paper gives not only genesis, but also development and generalization of the notion of rejection. It also emphasizes the methodological approach to biaspectual axiomatic method of characterization of deductive systems as acceptance (asserted) systems and rejection (refutation) systems, introduced by Łukasiewicz and developed by (...) his student Słupecki, the pioneers of the method, which becomes relevant in modern approaches to logic. (shrink)

Sentences containing definite descriptions, expressions of the form ‘The F’, can be formalised using a binary quantifier ι that forms a formula out of two predicates, where ιx[F, G] is read as ‘The F is G’. This is an innovation over the usual formalisation of definite descriptions with a term forming operator. The present paper compares the two approaches. After a brief overview of the system INFι of intuitionist negative free logic extended by such a quantifier, which was presented in (...) (Kürbis 2019), INFι is first compared to a system of Tennant’s and an axiomatic treatment of a term forming ι operator within intuitionist negative free logic. Both systems are shown to be equivalent to the subsystem of INFι in which the G of ιx[F, G] is restricted to identity. INFι is then compared to an intuitionist version of a system of Lambert’s which in addition to the term forming operator has an operator for predicate abstraction for indicating scope distinctions. The two systems will be shown to be equivalent through a translation between their respective languages. Advantages of the present approach over the alternatives are indicated in the discussion. (shrink)

(Abstract - Inglês) Identity is traditionally taken to be a fundamental notion of our conceptual framework as well as a fundamental metaphysical component of entities. But as far as we make this claim we face ourselves with two problems: what is identity? And why would it be fundamental? These questions will guide us towards a discussion put forward by Bueno (2014), Krause and Arenhart (2015). Bueno holds that there are four aspects that make identity being fundamental: (1) identity is assumed (...) in every conceptual system; (2) it is required for a minimal characterisation of being an individual; (3) it cannot be defined; and (4) identity is required for quantification. On the other hand, Krause and Arenhart refuse the thesis that identity is fundamental replying to Bueno's arguments. In this dissertation we will deal with this debate. In the introduction we will deal with the first problem – what is identity? –, showing how this concept is traditionally understood, either for its metaphysical characteristics as for its formal account. After that we will deal with each of the four aspects defended by Bueno and challenged by Krause and Arenhart. After a critical presentation of each position we will also provide other arguments for the current debate. Finally we will outline an alternative view to those defended throughout this work. -/- (Resumo - Português) Tradicionalmente a identidade é adotada como uma noção fundamental de nosso arcabouço conceitual e como um componente metafísico fundamental das entidades. Mas logo ao fazermos essa afirmação nos deparamos com dois problemas: O que é a identidade? E por que ela seria fundamental? Estas perguntas irão nos guiar à discussão conduzida por Otávio Bueno (2014), Décio Krause e Jonas Arenhart (2015). Bueno defende que há quatro aspectos que fazem a identidade ser fundamental: (1) A identidade é pressuposta em todo sistema conceitual; (2) é requerida para uma caracterização mínima de indivíduo; (3) não pode ser definida; e (4) a identidade é requerida para a quantificação. Por outro lado, Krause e Arenhart recusam a tese de que a identidade seja fundamental, respondendo aos argumentos de Bueno. Neste trabalho iremos tratar desse debate. Na introdução iremos tratar do primeiro problema – O que é a identidade? –, mostrando como este conceito é tradicionalmente compreendido, tanto suas características metafísicas como também seu tratamento formal. Posteriormente iremos tratar de cada um dos quatro aspectos defendidos por Bueno e atacados por Krause e Arenhart. Além da exposição crítica de cada posição iremos também oferecer outros argumentos para o debate atual. Ao final iremos esboçar uma posição alternativa às defendidas ao longo do texto. (shrink)

It has been recently argued that the well-known square of opposition is a gathering that can be reduced to a one-dimensional figure, an ordered line segment of positive and negative integers [3]. However, one-dimensionality leads to some difficulties once the structure of opposed terms extends to more complex sets. An alternative algebraic semantics is proposed to solve the problem of dimensionality in a systematic way, namely: partition (or bitstring) semantics. Finally, an alternative geometry yields a new and unique pattern of (...) oppositions that proceeds with colored diagrams and an increasing set of bitstrings. (shrink)

This paper investigates a generalization of Boolean algebras which I call agglomerative algebras. It also outlines two conceptions of propositions according to which they form an agglomerative algebra but not a Boolean algebra with respect to conjunction and negation.

Paraconsistent logics are logical systems that reject the classical principle, usually dubbed Explosion, that a contradiction implies everything. However, the received view about paraconsistency focuses only the inferential version of Explosion, which is concerned with formulae, thereby overlooking other possible accounts. In this paper, we propose to focus, additionally, on a meta-inferential version of Explosion, i.e. which is concerned with inferences or sequents. In doing so, we will offer a new characterization of paraconsistency by means of which a logic is (...) paraconsistent if it invalidates either the inferential or the meta-inferential notion of Explosion. We show the non-triviality of this criterion by discussing a number of logics. On the one hand, logics which validate and invalidate both versions of Explosion, such as classical logic and Asenjo–Priest’s 3-valued logic LP. On the other hand, logics which validate one version of Explosion but not the other, such as the substructural logics TS and ST, introduced by Malinowski and Cobreros, Egré, Ripley and van Rooij, which are obtained via Malinowski’s and Frankowski’s q- and p-matrices, respectively. (shrink)

We argue that distinct conditionals—conditionals that are governed by different logics—are needed to formalize the rules of Truth Introduction and Truth Elimination. We show that revision theory, when enriched with the new conditionals, yields an attractive theory of truth. We go on to compare this theory with one recently proposed by Hartry Field.

This paper deals with the question of what it is for a quantifier expression to be vague. First it draws a distinction between two senses in which quantifier expressions may be said to be vague, and provides an account of the distinction which rests on independently grounded assumptions. Then it suggests that, if some further assumptions are granted, the difference between the two senses considered can be represented at the formal level. Finally, it outlines some implications of the account provided (...) which bear on three debated issues concerning quantification. (shrink)

In Mathematics is megethology. Philosophia Mathematica, 1, 3–23) David K. Lewis proposes a structuralist reconstruction of classical set theory based on mereology. In order to formulate suitable hypotheses about the size of the universe of individuals without the help of set-theoretical notions, he uses the device of Boolos’ plural quantification for treating second order logic without commitment to set-theoretical entities. In this paper we show how, assuming the existence of a pairing function on atoms, as the unique assumption non expressed (...) in a mereological language, a mereological foundation of set theory is achievable within first order logic. Furthermore, we show how a mereological codification of ordered pairs is achievable with a very restricted use of the notion of plurality without plural quantification. (shrink)

DEFINING OUR TERMS A “paradox" is an argumentation that appears to deduce a conclusion believed to be false from premises believed to be true. An “inconsistency proof for a theory" is an argumentation that actually deduces a negation of a theorem of the theory from premises that are all theorems of the theory. An “indirect proof of the negation of a hypothesis" is an argumentation that actually deduces a conclusion known to be false from the hypothesis alone or, more commonly, (...) from the hypothesis augmented by a set of premises known to be true. A “direct proof of a hypothesis" is an argumentation that actually deduces the hypothesis itself from premises known to be true. Since `appears', `believes' and `knows' all make elliptical reference to a participant, it is clear that `paradox', `indirect proof' and `direct proof' are all participant-relative. PARTICIPANT RELATIVITY In normal mathematical writing the participant is presumed to be “the community of mathematicians" or some more or less well-defined subcommunity and, therefore, omission of explicit reference to the participant is often warranted. However, in historical, critical, or philosophical writing focused on emerging branches of mathematics such omission often invites confusion. One and the same argumentation has been a paradox for one mathematician, an inconsistency proof for another, and an indirect proof to a third. One and the same argumentation-text can appear to one mathematician to express an indirect proof while appearing to another mathematician to express a direct proof. WHAT IS A PARADOX’S SOLUTION? Of the above four sorts of argumentation only the paradox invites “solution" or “resolution", and ordinarily this is to be accomplished either by discovering a logical fallacy in the “reasoning" of the argumentation or by discovering that the conclusion is not really false or by discovering that one of the premises is not really true. Resolution of a paradox by a participant amounts to reclassifying a formerly paradoxical argumentation either as a “fallacy", as a direct proof of its conclusion, as an indirect proof of the negation of one of its premises, as an inconsistency proof, or as something else depending on the participant's state of knowledge or belief. This illustrates why an argumentation which is a paradox to a given mathematician at a given time may well not be a paradox to the same mathematician at a later time. -/- The present article considers several set-theoretic argumentations that appeared in the period 1903-1908. The year 1903 saw the publication of B. Russell's Principles of mathematics, [Cambridge Univ. Press, Cambridge, 1903; Jbuch 34, 62]. The year 1908 saw the publication of Russell's article on type theory as well as Ernst Zermelo's two watershed articles on the axiom of choice and the foundations of set theory. The argumentations discussed concern “the largest cardinal", “the largest ordinal", the well-ordering principle, “the well-ordering of the continuum", denumerability of ordinals and denumerability of reals. The article shows that these argumentations were variously classified by various mathematicians and that the surrounding atmosphere was one of confusion and misunderstanding, partly as a result of failure to make or to heed distinctions similar to those made above. The article implies that historians have made the situation worse by not observing or not analysing the nature of the confusion. -/- RECOMMENDATION This well-written and well-documented article exemplifies the fact that clarification of history can be achieved through articulation of distinctions that had not been articulated (or were not being heeded) at the time. The article presupposes extensive knowledge of the history of mathematics, of mathematics itself (especially set theory) and of philosophy. It is therefore not to be recommended for casual reading. AFTERWORD: This review was written at the same time Corcoran was writing his signature “Argumentations and logic”[249] that covers much of the same ground in much more detail. https://www.academia.edu/14089432/Argumentations_and_Logic . (shrink)

Contrary to dictionaries, a non sequitur isn’t “any statement that doesn’t follow logically from previous statements”. Otherwise, every opening statement would be a non sequitur: a non sequitur is a statement claimed to follow from previous statements but that doesn’t follow. If the sentence making a given statement doesn’t contain ‘thus’, ‘so’, ‘hence’, ‘therefore’, or something else indicating an implication claim, the statement isn’t a non sequitur in this sense. But this is only one of several senses of that expression, (...) which, contrary to appearances, is a unitary common noun more properly written as one word: non-sequitur or nonsequitur. Above a nonsequitur was, roughly speaking, a conclusion of an invalid premise- conclusion argument, but not every such, only those that were stated to follow from premises that had been stated. Every informative proposition is the conclusion of an invalid argument. Anyway, nonsequiturs were not arguments. However, the expression ‘nonsequitur’ also means “invalid premise- conclusion argument”. It also means something like “fallacious reasoning” as in ‘Abe’s proof of the big-bang hypothesis is a nonsequitur’. The English noun is also used for an irrelevancy, an abrupt change of topic, or for any of many other expressions that are gratuitous, inappropriate, incongruous, or in some other way out of place. The English noun is derived from the Latin expression ‘non sequitur’, which is not a common noun but a sentence variously meaning “it isn’t in sequence ”, “it doesn’t follow”, “it is out of order”, etc. A statement that begins ‘in the second place’ is a nonsequitur if the previous sentence lacked implication of something like ‘in the first place’ or if it contained something similar to ‘in the third place’. In fact, a true implication claim can be a nonsequitur if there is no reason for making it. If Ben says ‘Hence, Abe swims and Abe swims’ in reply to Carl’s statement ‘Abe swims‘, then Ben may well be committing a nonsequitur. Many conversation stoppers are nonsequiturs. This lecture surveys and analyses a wide selection of uses of ‘nonsequitur’ in logic and logic-related literature. -/- END OF DRAFT 4 -/- NOTE 091215: When Rick Perry was discussing possible withdrawal from the race—unfortunately not the human race but the Republican race—a reporter reminded him that just last week Donald Trump predicted the Perry withdrawal. Perry interrupted with “A broken clock is right once a day”. -/- If you did not know Perry you might think his reply was a brilliant diversionary nonsequitur. If you know Perry you might think his reply was a stupid nonsequitur. -/- For the record, he did say ‘once a day’, not ‘twice a day’. BTW, my interjection ‘unfortunately not the human race but the Republican race’ was also a nonsequitur. (shrink)

Corcoran, J. 2007. Syntactics, American Philosophy: an Encyclopedia. 2007. Eds. John Lachs and Robert Talisse. New York: Routledge. pp.745-6. -/- Syntactics, semantics, and pragmatics are the three levels of investigation into semiotics, or the comprehensive study of systems of communication, as described in 1938 by the American philosopher Charles Morris (1903-1979). Syntactics studies signs themselves and their interrelations in abstraction from their meanings and from their uses and users. Semantics studies signs in relation to their meanings, but still in abstraction (...) from their uses and users. Pragmatics studies signs as meaningful entities used in various ways by humans. Taking current written English as the system of communication under investigation, it is a matter of syntactics that the two four-character strings ‘tact’ and ‘tics’ both occur in the ten-character string ‘syntactics’. It is a matter of semantics that the ten-character string ‘syntactics’ has only one sense and, in that sense, it denotes a branch of semiotics. It is a matter of pragmatics that the ten-character string ‘syntactics’ was not used as an English word before 1937 and that it is sometimes confused with the much older six-character string ‘syntax’. Syntactics is the simplest and most abstract branch of semiotics. At the same time, it is the most basic. Pragmatics presupposes semantics and syntactics; semantics presupposes syntactics. The basic terms of syntactics include the following: ‘character’ as alphabetic letters, numeric digits, and punctuation marks; ‘string’ as sign composed of a concatenation of characters; ‘occur’ as ‘t’ and ‘c’ both occur twice in ‘syntactics’. However, perhaps the most basic terms of syntactics are ‘type’ and ‘token’ in the senses introduced by Charles Sanders Peirce (1839-1914), America’s greatest logician, who could be considered the grandfather of syntactics, if not the father. These are explained below. (shrink)

This paper will annoy modern logicians who follow Bertrand Russell in taking pleasure in denigrating Aristotle for [allegedly] being ignorant of relational propositions. To be sure this paper does not clear Aristotle of the charge. On the contrary, it shows that such ignorance, which seems unforgivable in the current century, still dominated the thinking of one of the greatest modern logicians as late as 1831. Today it is difficult to accept the proposition that Aristotle was blind to the fact that, (...) for example, incommensurability is a relation and not a property: that the proposition “In every square, the diagonals are incommensurable with the sides” is relational and not categorical. This paper asks the reader to do something more difficult: to accept the proposition that as late as 1831 De Morgan was blind to the same fact. This paper shows conclusively that in 1831, De Morgan was still in the grips of the allegedly Aristotelian paradigm. (shrink)

Epistemic modals are a prominent topic in the literature on natural language semantics, with wide-ranging implications for issues in philosophy of language and philosophical logic. Considerations about the role that epistemic "might" and "must" play in discourse and reasoning have led to the development of several important alternatives to classical possible worlds semantics for natural language modal expressions. This is an opinionated overview of what I take to be some of the most exciting issues and developments in the field.

English translation of an entry on pages 137–42 of the Spanish-language dictionary of logic: Luis Vega, Ed. Compendio de Lógica, Argumentación, y Retórica. Madrid: Trotta. -/- DEDICATION: To my friend and collaborator Kevin Tracy. -/- This short essay—containing careful definitions of ‘counterargument’ and ‘counterexample’—is not an easy read but it is one you’ll be glad you struggled through. It contains some carefully chosen examples suitable for classroom discussion. -/- Using the word ‘counterexample’ instead of ‘counterargument’ in connection with Aristotle’s invalidity (...) proofs leads to a misinterpretation of Aristotle’s intentions. The two relations expressed by these two words are drastically different—as explained in this essay. There is however a subtle overlap: Every argument that is a counterargument for a given argument is a counterexample to the universal proposition that every argument in the same form as the given argument is valid. The word ‘counterexample’ was coined in the 1800s. The word ‘counterargument’ was given this sense in the 1960s. Saying that one argument is a counterexample for another argument is bad English—taking the word ‘counterexample’ in its Standard English sense. The word ‘counterinstance’ is an exact synonym for ‘counterexample’. Which logic books define ‘counterinstance’ or ‘counterexample’? Who started using ‘counterinstance’ or ‘counterexample’ in the sense of ‘counterargument’? Did they note that they were not using the word in the Standard sense? Why did it catch on? -/- Also see: https://www.academia.edu/8840909/Argumentations_and_logic_1989_ . (shrink)

The question I am addressing in this paper is the following: how is it possible to empirically test, or confirm, counterfactuals? After motivating this question in Section 1, I will look at two approaches to counterfactuals, and at how counterfactuals can be empirically tested, or confirmed, if at all, on these accounts in Section 2. I will then digress into the philosophy of probability in Section 3. The reason for this digression is that I want to use the way observable (...) absolute and relative frequencies, two empirical notions, are used to empirically test, or confirm, hypotheses about objective chances, a metaphysical notion, as a role-model. Specifically, I want to use this probabilistic account of the testing of chance hypotheses as a role-model for the account of the testing of counterfactuals, another metaphysical notion, that I will present in Sections 4 to 8. I will conclude by comparing my proposal to one non-probabilistic and one probabilistic alternative in Section 9. (shrink)

Corcoran’s 27 entries in the 1999 second edition of Robert Audi’s Cambridge Dictionary of Philosophy [Cambridge: Cambridge UP]. -/- ancestral, axiomatic method, borderline case, categoricity, Church (Alonzo), conditional, convention T, converse (outer and inner), corresponding conditional, degenerate case, domain, De Morgan, ellipsis, laws of thought, limiting case, logical form, logical subject, material adequacy, mathematical analysis, omega, proof by recursion, recursive function theory, scheme, scope, Tarski (Alfred), tautology, universe of discourse. -/- The entire work is available online free at more than (...) one website. Paste the whole URL. http://archive.org/stream/RobertiAudi_The.Cambridge.Dictionary.of.Philosophy/Robert.Audi_The.Cambrid ge.Dictionary.of.Philosophy -/- The 2015 third edition will be available soon. Before you think of buying it read some reviews on Amazon and read reviews of its competition: For example, my review of the 2008 Oxford Companion to Philosophy, History and Philosophy of Logic,29:3,291-292. URL: http://dx.doi.org/10.1080/01445340701300429 -/- Some of the entries have already been found to be flawed. For example, Tarski’s expression ‘materially adequate’ was misinterpreted in at least one article and it was misused in another where ‘materially correct’ should have been used. The discussion provides an opportunity to bring more flaws to light. -/- Acknowledgements: Each of these entries was presented at meetings of The Buffalo Logic Dictionary Project sponsored by The Buffalo Logic Colloquium. The members of the colloquium read drafts before the meetings and were generous with corrections, objections, and suggestions. Usually one 90-minute meeting was devoted to one entry although in some cases, for example, “axiomatic method”, took more than one meeting. Moreover, about half of the entries are rewrites of similarly named entries in the 1995 first edition. Besides the help received from people in Buffalo, help from elsewhere was received by email. We gratefully acknowledge the following: José Miguel Sagüillo, John Zeis, Stewart Shapiro, Davis Plache, Joseph Ernst, Richard Hull, Concha Martinez, Laura Arcila, James Gasser, Barry Smith, Randall Dipert, Stanley Ziewacz, Gerald Rising, Leonard Jacuzzo, George Boger, William Demopolous, David Hitchcock, John Dawson, Daniel Halpern, William Lawvere, John Kearns, Ky Herreid, Nicolas Goodman, William Parry, Charles Lambros, Harvey Friedman, George Weaver, Hughes Leblanc, James Munz, Herbert Bohnert, Robert Tragesser, David Levin, Sriram Nambiar, and others. -/- . (shrink)

The paper contains an overview of the most important results presented in the monograph of the author "Teorie Językow Syntaktycznie-Kategorialnych" ("Theories of Syntactically-Categorial Languages" (in Polish), PWN, Warszawa-Wrocław 1985. In the monograph four axiomatic systems of syntactically-categorial languages are presented. The first two refer to languages of expression-tokens. The others also takes into consideration languages of expression-types. Generally, syntactically-categorial languages are languages built in accordance with principles of the theory of syntactic categories introduced by S. Leśniewski [1929,1930]; they are connected (...) with- the Ajdukiewicz’s work [1935] which was a continuation of Leśniewski’s idea and further developed and popularized in the research on categorial grammars, by Y. Bar-Hillel [1950,1953,1964]. To assign a suitable syntactic category to each word of the vocabulary is the main idea of syntactically-categorial approach to language. Compound expressions are built from the words of the vocabulary and then a suitable syntactic-category is assigned to each of them. A language built in this way should be decidable, which means that there should exist an algorithm for deciding about each expression of it, whether it is well-formed or is syntactically connected . The traditional, originating from Husserl, understanding of the syntactic category confronts some difficulties. This notion is defined by abstraction using the concept of affiliation of two expressions to the same syntactic category. (shrink)

Children approach counterfactual questions about stories with a reasoning strategy that falls short of adults’ Counterfactual Reasoning (CFR). It was dubbed “Basic Conditional Reasoning” (BCR) in Rafetseder et al. (Child Dev 81(1):376–389, 2010). In this paper we provide a characterisation of the differences between BCR and CFR using a distinction between permanent and nonpermanent features of stories and Lewis/Stalnaker counterfactual logic. The critical difference pertains to how consistency between a story and a conditional antecedent incompatible with a nonpermanent feature of (...) the story is achieved. Basic conditional reasoners simply drop all nonpermanent features of the story. Counterfactual reasoners preserve as much of the story as possible while accommodating the antecedent. (shrink)

Corcoran, J. 2005. Counterexamples and proexamples. Bulletin of Symbolic Logic 11(2005) 460. -/- John Corcoran, Counterexamples and Proexamples. Philosophy, University at Buffalo, Buffalo, NY 14260-4150 E-mail: corcoran@buffalo.edu Every perfect number that is not even is a counterexample for the universal proposition that every perfect number is even. Conversely, every counterexample for the proposition “every perfect number is even” is a perfect number that is not even. Every perfect number that is odd is a proexample for the existential proposition that some (...) perfect number is odd. Conversely, every proexample for the proposition “some perfect number is odd” is a perfect number that is odd. As trivial these remarks may seem, they can not be taken for granted, even in mathematical and logical texts designed to introduce their respective subjects. One well-reviewed book on counterexamples in analysis says that in order to demonstrate that a universal proposition is false it is necessary and sufficient to construct a counterexample. It is easy to see that it is not necessary to construct a counterexample to demonstrate that the proposition “every true proposition is known to be true” is false–necessity fails. Moreover the mere construction of an object that happens to be a counterexample does not by itself demonstrate that it is a counterexample–sufficiency fails. In order to demonstrate that a universal proposition is false it is neither necessary nor sufficient to construct a counterexample. Likewise, of course, in order to demonstrate that an existential proposition is true it is neither necessary nor sufficient to construct a proexample. This article defines the above relational concepts of counterexample and of proexample, it discusses their surprising history and philosophy, it gives many examples of uses of these and related concepts in the literature and it discusses some of the many errors that have been made as a result of overlooking the challenging subtlety of the proper use of these two basic and indispensable concepts. (shrink)

-/- A variable binding term operator (vbto) is a non-logical constant, say v, which combines with a variable y and a formula F containing y free to form a term (vy:F) whose free variables are exact ly those of F, excluding y. -/- Kalish-Montague proposed using vbtos to formalize definite descriptions, set abstracts {x: F}, minimalization in recursive function theory, etc. However, they gave no sematics for vbtos. Hatcher gave a semantics but one that has flaws. We give a correct (...) semantic analysis of vbtos. We also give axioms for using them in deductions. And we conjecture strong completeness for the deductions with respect to the semantics. The conjecture was later proved independently by the authors and by Newton da Costa. -/- The expression (vy:F) is called a variable bound term (vbt). In case F has only y free, (vy:F) has the syntactic propreties of an individual constant; and under a suitable interpretation of the language vy:F) denotes an individual. By a semantic analysis of vbtos we mean a proposal for amending the standard notions of (1) "an interpretation o f a first -order language" and (2) " the denotation of a term under an interpretation and an assignment", such that (1') an interpretation o f a first -order language associates a set-theoretic structure with each vbto and (2') under any interpretation and assignment each vb t denotes an individual. (shrink)

A study is reported testing two hypotheses about a close parallel relation between indicative conditionals, if A then B, and conditional bets, I bet you that if A then B. The first is that both the indicative conditional and the conditional bet are related to the conditional probability, P(B|A). The second is that de Finetti's three-valued truth table has psychological reality for both types of conditional – true, false, or void for indicative conditionals and win, lose or void for conditional (...) bets. The participants were presented with an array of chips in two different colours and two different shapes, and an indicative conditional or a conditional bet about a random chip. They had to make judgments in two conditions: either about the chances of making the indicative conditional true or false or about the chances of winning or losing the conditional bet. The observed distributions of responses in the two conditions were generally related to the conditional probability, supporting the first hypothesis. In addition, a majority of participants in further conditions chose the third option, “void”, when the antecedent of the conditional was false, supporting the second hypothesis. (shrink)

In this paper we consider conditional random quantities (c.r.q.’s) in the setting of coherence. Based on betting scheme, a c.r.q. X|H is not looked at as a restriction but, in a more extended way, as \({XH + \mathbb{P}(X|H)H^c}\) ; in particular (the indicator of) a conditional event E|H is looked at as EH + P(E|H)H c . This extended notion of c.r.q. allows algebraic developments among c.r.q.’s even if the conditioning events are different; then, for instance, we can give a (...) meaning to the sum X|H + Y|K and we can define the iterated c.r.q. (X|H)|K. We analyze the conjunction of two conditional events, introduced by the authors in a recent work, in the setting of coherence. We show that the conjoined conditional is a conditional random quantity, which may be a conditional event when there are logical dependencies. Moreover, we introduce the negation of the conjunction and by applying De Morgan’s Law we obtain the disjoined conditional. Finally, we give the lower and upper bounds for the conjunction and disjunction of two conditional events, by showing that the usual probabilistic properties continue to hold. (shrink)

In this small book logician and mathematician Jens Erik Fenstad addresses some of the most important foundational questions of linguistics: What should a theory of meaning look like and how might we provide the missing link between meaning theory and our knowledge of how the brain works? The author’s answer is twofold. On the one hand, he suggests that logical semantics in the Montague tradition and other broadly conceived symbolic approaches do not suffice. On the other hand, he does not (...) argue that the logical approach should be discarded; instead, he opts for a methodological pluralism in which symbolic approaches to meaning are combined with geo- metric ones such as Conceptual Spaces [9] and discusses ways in which these geometric accounts could be hooked up with connectionist frameworks and dynamic systems approaches in neurophysiology. (shrink)

A general theory of logical oppositions is proposed by abstracting these from the Aristotelian background of quantified sentences. Opposition is a relation that goes beyond incompatibility (not being true together), and a question-answer semantics is devised to investigate the features of oppositions and opposites within a functional calculus. Finally, several theoretical problems about its applicability are considered.

Recent accounts of actual causation are stated in terms of extended causal models. These extended causal models contain two elements representing two seemingly distinct modalities. The first element are structural equations which represent the or mechanisms of the model, just as ordinary causal models do. The second element are ranking functions which represent normality or typicality. The aim of this paper is to show that these two modalities can be unified. I do so by formulating two constraints under which extended (...) causal models with their two modalities can be subsumed under so called which contain just one modality. These two constraints will be formally precise versions of Lewissystem of weights or priorities” governing overall similarity between possible worlds. (shrink)

This paper argues that the technical notion of conditional probability, as given by the ratio analysis, is unsuitable for dealing with our pretheoretical and intuitive understanding of both conditionality and probability. This is an ontological account of conditionals that include an irreducible dispositional connection between the antecedent and consequent conditions and where the conditional has to be treated as an indivisible whole rather than compositional. The relevant type of conditionality is found in some well-defined group of conditional statements. As an (...) alternative, therefore, we briefly offer grounds for what we would call an ontological reading: for both conditionality and conditional probability in general. It is not offered as a fully developed theory of conditionality but can be used, we claim, to explain why calculations according to the RATIO scheme does not coincide with our intuitive notion of conditional probability. What it shows us is that for an understanding of the whole range of conditionals we will need what John Heil (2003), in response to Quine (1953), calls an ontological point of view. (shrink)

In “Proof-Theoretic Justification of Logic”, building on work by Dummett and Prawitz, I show how to construct use-based meaning-theories for the logical constants. The assertability-conditional meaning-theory takes the meaning of the logical constants to be given by their introduction rules; the consequence-conditional meaning-theory takes the meaning of the logical constants to be given by their elimination rules. I then consider the question: given a set of introduction rules \, what are the strongest elimination rules that are validated by an assertability (...) conditional meaning-theory based on \? I prove that the intuitionistic introduction rules are the strongest rules that are validated by the intuitionistic elimination rules. I then prove that intuitionistic logic is the strongest logic that can be given either an assertability-conditional or consequence-conditional meaning-theory. In “Grounding Grounding” I discuss the notion of grounding. My discussion revolves around the problem of iterated grounding-claims. Suppose that \ grounds \; what grounds that \ grounds that \? I argue that unless we can get a satisfactory answer to this question the notion of grounding will be useless. I discuss and reject some proposed accounts of iterated grounding claims. I then develop a new way of expressing grounding, propose an account of iterated grounding-claims and show how we can develop logics for grounding. In “Is the Vagueness Argument Valid?” I argue that the Vagueness Argument in favor of unrestricted composition isn’t valid. However, if the premisses of the argument are true and the conclusion false, mereological facts fail to supervene on non-mereological facts. I argue that this failure of supervenience is an artifact of the interplay between the necessity and determinacy operators and that it does not mean that mereological facts fail to depend on non-mereological facts. I sketch a deflationary view of ontology to establish this. (shrink)

In the proof-theoretic semantics approach to meaning, harmony , requiring a balance between introduction-rules (I-rules) and elimination rules (E-rules) within a meaning conferring natural-deduction proof-system, is a central notion. In this paper, we consider two notions of harmony that were proposed in the literature: 1. GE-harmony , requiring a certain form of the E-rules, given the form of the I-rules. 2. Local intrinsic harmony : imposes the existence of certain transformations of derivations, known as reduction and expansion . We propose (...) a construction of the E-rules (in GE-form) from given I-rules, and prove that the constructed rules satisfy also local intrinsic harmony. The construction is based on a classification of I-rules, and constitute an implementation to Gentzen’s (and Pawitz’) remark, that E-rules can be “read off” I-rules. (shrink)

Argumentations are at the heart of the deductive and the hypothetico-deductive methods, which are involved in attempts to reduce currently open problems to problems already solved. These two methods span the entire spectrum of problem-oriented reasoning from the simplest and most practical to the most complex and most theoretical, thereby uniting all objective thought whether ancient or contemporary, whether humanistic or scientific, whether normative or descriptive, whether concrete or abstract. Analysis, synthesis, evaluation, and function of argumentations are described. Perennial philosophic (...) problems, epistemic and ontic, related to argumentations are put in perspective. So much of what has been regarded as logic is seen to be involved in the study of argumentations that logic may be usefully defined as the systematic study of argumentations, which is virtually identical to the quest of objective understanding of objectivity. (shrink)

I present a high-level account of the semantical distinction between count nouns and non-count nouns. The basic idea is that count nouns are semantically either singular or plural and non-count nouns are neither.

This paper uses a partially ordered set of syntactic categories to accommodate optionality and licensing in natural language syntax. A complex but well-studied data set pertaining to the syntax of quantifier scope and negative polarity licensing in Hungarian is used to illustrate the proposal. The presentation is geared towards both linguists and logicians. The paper highlights that the main ideas can be implemented in different grammar formalisms, and discusses in detail an implementation where the partial ordering on categories is given (...) by the derivability relation of a calculus with residuated and Galois-connected unary operators. (shrink)

So-called mass nouns, however precisely they are defined, are in any case a subset of non-count nouns. Count nouns are either singular or plural; to be non-count is hence to be neither singular nor plural. This is not, as such, a metaphysically significant contrast: 'pieces of furniture' is plural whereas 'furniture' itself is non-count. This contrast is simply between 'the many / few' and 'the much / little' - between counting and measuring. However not all non-count nouns are, like 'furniture', (...) semantically atomic - 'wine' and 'water' are not. And here there are serious difficulties in the assignment of a range of values for variables, in a formal representation of quantified sentences involving such non-atomic non-count nouns. (shrink)

A picture of the world as chiefly one of discrete objects, distributed in space and time, has sometimes seemed compelling. It is however one of the main targets of Henry Laycock's book; for it is seriously incomplete. The picture, he argues, leaves no space for "stuff" like air and water. With discrete objects, we may always ask "how many?," but with stuff the question has to be "how much?" Laycock's fascinating exploration also addresses key logical and linguistic questions about the (...) way we categorize the many and the much. (shrink)

Este texto presenta, y en cierta medida analiza, ambigüedades existentes en textos de lógica y filosofía de la lógica (como la interpretación de los llamados principios, postulados, leyes o verdades lógicas, la coexistencia de la tesis de que toda relación presupone la existencia de al menos dos relata y la de que una cosa puede relacionarse consigo misma, o la llamada "paradoja del mentiroso") bajo el supuesto de que, dado que la lógica no es anterior a la semántica, un análisis (...) semántico puede mostrar no solo que tal polisemia sugiere que ni la disciplina ni las teorías lógicas son tan rigurosas como se ha afirmado, sino también que varias afirmaciones de esas disciplinas carecen de sentido. (shrink)

In this article, logical concepts are defined using the internal syntactic and semantic structure of language. For a first-order language, it has been shown that its logical constants are connectives and a certain type of quantifiers for which the universal and existential quantifiers form a functionally complete set of quantifiers. Neither equality nor cardinal quantifiers belong to the logical constants of a first-order language.

We propose a new account of indicative conditionals, giving acceptability and logical closure conditions for them. We start from Adams’ Thesis: the claim that the acceptability of a simple indicative equals the corresponding conditional probability. The Thesis is widely endorsed, but arguably false and refuted by empirical research. To fix it, we submit, we need a relevance constraint: we accept a simple conditional 'If φ, then ψ' to the extent that (i) the conditional probability p(ψ|φ) is high, provided that (ii) (...) φ is relevant for ψ. How (i) should work is well-understood. It is (ii) that holds the key to improve our understanding of conditionals. Our account has (i) a probabilistic component, using Popper functions; (ii) a relevance component, given via an algebraic structure of topics or subject matters. We present a probabilistic logic for simple indicatives, and argue that its (in)validities are both theoretically desirable and in line with empirical results on how people reason with conditionals. (shrink)

In the core chapters 4–6, Iacona argues against the “Uniqueness Thesis”, stating that “there is a unique notion of logical form that fulfils both the logical role and the semantic role”, where the former “concerns the formal explanation of logical properties and logical relations, such as validity or contradiction”, and the latter “concerns the formulation of a compositional theory of meaning”. He argues for this on the basis of relations of coreference among referential expressions, names and indexicals. From what I (...) take to be a fundamental agreement on most relevant issues, here I will nonetheless press him to clarify the notions of intrinsicness and the logical and semantic role of logical form on which he relies. (shrink)

This thesis is about the metaphysics of logic. I argue against a view I refer to as ‘logical realism’. This is the view that the logical constants represent a particular kind of metaphysical structure, which I dub ‘logico-metaphysical structure’. I argue instead for a more metaphysically lightweight view of logic which I dub ‘logical expressivism’. -/- In the first part of this thesis (Chapters I and II) I argue against a number of arguments that Theodore Sider has given for logical (...) realism. In Chapter I, I present an argument of his to the effect that logico-metaphysical structure provides the only good explanation of the semantic determinacy of the logical constants. I argue that other explanations are possible. In Chapter II, I present another argument of his to the effect that logico-metaphysical structure is something that comes along with ontological realism: the view that there is a non-language-relative fact of the matter about what exists. I argue that the connection between logical and ontological realism is not as close as Sider makes it out to be. -/- In the second part of this thesis (Chapters III – V) I set out a positive view of the logical constants that can explain both why their meanings are semantically determinate, and why they form part of our vocabulary. On that view, the primary bearers of logical structure are propositional attitudes, and the logical constants are in our language as vehicles for the expression of logically complex propositional attitudes. In Chapter III, I set out an expressivist theory of propositional logic. In Chapter IV, I use this theory to explain how the logical connectives end up having determinate meanings. In Chapter V, I extend the expressivist theory to predicate logic. (shrink)

This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures a notion of validity. A notion of relative necessary is defined in terms of it, which expresses a necessary connection between the assumptions and the conclusion of a deduction.

We discuss a well-known puzzle about the lexicalization of logical operators in natural language, in particular connectives and quantifiers. Of the many logically possible functions of the relevant type, only few appear in the lexicon of natural languages: the connectives in English, for example, are only 'and', 'or', and perhaps 'nor' (expressing negated disjunction). The logically possible 'nand' (negated conjunction) is not expressed by a lexical entry of English, or of any natural language. The explanation we propose is based on (...) the “dynamic” behaviour of connectives and quantifiers: we define update potentials for logical operator, under the assumption that the logical structure of a sentence p defines what type of update p contributes to context, together with the speech act performed (assertion or denial). We conjecture that the adequacy of update potentials determines the limits of lexicalizability for logical operators in natural language. (shrink)

We present epistemic multilateral logic, a general logical framework for reasoning involving epistemic modality. Standard bilateral systems use propositional formulae marked with signs for assertion and rejection. Epistemic multilateral logic extends standard bilateral systems with a sign for the speech act of weak assertion (Incurvati and Schlöder 2019) and an operator for epistemic modality. We prove that epistemic multilateral logic is sound and complete with respect to the modal logic S5 modulo an appropriate translation. The logical framework developed provides the (...) basis for a novel, proof-theoretic approach to the study of epistemic modality. To demonstrate the fruitfulness of the approach, we show how the framework allows us to reconcile classical logic with the contradictoriness of so-called Yalcin sentences and to distinguish between various inference patterns on the basis of the epistemic properties they preserve. (shrink)

We formally introduce a novel, yet ubiquitous, category of norms: norms of instrumentality. Norms of this category describe which actions are obligatory, or prohibited, as instruments for certain purposes. We propose the Logic of Agency and Norms (LAN) that enables reasoning about actions, instrumentality, and normative principles in a multi-agent setting. Leveraging LAN , we formalize norms of instrumentality and compare them to two prevalent norm categories: norms to be and norms to do. Last, we pose principles relating the three (...) categories and evaluate their validity vis-à-vis notions of deliberative acting. On a technical note, the logic will be shown decidable via the finite model property. (shrink)

The present contribution might be regarded as a kind of defense of the common sense in logic. It is demonstrated that if the classical negation is interpreted as the minimal negation with n = 2 truth values, then deviant logics can be conceived as extension of the classical bivalent frame. Such classical apprehension of negation is possible in non- classical logics as well, if truth value is internalized and bivalence is replaced by bipartition.