Most nonmonotonic logics are assumed to be cumulative, which is often regarded as the minimum requirement for a logic. We argue that cumulativity, in particular, cumulative transitivity can be abandoned, in order to better characterize reasoning in uncertainty. But giving up cumulative transitivity makes it hard to obtain representation results for these logics. Borrowing the idea from strict-tolerant logics, we give some representation results for nonmonotonic logics that are not cumulatively transitive.

We investigate two formalizations of Optimality Theory, a successful paradigm in linguistics.We first give an order-theoretic counterpart for the data and processinvolved in candidate evaluation.Basically, we represent each constraint as a function that assigns every candidate a degree of violation.As for the second formalization, we define (after Samek-Lodovici and Prince) constraints as operations that select the best candidates out of a set of candidates.We prove that these two formalizations are equivalent (accordingly, there is no loss of generality with using violation (...) marks and dispensing with them is only apparent).Importantly, we show that the second formalization is equivalent with a class of operations over sets of formulas in a given logical language.As a result, we prove that Optimality Theory can be characterized by certain cumulative logics.So, applying Optimality Theory is shown to be reasoning by the rules of cumulative logics. (shrink)

The systems Kα of transfinite cumulative types up to α are extended to systems K∞α that include a natural infinitary inference rule, the so-called limit rule. For countable α a semantic completeness theorem for K∞α is proved by the method of reduction trees, and it is shown that every model of K∞α is equivalent to a cumulative hierarchy of sets. This is used to show that several axiomatic first-order set theories can be interpreted in K∞α, for suitable α.

Standard Type Theory, STT, tells us that b^n(a^m) is well-formed iff n=m+1. However, Linnebo and Rayo have advocated the use of Cumulative Type Theory, CTT, has more relaxed type-restrictions: according to CTT, b^β(a^α) is well-formed iff β > α. In this paper, we set ourselves against CTT. We begin our case by arguing against Linnebo and Rayo’s claim that CTT sheds new philosophical light on set theory. We then argue that, while CTT ’s type-restrictions are unjustifiable, the type-restrictions imposed (...) by STT are justified by a Fregean semantics. What is more, this Fregean semantics provides us with a principled way to resist Linnebo and Rayo’s Semantic Argument for CTT. We end by examining an alternative approach to cumulative types due to Florio and Jones; we argue that their theory is best seen as a misleadingly formulated version of STT. (shrink)

For nonmonotonic logics, Cumulativity is an important logical rule. We show here that Cumulativity fans out into an infinity of different conditions, if the domain is not closed under finite unions.

In this paper I will argue that most objections to deductive analyses of a priori analogies are incorrect, often involve basic misinterpretations of what the deductive reconstruction of those arguments are saying, and sometimes also betray a confusion about what part of the reasoning corresponds to the analogical inference. In particular, I will be focusing on a raft of objections made by Juthe in [2015] and subject his alternative views to criticism. -/- I will then argue that Juthe does implicitly (...) have a good argument against deductivism: adding further analogues seems to have a cumulative force that they would not have on a deductivist analysis. This is so not only in ordinary analogical arguments but, perhaps surprisingly, with a priori analogical arguments. I will then argue that this does not favor a sui generis view of the analogical argument over inductivist views, and attempt to show that a confirmation-theoretic approach to analogical inference makes the best sense of our intuitions about the strength of analogical arguments. (shrink)

This is a critique of J. H. Sobel’s ’Logic and Theism’, defending the use of cumulative arguments, and the coherence of theistic metaphysics.

The von Neumann hierarchy of sets is heavily used as a basic tool in classical set theory, being an underlying ingredient in many proofs and concepts. In constructive set theories like without the powerset axiom however, it loses much of its potency by ceasing to be a hierarchy of sets as its single stages become only classes. This article proposes an alternative cumulative hierarchy which does not have this drawback and provides examples of how it can be used to (...) prove new theorems in. (shrink)

This article proposes a new logical framework for NL quantification. The framework is based on Generalized Quantifiers, Skolem-like functional dependencies, and Maximality of the involved sets of entities. Among the readings available for NL sentences, those where two or more sets of entities are independent of one another are particularly challenging. In the literature, examples of those readings are known as Collective and Cumulative readings. This article briefly analyzes previous approaches to Cumulativity and Collectivity, and indicates (Schwarzschild in Pluralities. (...) Kluwer, Dordrecht, 1996) as the best proposal so far to deal with these readings. Then, it incorporates its insights in the logical framework defined in Robaldo (J Philos Log 39(1):23–58, 2009a), leading to a scalable logical account for NL quantification. (shrink)

This paper investigates different readings of plural and reciprocal sentences and how they can be derived from syntactic surface structures in a systematic way. The main thesis is that these readings result from different ways of inserting logical operators at the level of Logical Form. The basic operator considered here is a cumulative mapping from predicates that apply to singularities onto the corresponding predicates that apply to pluralities. Given a theory which allows for free insertion of such operators, it (...) can then be shown that the lexical semantics of the reciprocal expressions each other/one another consists of exactly two components, namely an anaphoric variable and a non-identity statement. This receives further support from the observation that it is exactly these two components that can be focused by only; all that remains to be done is to correctly manipulate these components at the level of LF. (shrink)

In this paper I examine the nature of Russell's ramified type theory resolution of paradoxes. In particular, I consider the effect of construing the types in Church's cumulative sense, that is, the range of a variable of a given type includes the range of every variable of directly lower type. Contrary to what seems to be generally assumed, I show that the decision to make the levels cumulative and allow this to be reflected in the semantics is not (...) neutral with respect to the solution of the paradoxes. I introduce a distinction between syntactical and semantical cumulativeness. It turns out that noncumulative type theories (in either sense) are equally capable of dealing with the paradoxes. Furthermore, whether cumulativeness is appropriate appears to be context dependent. (shrink)

Three indexes have been compiled: authors of main articles (including our special departments such as ‘Projects in progress’ and ‘Notes and discussions’); essay reviews; and book reviews. Co-author...

We present two results which shed some more light on the deep connection between ZFA and the standard ZF set theory: First of all we refine a result of Forti and Honsell in order to prove that the universe of ZFA can also be obtained as the least fixed point of a continuous operator and not only as the greatest fixed point of the powerset operator. Next we show that it is possible to define a new absolute Gödel operation in (...) addition to the standard ones in order to obtain the “constructible” model of ZFA as the least fixed point of the continuous operator of Gödel closure with respect to the standard and the new Gödel operations. (shrink)

Until the middle of the present century it was a commonly accepted opinion that theory change in science was the expression of cumulative progress consisting in the acquisition of new truths and the elimination of old errors. Logical empiricists developed this idea through a deductive model, saying that a theory T superseding a theory T must be able logically to explain whatever T explained and something more as well. Popper too shared this model, but stressed that T explains the (...) old known facts in its own new way. The further pursual of this line quickly led to the thesis of the non-comparability or incommensurability of theories: if T and T are different, then the very concepts which have the same denomination in both actually have different meanings; in such a way any sentence whatever has different meanings in T and in T and cannot serve to compare them. owing to this, the deductive model was abandoned as a tool for understanding theory change and scientific progress, and other models were proposed by people such as Lakatos, Kuhn, Feyerabend, Sneed and Stegmüller. The common feature of all these new positions may be seen in the claim that no possibility exists of interpreting theory change in terms of the cumulative acquisition of truth. It seems to us that the older and the newer positions are one-sided, and, in order to eliminate their respective shortcomings, we propose to interpret theory change in a new way.The starting point consists in recognizing that every scientific discipline singles out its specific domain of objects by selecting a few specific predicates for its discourse. Some of these predicates must be operational and they determine the objects of the theory concerned. In the case of a transition from T to T, we must consider whether or not the operational predicates remain unchanged, in the sense of being still related to the same operations. If they do not change in their relation to operations, then T and T are comparable. If the operational predicates are not all identical in T and T, the two theories show a rather high degree of incommensurability, and this happens because they do not refer to the same objects. Theory change means in this case change of objects. But now we can see that even incommensurability is compatible with progress conceived as the accumulation of truth. Indeed, T and T remain true about their respective objects, and the global amount of truth acquired is increased. (shrink)

The paper presents an exhaustive menu of nonmonotonic logics. The options are individuated in terms of the principles they reject. I locate, e.g., cumulative logics and relevance logics on this menu. I highlight some frequently neglected options, and I argue that these neglected options are particularly attractive for inferentialists.

The following bare-bones story introduces the idea of a cumulative hierarchy of pure sets: 'Sets are arranged in stages. Every set is found at some stage. At any stage S: for any sets found before S, we find a set whose members are exactly those sets. We find nothing else at S.' Surprisingly, this story already guarantees that the sets are arranged in well-ordered levels, and suffices for quasi-categoricity. I show this by presenting Level Theory, a simplification of set (...) theories due to Scott, Montague, Derrick, and Potter. (shrink)

After a brief presentation of the Verisimilitudinarian approach to scientific progress, I argue that the notion of estimated verisimilitude is too weak for the purposes of scientific realism. Despite the realist-correspondist intuition that inspires the model—the idea that our theories get closer and closer to ‘the real way the world is’—, Bayesian estimations of truthlikeness are not objective enough to sustain a realist position. The main argument of the paper is that, since estimated verisimilitude is not connected to actual verisimilitude, (...) the way the Verisimilitudinarian account works is not in the end different from other antirealist accounts. Finally, I briefly present Alexander Bird’s cumulative approach to scientific progress, and argue that it has a similar problem; Bird has in mind truth in the correspondence sense, but all the metaphysical weight is put on the notion of ‘approximate truth’—whose connection to ‘the real way the world is’ is not clear. (shrink)

This cumulative course on Johannes Heinrichs' philosophical works presents the essence of his previous publications: A rich, consistent, and novel monolithic system defying temptations by the zeitgeist. Starting with an emphasis on reflection as the basis of epistemology, Heinrichs also covers the mind-body dualism in an anthropology chapter, moves on to presenting summaries of his 'Theory of Democracy' as well as of his 'Philosophical Semiotics', followed by an outline of structural and integral ontology. An overview of ethical positions in (...) the final chapter proves the fertility of Heinrichs? theoretical-reflection methods. (shrink)

According to Cantor (Mathematische Annalen 21:545–586, 1883 ; Cantor’s letter to Dedekind, 1899 ) a set is any multitude which can be thought of as one (“jedes Viele, welches sich als Eines denken läßt”) without contradiction—a consistent multitude. Other multitudes are inconsistent or paradoxical. Set theoretical paradoxes have common root—lack of understanding why some multitudes are not sets. Why some multitudes of objects of thought cannot themselves be objects of thought? Moreover, it is a logical truth that such multitudes do (...) exist. However we do not understand this logical truth so well as we understand, for example, the logical truth $${\forall x \, x = x}$$ . In this paper we formulate a logical truth which we call the productivity principle. Rusell (Proc Lond Math Soc 4(2):29–53, 1906 ) was the first one to formulate this principle, but in a restricted form and with a different purpose. The principle explicates a logical mechanism that lies behind paradoxical multitudes, and is understandable as well as any simple logical truth. However, it does not explain the concept of set. It only sets logical bounds of the concept within the framework of the classical two valued $${\in}$$ -language. The principle behaves as a logical regulator of any theory we formulate to explain and describe sets. It provides tools to identify paradoxical classes inside the theory. We show how the known paradoxical classes follow from the productivity principle and how the principle gives us a uniform way to generate new paradoxical classes. In the case of ZFC set theory the productivity principle shows that the limitation of size principles are of a restrictive nature and that they do not explain which classes are sets. The productivity principle, as a logical regulator, can have a definite heuristic role in the development of a consistent set theory. We sketch such a theory—the cumulative cardinal theory of sets. The theory is based on the idea of cardinality of collecting objects into sets. Its development is guided by means of the productivity principle in such a way that its consistency seems plausible. Moreover, the theory inherits good properties from cardinal conception and from cumulative conception of sets. Because of the cardinality principle it can easily justify the replacement axiom, and because of the cumulative property it can easily justify the power set axiom and the union axiom. It would be possible to prove that the cumulative cardinal theory of sets is equivalent to the Morse–Kelley set theory. In this way we provide a natural and plausibly consistent axiomatization for the Morse–Kelley set theory. (shrink)

According to existing accounts of indicative conditionals, any argument of the following form is valid: ϕ → ψ, ( ϕ ∧ ψ ) → χ ∴ ϕ → χ. Here, I present a set of counterexamples to show that there exist invalid arguments of this form. I argue that this data poses serious problems to variably strict accounts of conditionals, as such accounts are structurally unable to accommodate it. Dynamic strict accounts, however, are a different story. While existing dynamic strict (...) accounts do not accommodate the data, they are in principle able to, and I propose a modified dynamic strict account, drawing from von Fintel, that does. The key modification is this: whereas existing dynamic strict accounts take into account only the effects of conditional antecedents in changing the semantic context, the data shows that we must also take into account the effects of conditional consequents in changing the semantic context. (shrink)

Information-theoretic approaches to formal logic analyse the "common intuitive" concept of propositional implication (or argumental validity) in terms of information content of propositions and sets of propositions: one given proposition implies a second if the former contains all of the information contained by the latter; an argument is valid if the conclusion contains no information beyond that of the premise-set. This paper locates information-theoretic approaches historically, philosophically and pragmatically. Advantages and disadvantages are identified by examining such approaches in themselves and (...) by contrasting them with standard transformation-theoretic approaches. Transformation-theoretic approaches analyse validity (and thus implication) in terms of transformations that map one argument onto another: a given argument is valid if no transformation carries it onto an argument with all true premises and false conclusion. Model-theoretic, set-theoretic, and substitution-theoretic approaches, which dominate current literature, can be construed as transformation-theoretic, as can the so-called possible-worlds approaches. Ontic and epistemic presuppositions of both types of approaches are considered. Attention is given to the question of whether our historically cumulative experience applying logic is better explained from a purely information-theoretic perspective or from a purely transformation-theoretic perspective or whether apparent conflicts between the two types of approaches need to be reconciled in order to forge a new type of approach that recognizes their basic complementarity. (shrink)

We prove some embedding theorems for classical conditional logic, covering 'finitely cumulative' logics, 'preferential' logics and what we call 'semi-monotonic' logics. Technical tools called 'partial frames' and 'frame morphisms' in the context of neighborhood semantics are used in the proof.

A Plithogenic Logical proposition P is a proposition that is characterized by many degrees of truth-values with respect to many corresponding attribute-values (or random variables) that characterize P. Each degree of truth-value may be classical, fuzzy, intuitionistic fuzzy, neutrosophic, or other fuzzy extension type logic. At the end, a cumulative truth of P is computed.

In philosophical logic, a certain family of model constructions has received particular attention. Prominent examples are the cumulative hierarchy of well-founded sets, and Kripke's least fixed point models of grounded truth. I develop a general formal theory of groundedness and explain how the well-founded sets, Cantor's extended number-sequence and Kripke's concepts of semantic groundedness are all instances of the general concept, and how the general framework illuminates these cases. Then, I develop a new approach to a grounded theory of (...) proper classes. -/- However, the general concept of groundedness does not account for the philosophical significance of its paradigm instances. Instead, I argue, the philosophical content of the cumulative hierarchy of sets is best understood in terms of a primitive notion of ontological priority. -/- Then, I develop an analogous account of Kripke's models. I show that they exemplify the in-virtue-of relation much discussed in contemporary metaphysics, and thus are philosophically significant. I defend my proposal against a challenge from Kripke's “ghost of the hierarchy”. (shrink)

We apply the recently elaborated notions of 'pragmatic truth' and 'pragmatic probability' to the problem of the construction of a logic of inductive inference. It is argued that the system outlined here is able to overcome many of the objections usually levelled against such attempts. We claim, furthermore, that our view captures the essentially cumulative nature of science and allows us to explain why it is indeed reasonable to accept and believe in the conclusions reached by inductive inference.

In the paper, I first consider how his theory of social norms is connected to his theory of social evolution by examining the importance of learning in his theory of both social norms and social evolution. Then I turn to David Owen and Amy Allen's critiques of Jürgen Habermas. My aim is to develop their critique of Habermas by elucidating an important but neglected distinction between the developmental logic and the developmental dynamics in Habermas's theory of social evolution. Drawing on (...) this distinction, I claim that Habermas's theory is problematic in that he underestimates the importance of the developmental dynamics. By introducing the distinction between individual learning and social learning, I also question his account of progress as accumulative experience of learning. This is because, unlike cumulative culture at the level of phylogenesis, individuals ontogenetically experience a kind of non‐cumulative social learning. Unlike cumulative culture, each individual has to undergo a kind of non‐cumulative social learning. The problem is that Habermas conceives the learning process too narrowly such that learning does not guarantee social evolution. (shrink)

We apply the recently elaborated notions of ‘pragmatic truth’ and ‘pragmatic probability’ to the problem of the construction of a logic of inductive inference. It is argued that the system outlined here is able to overcome many of the objections usually levelled against such attempts. We claim, furthermore, that our view captures the essentially cumulative nature of science and allows us to explain why it is indeed reasonable to accept and believe in the conclusions reached by inductive inference.

Information-theoretic approaches to formal logic analyze the "common intuitive" concepts of implication, consequence, and validity in terms of information content of propositions and sets of propositions: one given proposition implies a second if the former contains all of the information contained by the latter; one given proposition is a consequence of a second if the latter contains all of the information contained by the former; an argument is valid if the conclusion contains no information beyond that of the premise-set. This (...) paper locates information-theoretic approaches historically, philosophically, and pragmatically. Advantages and disadvantages are identified by examining such approaches in themselves and by contrasting them with standard transformation-theoretic approaches. Transformation-theoretic approaches analyze validity (and thus implication) in terms of transformations that map one argument onto another: a given argument is valid if no transformation carries it onto an argument with all true premises and false conclusion. Model-theoretic, set-theoretic, and substitution-theoretic approaches, which dominate current literature, can be construed as transformation-theoretic, as can the so-called possible-worlds approaches. Ontic and epistemic presuppositions of both types of approaches are considered. Attention is given to the question of whether our historically cumulative experience applying logic is better explained from a purely information-theoretic perspective or from a purely transformation-theoretic perspective or whether apparent conflicts between the two types of approaches need to be reconciled in order to forge a new type of approach that recognizes their basic complementarity. (shrink)

Is modern logic an improvement on Aristotelian logic or is there some other relationship between the two? In which sense is modern logic more advanced than Aristotelian logic? Is logic a cummulative developing discipline or is the progress in the course of the history of logic somehow different from the cumulatively developing processes? Are these logics based on different -- mutually untranslatable -- paradigms? The paper analyzes these questions in connection with some more general problems of the philosophy of (...) science. (shrink)

The paper concerns the algebraic structure of the set of cumulative distribution functions as well as the relationship between the resulting algebra and the infinite-valued Łukasiewicz algebra. The paper also discusses interrelations holding between the logical systems determined by the above algebras.

In this paper we study proof procedures for some variants of first-order modal logics, where domains may be either cumulative or freely varying and terms may be either rigid or non-rigid, local or non-local. We define both ground and free variable tableau methods, parametric with respect to the variants of the considered logics. The treatment of each variant is equally simple and is based on the annotation of functional symbols by natural numbers, conveying some semantical information on (...) the worlds where they are meant to be interpreted.This paper is an extended version of a previous work where full proofs were not included. Proofs are in some points rather tricky and may help in understanding the reasons for some details in basic definitions. (shrink)

I present the realist conception of logic supported by Oswaldo Chateaubriand which integrates ontological and epistemological aspects, opposing it to mathematical and linguistic conceptions. I give special attention to the peculiarities of his hierarchy of types in which some properties accumulate and others have a multiple degree. I explain such deviations of the traditional conception, showing the underlying purpose in each of these peculiarities. I compare the ideas of Chateaubriand to the similar ideas of Frege, Tarski and Gödel. I suggest (...) a view of the logical properties in terms of the Aristotelian notion of focal meaning and I give a formal expression to the type of the entities in the hierarchy proposed by Chateaubriand. (shrink)

A default theory can be seen as a way for representing a set of formulae, i.e., its extensions. In this paper, we characterize the sets of formulae that can be expressed by a default theory according to various semantics: justified, constrained, rational, cumulative, QDL, CADL, and two semantics with priorities. These characterizations imply some non-translatability results between semantics.

Two of the major problems in AGM-style belief revision, namely the difficulties in accounting for iterated change and for Ramsey test conditionals, have satisfactory solutions in descriptor revision. In descriptor revision, the input is a metalinguistic sentence specifying the success condition of the operation. The choice mechanism selects one of the potential outcomes in which the success condition is satisfied. Iteration of this operation is unproblematic. Ramsey test conditionals can be introduced without giving rise to the paradoxical results that they (...) generate in other systems. In addition to standard Ramsey test conditionals, a more general variant of epistemic conditionals is defined, representing statements of the form ”if the belief state is changed to satisfy condition A then it will satisfy condition B”. An axiomatic characterization of such descriptor conditionals is presented. It is related in intricate ways to the KLM postulates for cumulative reasoning. (shrink)

ABSTRACT Reiter's default logic is one of the most prominent and well-studied approaches to nonmonotonic reasoning. Its evolution has resulted in diverse variants enjoying many interesting properties. This process however seems to be diverging because it has led to default logics that are difficult to compare due to different formal characterizations—sometimes even dealing with different objects of discourse. This problem is addressed in this paper in two ways. One the one hand, we elaborate on the relationships between different types (...) of default logics and discuss their differences wrt some basic properties. In particular, we show how two recently proposed variants, namely rational and CA-default logic, are related to each other and existing default logics. As an interesting byproduct, we obtain a cumulative counterpart to Lukasiewicz' variant of default logic. The resulting system is insofar surprising since it necessitates to refine the canonical way of assuring cumulativity in default logics. On the other hand, we pursue an integrating approach. We give a translation embedding rational and CA-default logic into a recently developed framework for default logics. This allows us not only to classify these variants, but it moreover provides us with semantical underpinnings that have been lacking so far. (shrink)

According to Bocheński’s description of the history of formal logic, there clearly is some objective development, though far from being cumulative or linear. The history of logic throughout the world consists of three relatively short pinnacles preceded by also short periods of awakening and followed by periods of extensive commentary running into long periods of standstill and decadence, when nearly all achievements are consigned to oblivion.

The ancient problems of bankruptcy, contested garment, and rights arbitration have generated many studies, debates, and controversy. The objective of this paper is to show that the Shapley value from game theory, measuring the power of each player in a game, may be consistently applied for getting the general one-step solution of all these three problems viewed as -person games. The decision making is based on the same tool, namely the game theory logic based on the use of the Shapley (...) value, but the specific games involved are slightly different in each problem. The kind of claims of the players, the relationship between the given claims and the given resources available, and the particular way of calculating the generalized characteristic function of the game determine the specific type of game which has to be solved in each of the three ancient problems mentioned. The iterative use of the Shapley value may also justify the well-known Aumann-Maschler step-by-step procedure for solving the bankruptcy problem. (shrink)