We can have credences in an infinite number of propositions—that is, our opinion set can be infinite. Accuracy-first epistemologists have devoted themselves to evaluating credal states with the help of the concept of ‘accuracy’. Unfortunately, under several innocuous assumptions, infinite opinion sets yield several undesirable results, some of which are even fatal, to accuracy-first epistemology. Moreover, accuracy-first epistemologists cannot circumvent these difficulties in any standard way. In this regard, we will suggest a non-standard approach, called (...) a relativistic approach, to accuracy-first epistemology and show that such an approach can successfully circumvent undesirable results while having some advantages over the standard approach. (shrink)

There is a well-known equivalence between avoiding accuracy dominance and having probabilistically coherent credences (see, e.g., de Finetti 1974, Joyce 2009, Predd et al. 2009, Pettigrew 2016). However, this equivalence has been established only when the set of propositions on which credence functions are defined is finite. In this paper, I establish connections between accuracy dominance and coherence when credence functions are defined on an infinite set of propositions. In particular, I establish the necessary results to extend the classic (...) accuracy argument for probabilism to certain classes of infinite sets of propositions including countably infinite partitions. (shrink)

For two ideally rational agents, does learning a finite amount of shared evidence necessitate agreement? No. But does it at least guard against belief polarization, the case in which their opinions get further apart? No. OK, but are rational agents guaranteed to avoid polarization if they have access to an infinite, increasing stream of shared evidence? No.

From different angles of science, there has been a growing interest in the abilities of groups to track the truth. The Condorcet Jury Theorem (1785) states that without communication, infinitely big groups will reach a correct majority opinion with certainty. Coughlan (2000), meanwhile formulated a model in which all agents communicate with each other, showing that majorities are only just as good as fully-communicating individuals. In reality, communication is usually between these two extremes: some agents communicate with some of (...) the others, but not with all others. We refer to this as partial communication. This thesis provides a Bayesian framework to study the influence of partial communication on individual as well as group accuracy, thereby generalising Condorcet’s as well as Coughlan’s setting. We obtain results for individual and group accuracy in three type of networks. Firstly, we study the extreme case where there is either no communication or everyone communicates with everyone. Secondly, we determine accuracy for regular networks, in which all agents communicate with equally many other agents. Thirdly, we derive a formula to express the expected accuracy in random networks, in which agents can communicate with various numbers of other agents. The formula enables us to determine the effect of various parameters on the individual and group accuracy in a random network with partial communication. Finally, we show that in random networks, despite correlation between agents, we can still obtain accurate majorities under some constraints. (shrink)

Consider an infinite set of discrete, finite-sized solid balls (i.e., elements) extending in all directions forever. Here, infinite set is not meant so much in the abstract, mathematical sense but in more of a physical sense where the balls have physical size and physical location-type relationships with their neighbors. In this sense, the set is used as an analogy for our possibly infinite physical universe. Two observers are viewing this set. One observer is internal to the set (...) and is of the same finite size scale as the ball elements. Another observer is external to the set and is infinite in size relative to the balls and observer within the set. This observer is of the same size scale as the set as a whole. What do these sets look like to the two observers? The finite-sized (relative to the balls inside the set) observer within the set would view the set as a space composed of discrete, finite-sized objects. The external infinite-sized (relative to the inside the set) observer would view the very same set as a continuous space and would see no distinct elements within the set. How does this relate to us? First, the differing views of set N as being composed of a discrete versus continuous space may be related to the differing views of spacetime as discrete and continuous. Second, the perspective of the observer would have an impact on the assignment of a cardinality to an infinite set. (shrink)

The purpose of this paper is to explore infinite sets and classes by mean hyperoperations. With ideal notion, the idea of extending infinite sets is as large as those objects. In this paper, extensions with hyperoperations are realized, like factorial, derivative, integral and operations between vector spaces. The ideas about infinite and count are enlarged.

Suppose one has a system, the infinite set of positive integers, P, and one wants to study the characteristics of a subset (or subsystem) of that system, the infinite subset of odd positives, O, relative to the overall system. In mathematics, this is done by pairing off each odd with a positive, using a function such as O=2P+1. This puts the odds in a one-to-one correspondence with the positives, thereby, showing that the subset of odds and the original (...) set of positives are the same size, or have the same cardinality. This counter-intuitive result ignores the “natural” relationship of one odd for every two positives in the sequence of positive integers, which would suggest that O is one-half the size of P. However, in the set of axioms that constitute mathematics, it is considered valid. Fair enough. In the physical universe (i.e., the starting system), though, relationships between entities matter. In biochemistry, if you start with an organism, say a rat, and you want to study its heart, you can do this by removing some heart cells and studying them in isolation in a cell culture system. But, the results often differ compared to what occurs in the intact animal because studying the isolated cultured cells ignores the relationships in the intact body between the cells, the rest of the heart tissue and the rest of the rat. In chemistry, if a copper atom were studied in isolation, it would never be known that copper atoms in bulk can conduct electricity because the atoms share their electrons. In physics, the relationships between inertial reference frames in relativity, and observer and observed in quantum physics can't be ignored. Relationships matter in the physical world, but the mathematics of infinite sets is still used to describe it. Does this matter? It seems to, at least in physics. Infinities cause numerous problems in theoretical physics such as non-renormalizability and problems in unifying quantum mehanics and general relativity . This suggests that the pairing off method and the mathematics of infinite sets based on it are analogous to a cell culture system or studying a copper atom in isolation if they are used in studying the physical universe because they ignore the inherent relationships between entities. In the real, physical world, the natural, inherent, relationships between entities can't be ignored. Said another way, the set of axioms that constitute abstract mathematics may be similar but not identical to the set of physical axioms by which the real, physical universe runs. This suggests that the results from abstract mathematics about infinities may not apply to or should be modified for use in physics. (shrink)

How can different individuals' probability assignments to some events be aggregated into a collective probability assignment? Classic results on this problem assume that the set of relevant events -- the agenda -- is a sigma-algebra and is thus closed under disjunction (union) and conjunction (intersection). We drop this demanding assumption and explore probabilistic opinion pooling on general agendas. One might be interested in the probability of rain and that of an interest-rate increase, but not in the probability of rain (...) or an interest-rate increase. We characterize linear pooling and neutral pooling for general agendas, with classic results as special cases for agendas that are sigma-algebras. As an illustrative application, we also consider probabilistic preference aggregation. Finally, we compare our results with existing results on binary judgment aggregation and Arrovian preference aggregation. This paper is the first of two self-contained, but technically related companion papers inspired by binary judgment-aggregation theory. (shrink)

The iterative conception of set is typically considered to provide the intuitive underpinnings for ZFCU (ZFC+Urelements). It is an easy theorem of ZFCU that all sets have a definite cardinality. But the iterative conception seems to be entirely consistent with the existence of “wide” sets, sets (of, in particular, urelements) that are larger than any cardinal. This paper diagnoses the source of the apparent disconnect here and proposes modifications of the Replacement and Powerset axioms so as to allow for the (...) existence of wide sets. Drawing upon Cantor’s notion of the absolute infinite, the paper argues that the modifications are warranted and preserve a robust iterative conception of set. The resulting theory is proved consistent relative to ZFC + “there exists an inaccessible cardinal number.”. (shrink)

In this paper, I suggest that infinite numbers are large finite numbers, and that infinite numbers, properly understood, are 1) of the structure omega + (omega* + omega)Ө + omega*, and 2) the part is smaller than the whole. I present an explanation of these claims in terms of epistemic limitations. I then consider the importance, part of which is demonstrating the contradiction that lies at the heart of Cantorian set theory: the natural numbers are too large to (...) be counted by any finite number, but too small to be counted by any infinite number – there is no number of natural numbers. (shrink)

Aggregative moral theories face a series of devastating problems when we apply them in a physically realistic setting. According to current physics, our universe is likely _infinitely large_, and will contain infinitely many morally valuable events. But standard aggregative theories are ill-equipped to compare outcomes containing infinite total value so, applied in a realistic setting, they cannot compare any outcomes a real-world agent must ever choose between. This problem has been discussed extensively, and non-standard aggregative theories proposed to overcome (...) it. This paper addresses a further problem of similar severity. Physics tells us that, in our universe, how remotely in time an event occurs is _relative_. But our most promising aggregative theories, designed to compare outcomes containing infinitely many valuable events, are sensitive to how remote in time those events are. As I show, the evaluations of those theories are then relative too. But this is absurd; evaluations of outcomes must be absolute. So we must reject such theories. Is this objection fatal for all aggregative theories, at least in a relativistic universe like ours? I demonstrate here that, by further modifying these theories to fit with the physics, we can overcome it. (shrink)

There is a long-standing debate in epistemology on the structure of justification. Some recent work in formal epistemology promises to shed some new light on that debate. I have in mind here some recent work by David Atkinson and Jeanne Peijnenburg, hereafter “A&P”, on infinite regresses of probabilistic support. A&P show that there are probability distributions defined over an infinite set of propositions {\ such that \ is probabilistically supported by \ for all i and \ has a (...) high probability. Let this result be “APR”. A&P oftentimes write as though they believe that APR runs counter to foundationalism. This makes sense, since there is some prima facie plausibility in the idea that APR runs counter to foundationalism, and since some prominent foundationalists argue for theses inconsistent with APR. I argue, though, that in fact APR does not run counter to foundationalism. I further argue that there is a place in foundationalism for infinite regresses of probabilistic support. (shrink)

It is a consequence of the theory of imprecise credences that there exist situations in which rational agents inevitably become less opinionated toward some propositions as they gather more evidence. The fact that an agent's imprecise credal state can dilate in this way is often treated as a strike against the imprecise approach to inductive inference. Here, we show that dilation is not a mere artifact of this approach by demonstrating that opinion loss is countenanced as rational by a (...) substantially broader class of normative theories than has been previously recognised. Specifically, we show that dilation-like phenomena arise even when one abandons the basic assumption that agents have (precise or imprecise) credences of any kind, and follows directly from bedrock norms for rational comparative confidence judgements of the form `I am at least as confident in p as I am in q'. We then use the comparative confidence framework to develop a novel understanding of what exactly gives rise to dilation-like phenomena. By considering opinion loss in this more general setting, we are able to provide a novel assessment of the prospects for an account of inductive inference that is not saddled with the inevitability of rational opinion loss. (shrink)

We present an abstract social aggregation theorem. Society, and each individual, has a preorder that may be interpreted as expressing values or beliefs. The preorders are allowed to violate both completeness and continuity, and the population is allowed to be infinite. The preorders are only assumed to be represented by functions with values in partially ordered vector spaces, and whose product has convex range. This includes all preorders that satisfy strong independence. Any Pareto indifferent social preorder is then shown (...) to be represented by a linear transformation of the representations of the individual preorders. Further Pareto conditions on the social preorder correspond to positivity conditions on the transformation. When all the Pareto conditions hold and the population is finite, the social preorder is represented by a sum of individual preorder representations. We provide two applications. The first yields an extremely general version of Harsanyi's social aggregation theorem. The second generalizes a classic result about linear opinion pooling. (shrink)

There are many reasons we might want to take the opinions of various individuals and pool them to give the opinions of the group they constitute. If all the individuals in the group have probabilistic opinions about the same propositions, there is a host of pooling functions we might deploy, such as linear or geometric pooling. However, there are also cases where different members of the group assign probabilities to different sets of propositions, which might overlap a lot, a little, (...) or not at all. There are far fewer proposals for how to proceed in these cases, and those there are have undesirable features. I begin by considering four proposals and arguing that they don't work. Then I'll describe my own proposal, which is intended to cover the situation in which we want to pool the individual opinions in order to ascribe an opinion to the group considered as an agent in its own right. (shrink)

In this paper, I introduce an iterative method aimed at exploring numbers within the interval [0, 1]. Beginning with a foundational set, S0, a series of algorithms are employed to expand and refine this set. Each algorithm has its designated role, from incorporating irrational numbers to navigating non-deterministic properties. With each successive iteration, our set grows, and after infinite iterations, its cardinality is proposed to align with that of the real numbers. This work is an initial exploration into this (...) approach, and further investigation is encouraged to understand its full implications and potential. (shrink)

Benardete paradoxes involve a beginningless set each member of which satisfies some predicate just in case no earlier member satisfies it. Such paradoxes have been wielded on behalf of arguments for the impossibility of an infinite past. These arguments often deploy patchwork principles in support of their key linking premise. Here I argue that patchwork principles fail to justify this key premise.

Kant's account of space as an infinite given magnitude in the Critique of Pure Reason is paradoxical, since infinite magnitudes go beyond the limits of possible experience. Michael Friedman's and Charles Parsons's accounts make sense of geometrical construction, but I argue that they do not resolve the paradox. I argue that metaphysical space is based on the ability of the subject to generate distinctly oriented spatial magnitudes of invariant scalar quantity through translation or rotation. The set of determinately (...) oriented, constructed geometrical spaces is a proper subset of metaphysical space, thus, metaphysical space is infinite. Kant's paradoxical doctrine of metaphysical space is necessary to reconcile his empiricism with his transcendental idealism. (shrink)

Throughout history, almost all mathematicians, physicists and philosophers have been of the opinion that space and time are infinitely divisible. That is, it is usually believed that space and time do not consist of atoms, but that any piece of space and time of non-zero size, however small, can itself be divided into still smaller parts. This assumption is included in geometry, as in Euclid, and also in the Euclidean and non- Euclidean geometries used in modern physics. Of the (...) few who have denied that space and time are infinitely divisible, the most notable are the ancient atomists, and Berkeley and Hume. All of these assert not only that space and time might be atomic, but that they must be. Infinite divisibility is, they say, impossible on purely conceptual grounds. (shrink)

The paper addresses an exegetical puzzle that is raised by Kant's distinction between opining (Meinen), believing (Glauben), and knowing (Wissen). In presenting his moral arguments, Kant often points out that belief, as he conceives of it, has a unique feature: it requires non-epistemic justification. Yet Kant's official formulation of the tripartite distinction runs counter to this claim. It describes Belief in terms of a set of two features, each of which also pertains to either opinion or knowledge. My aim (...) in this paper is to propose a novel interpretation of Kant’s distinction which dissolves this exegetical puzzle. (shrink)

Discusses Frege's formal definitions and characterizations of infinite and finite sets. Speculates that Frege might have discovered the "oddity" in Dedekind's famous proof that all infinite sets are Dedekind infinite and, in doing so, stumbled across an axiom of countable choice.

In Lewis reconstructs set theory using mereology and plural quantification (MPQ). In his recontruction he assumes from the beginning that there is an infinite plurality of atoms, whose size is equivalent to that of the set theoretical universe. Since this assumption is far beyond the basic axioms of mereology, it might seem that MPQ do not play any role in order to guarantee the existence of a large infinity of objects. However, we intend to demonstrate that mereology and plural (...) quantification are, in some ways, particularly relevant to a certain conception of the infinite. More precisely, though the principles of mereology and plural quantification do not guarantee the existence of an infinite number of objects, nevertheless, once the existence of any infinite object is admitted, they are able to assure the existence of an uncountable infinity of objects. So, ifMPQ were parts of logic, the implausible consequence would follow that, given a countable infinity of individuals, logic would be able to guarantee an uncountable infinity of objects. (shrink)

Cognitive Set Theory is a mathematical model of cognition which equates sets with concepts, and uses mereological elements. It has a holistic emphasis, as opposed to a reductionistic emphasis, and it therefore begins with a single universe (as opposed to an infinite collection of infinitesimal points).

A new computational methodology for executing calculations with infinite and infinitesimal quantities is described in this paper. It is based on the principle ‘The part is less than the whole’ introduced by Ancient Greeks and applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). It is shown that it becomes possible to write down finite, infinite, and infinitesimal numbers by a finite number of symbols as particular cases of (...) a unique framework. The new methodology has allowed us to introduce the Infinity Computer working with such numbers (its simulator has already been realized). Examples dealing with divergent series, infinite sets, and limits are given. (shrink)

Merging of opinions results underwrite Bayesian rejoinders to complaints about the subjective nature of personal probability. Such results establish that sufficiently similar priors achieve consensus in the long run when fed the same increasing stream of evidence. Initial subjectivity, the line goes, is of mere transient significance, giving way to intersubjective agreement eventually. Here, we establish a merging result for sets of probability measures that are updated by Jeffrey conditioning. This generalizes a number of different merging results in the literature. (...) We also show that such sets converge to a shared, maximally informed opinion. Convergence to a maximally informed opinion is a (weak) Jeffrey conditioning analogue of Bayesian “convergence to the truth” for conditional probabilities. Finally, we demonstrate the philosophical significance of our study by detailing applications to the topics of dynamic coherence, imprecise probabilities, and probabilistic opinion pooling. (shrink)

A contradiction is obtained, considering the axiom of infinity, then ℕ and Peano axioms, together a list of ℕ subsets and with inclusion relation and union operation. Natural numbers constitute an infinite set, ℕ, but we show the union of its proper subsets, with a specific form, isn’t an infinite set. Also we get a simpler explanation and a symbolic representation. Lastly, inconsistency of Peano successor axiom is a consequence of rejecting infinity.

Ruwet observed that subjunctives indicate a discontinuity between action and will, typically resulting in a disjoint reference effect known as obviation (unacceptable "Je veux que je parte"). In a certain set of cases, however, the attitude-holder can felicitously bind the pronominal subject of the subjunctive clause (exemption from obviation). This seminar handout examines the phenomenon in Hungarian, with additional data from Russian, Polish, and Romanian.

The Overgeneration Argument is a prominent objection against the model-theoretic account of logical consequence for second-order languages. In previous work we have offered a reconstruction of this argument which locates its source in the conflict between the neutrality of second-order logic and its alleged entanglement with mathematics. Some cases of this conflict concern small large cardinals. In this article, we show that in these cases the conflict can be resolved by moving from a set-theoretic implementation of the model-theoretic account to (...) one which uses higher-order resources. (shrink)

ABSTRACT Theories of sets such as Zermelo Fraenkel set theory are usually presented as the combination of two distinct kinds of principles: logical and set-theoretic principles. The set-theoretic principles are imposed ‘on top’ of first-order logic. This is in agreement with a traditional view of logic as universally applicable and topic neutral. Such a view of logic has been rejected by the intuitionists, on the ground that quantification over infinite domains requires the use of intuitionistic rather than classical logic. (...) In the following, I consider constructive set theories, which use intuitionistic rather than classical logic, and argue that they manifest a distinctive interdependence or an entanglement between sets and logic. In fact, Martin-Löf type theory identifies fundamental logical and set-theoretic notions. Remarkably, one of the motivations for this identification is the thought that classical quantification over infinite domains is problematic, while intuitionistic quantification is not. The approach to quantification adopted in Martin-Löf’s type theory is subtly interconnected with its predicativity. I conclude by recalling key aspects of an approach to predicativity inspired by Poincaré, which focuses on the issue of correct quantification over infinite domains and relate it back to Martin-Löf type theory. (shrink)

Non-well-founded set theories allow set-theoretic exotica that standard ZFC will not allow, such as a set that has itself as its sole member. We can distinguish plenitudinous non-well-founded set theories, such as Boffa set theory, that allow infinitely many such sets, from restrictive theories, such as Finsler-Aczel or AFA, that allow exactly one. Plenitudinous non-well-founded set theories face a puzzle: nothing seems to explain the identity or distinctness of various of the sets they countenance. In this paper I aim to (...) sharpen this puzzle, make clear who it does and does not apply to and, ultimately, to argue in favor of a plenitudinous theory like Boffa. (shrink)

In this paper paraconsistent first-order logic LP^{#} with infinite hierarchy levels of contradiction is proposed. Corresponding paraconsistent set theory KSth^{#} is discussed.Axiomatical system HST^{#}as paraconsistent generalization of Hrbacek set theory HST is considered.

For the past few years in the United States, almost daily there’s a headline about new proposed abortions restrictions. Conservatives cheer, liberals despair. But who is right here? Should abortion be generally legal or should it be banned? Is it usually immoral or is it usually not wrong at all? These same questions, of course, are asked in other countries. To many people, answers to these questions seem obvious, and people with different or contrary answers are, well, just wrong. But (...) how can we know? In particular, could anyone know that abortion is not wrong and should be legal? If so, how? And how would anyone effectively, persuasively, communicate that knowledge? One important set of answers depends on this idea: critical thinking. Critical thinking can help people know, not merely believe or feel, that their perspectives on issues are true or correct, and it can help them persuade others to understand and accept that knowledge. We are philosophy professors who teach courses in critical thinking and its applications to ethical, political, scientific, and legal issues. In our 2019 open-access book, Thinking Critically About Abortion: Why Most Abortions Aren’t Wrong & Why All Abortions Should be Legal, we apply well-confirmed methods of critical thinking to the most discussed arguments about abortion. Critical thinking can be operationalized as skills. Three key critical thinking skills involve defining words, identifying the structures of arguments, and evaluating explanations. Understanding these and other critical thinking skills can only help improve conversations and advocacy about abortion. Let’s see them in action. (shrink)

The quantum information introduced by quantum mechanics is equivalent to a certain generalization of classical information: from finite to infinite series or collections. The quantity of information is the quantity of choices measured in the units of elementary choice. The “qubit”, can be interpreted as that generalization of “bit”, which is a choice among a continuum of alternatives. The axiom of choice is necessary for quantum information. The coherent state is transformed into a well-ordered series of results in time (...) after measurement. The quantity of quantum information is the transfinite ordinal number corresponding to the infinity series in question. The transfinite ordinal numbers can be defined as ambiguously corresponding “transfinite natural numbers” generalizing the natural numbers of Peano arithmetic to “Hilbert arithmetic” allowing for the unification of the foundations of mathematics and quantum mechanics. (shrink)

In the late 1940s and early 1950s Lorenzen developed his operative logic and mathematics, a form of constructive mathematics. Nowadays this is mostly seen as the precursor to the more well-known dialogical logic and one could assumed that the same philosophical motivations were present in both works. However we want to show that this is not always the case. In particular, we claim, that Lorenzen’s well-known rejection of the actual infinite as stated in Lorenzen (1957) was not a major (...) motivation for operative logic and mathematics. In this article, we claim that this is in fact not the case. Rather, we argue for a shift that happened in Lorenzen’s treatment of the infinite from the early to the late 1950s. His early motivation for the development of operativism is concerned with a critique of the Cantorian notion of set and related questions about the notion of countability and uncountability; only later, his motivation switches to focusing on the concept of infinity and the debate about actual and potential infinity. (shrink)

It has been the expressed desire of many educational or research organizations/institutions to create and have a functional and recognized indexed academic journal. This short academic opinion gives an introduction to what an academic journal is and is not, and some essential steps to take to create and maintain a functional and recognized indexed academic journal. It is concluded that every educational or research organization/institution that has not had a functional and recognized indexed academic journal should not only crave (...) but also start the process of having one by following the highlighted steps. (shrink)

A new computational methodology allowing one to work in a new way with infinities and infinitesimals is presented in this paper. The new approach, among other things, gives the possibility to calculate the number of elements of certain infinite sets, avoids indeterminate forms and various kinds of divergences. This methodology has been used by the author as a starting point in developing a new kind of computer – the Infinity Computer – able to execute computations and to store in (...) its memory not only finite numbers but also infinite and infinitesimal ones. (shrink)

Bayesians often appeal to “merging of opinions” to rebut charges of excessive subjectivity. But what happens in the short run is often of greater interest than what happens in the limit. Seidenfeld and coauthors use this observation as motivation for investigating the counterintuitive short run phenomenon of dilation, since, they allege, dilation is “the opposite” of asymptotic merging of opinions. The measure of uncertainty relevant for dilation, however, is not the one relevant for merging of opinions. We explicitly investigate the (...) short run behavior of the metric relevant for merging, and show that dilation is independent of the opposite of merging. (shrink)

Let f(1)=2, f(2)=4, and let f(n+1)=f(n)! for every integer n≥2. Edmund Landau's conjecture states that the set P(n^2+1) of primes of the form n^2+1 is infinite. Landau's conjecture implies the following unproven statement Φ: card(P(n^2+1))<ω ⇒ P(n^2+1)⊆[2,f(7)]. Let B denote the system of equations: {x_j!=x_k: i,k∈{1,...,9}}∪{x_i⋅x_j=x_k: i,j,k∈{1,...,9}}. The system of equations {x_1!=x_1, x_1 \cdot x_1=x_2, x_2!=x_3, x_3!=x_4, x_4!=x_5, x_5!=x_6, x_6!=x_7, x_7!=x_8, x_8!=x_9} has exactly two solutions in positive integers x_1,...,x_9, namely (1,...,1) and (f(1),...,f(9)). No known system S⊆B with a (...) finite number of solutions in positive integers x_1,...,x_9 has a solution (x_1,...,x_9)∈(N\{0})^9 satisfying max(x_1,...,x_9)>f(9). For every known system S⊆B, if the finiteness/infiniteness of the set {(x_1,...,x_9)∈(N\{0})^9: (x_1,...,x_9) solves S} is unknown, then the statement ∃ x_1,...,x_9∈N\{0} ((x_1,...,x_9) solves S)∧(max(x_1,...,x_9)>f(9)) remains unproven. Let Λ denote the statement: if the system of equations {x_2!=x_3, x_3!=x_4, x_5!=x_6, x_8!=x_9, x_1 \cdot x_1=x_2, x_3 \cdot x_5=x_6, x_4 \cdot x_8=x_9, x_5 \cdot x_7=x_8} has at most finitely many solutions in positive integers x_1,...,x_9, then each such solution (x_1,...,x_9) satisfies x_1,...,x_9≤f(9). The statement Λ is equivalent to the statement Φ. It heuristically justifies the statement Φ . This justification does not yield the finiteness/infiniteness of P(n^2+1). We present a new heuristic argument for the infiniteness of P(n^2+1), which is not based on the statement Φ. Algorithms always terminate. We explain the distinction between existing algorithms (i.e. algorithms whose existence is provable in ZFC) and known algorithms (i.e. algorithms whose definition is constructive and currently known). Assuming that the infiniteness of a set X⊆N is false or unproven, we define which elements of X are classified as known. No known set X⊆N satisfies Conditions (1)-(4) and is widely known in number theory or naturally defined, where this term has only informal meaning. *** (1) A known algorithm with no input returns an integer n satisfying card(X)<ω ⇒ X⊆(-∞,n]. (2) A known algorithm for every k∈N decides whether or not k∈X. (3) No known algorithm with no input returns the logical value of the statement card(X)=ω. (4) There are many elements of X and it is conjectured, though so far unproven, that X is infinite. (5) X is naturally defined. The infiniteness of X is false or unproven. X has the simplest definition among known sets Y⊆N with the same set of known elements. *** Conditions (2)-(5) hold for X=P(n^2+1). The statement Φ implies Condition (1) for X=P(n^2+1). The set X={n∈N: the interval [-1,n] contains more than 29.5+\frac{11!}{3n+1}⋅sin(n) primes of the form k!+1} satisfies Conditions (1)-(5) except the requirement that X is naturally defined. 501893∈X. Condition (1) holds with n=501893. card(X∩[0,501893])=159827. X∩[501894,∞)= {n∈N: the interval [-1,n] contains at least 30 primes of the form k!+1}. We present a table that shows satisfiable conjunctions of the form #(Condition 1) ∧ (Condition 2) ∧ #(Condition 3) ∧ (Condition 4) ∧ #(Condition 5), where # denotes the negation ¬ or the absence of any symbol. No set X⊆N will satisfy Conditions (1)-(4) forever, if for every algorithm with no input, at some future day, a computer will be able to execute this algorithm in 1 second or less. The physical limits of computation disprove this assumption. (shrink)

This study examines how evidence is used differently in argumentative discourse compared to individual arguments. Applying a 1×2 crossover study design, 37 secondary school students were asked either to discuss a social issue with their partner before individually writing an essay outlining their opinion or, vice versa, first to discuss and then to write. As background information, they were provided with pieces of evidence with different levels of quality. Dialogs and essays were analyzed regarding (a) the type of evidence (...) and (b) the way evidence was used. Results showed that in their essays students referred more often to the pieces of evidence provided to them (shared evidence). In contrast, they used evidence more often to address the opposing viewpoint in dialogs by incorporating it in a more elaborated (clearer) line of reasoning. Findings suggest that dialogues are a more effective tool than individual writing production, and the study provides first hints regarding how to design curricula that will encourage students to use evidence in a more sophisticated way in their argumentation. (shrink)

In order to explain Wittgenstein’s account of the reality of completed infinity in mathematics, a brief overview of Cantor’s initial injection of the idea into set- theory, its trajectory and the philosophic implications he attributed to it will be presented. Subsequently, we will first expound Wittgenstein’s grammatical critique of the use of the term ‘infinity’ in common parlance and its conversion into a notion of an actually existing infinite ‘set’. Secondly, we will delve into Wittgenstein’s technical critique of the (...) concept of ‘denumerability’ as it is presented in set theory as well as his philosophic refutation of Cantor’s Diagonal Argument and the implications of such a refutation onto the problems of the Continuum Hypothesis and Cantor’s Theorem. Throughout, the discussion will be placed within the historical and philosophical framework of the Grundlagenkrise der Mathematik and Hilbert’s problems. (shrink)

Rare diseases pose a particular priority setting problem. The UK gives rare diseases special priority in healthcare priority setting. Effectively, the National Health Service is willing to pay much more to gain a quality-adjusted life-year related to a very rare disease than one related to a more common condition. But should rare diseases receive priority in the allocation of scarce healthcare resources? This article develops and evaluates four arguments in favour of such a priority. These pertain to public values, luck (...) egalitarian distributive justice the epistemic difficulties of obtaining knowledge about rare diseases and the incentives created by a higher willingness to pay. The first is at odds with our knowledge regarding popular opinion. The three other arguments may provide a reason to fund rare diseases generously. However, they are either overinclusive because they would also justify funding for many non-rare diseases or underinclusive in the sense of justifying priority for only some rare diseases. The arguments thus fail to provide a justification that tracks rareness as such. There are no data in this work. (shrink)

We report the results of an exploratory study that examines the judgments of climate scientists, climate policy experts, astrophysicists, and non-experts (N = 3367) about the factors that contribute to the creation and persistence of disagreement within climate science and astrophysics and about how one should respond to expert disagreement. We found that, as compared to non-experts, climate experts believe that within climate science (i) there is less disagreement about climate change, (ii) methodological factors play less of a role in (...) generating disagreements, (iii) fewer personal or institutional biases influence climate research, and (iv) there is more agreement about which methods should be used to examine relevant phenomena we also observed that the uniquely American political context predicted experts’ judgments about some of these factors. We also found that, in regard to disagreements concerning cosmic ray physics, and commensurate with the greater inherent uncertainty and data lacunae in their field, astrophysicists working on cosmic rays were generally more willing to acknowledge expert disagreement, more open to the idea that a set of data can have multiple valid interpretations, and generally less quick to dismiss someone articulating a non-standard view as non-expert, than climate scientists were in regard to climate science. (shrink)

The concepts of choice, negation, and infinity are considered jointly. The link is the quantity of information interpreted as the quantity of choices measured in units of elementary choice: a bit is an elementary choice between two equally probable alternatives. “Negation” supposes a choice between it and confirmation. Thus quantity of information can be also interpreted as quantity of negations. The disjunctive choice between confirmation and negation as to infinity can be chosen or not in turn: This corresponds to set-theory (...) or intuitionist approach to the foundation of mathematics and to Peano or Heyting arithmetic. Quantum mechanics can be reformulated in terms of information introducing the concept and quantity of quantum information. A qubit can be equivalently interpreted as that generalization of “bit” where the choice is among an infinite set or series of alternatives. The complex Hilbert space can be represented as both series of qubits and value of quantum information. The complex Hilbert space is that generalization of Peano arithmetic where any natural number is substituted by a qubit. “Negation”, “choice”, and “infinity” can be inherently linked to each other both in the foundation of mathematics and quantum mechanics by the meditation of “information” and “quantum information”. (shrink)

A recently developed computational methodology for executing numerical calculations with infinities and infinitesimals is described in this paper. The approach developed has a pronounced applied character and is based on the principle “The part is less than the whole” introduced by the ancient Greeks. This principle is applied to all numbers (finite, infinite, and infinitesimal) and to all sets and processes (finite and infinite). The point of view on infinities and infinitesimals (and in general, on Mathematics) presented in (...) this paper uses strongly physical ideas emphasizing interrelations that hold between a mathematical object under observation and the tools used for this observation. It is shown how a new numeral system allowing one to express different infinite and infinitesimal quantities in a unique framework can be used for theoretical and computational purposes. Numerous examples dealing with infinite sets, divergent series, limits, and probability theory are given. (shrink)

Are there different sizes of infinity? That is, are there infinite sets of different sizes? This is one of the most natural questions that one can ask about the infinite. But it is of course generally taken to be settled by mathematical results, such as Cantor’s theorem, to the effect that there are infinite sets without bijections between them. These results settle the question, given an almost universally accepted principle relating size to the existence of functions. The (...) principle is: for any sets A and B, if A is the same size as B, then there is a bijection from A to B. The aim of the paper, however, is to argue that this question is in fact wide open: to argue that we are not in a position to know the answer, because we are not in one to know the principle. The aim, that is, is to argue that for all we know there is only one size of infinity. (shrink)

It is well known that the set of algebraic numbers (let us call it A) is countable. In this paper, instead of the usage of the classical terminology of cardinals proposed by Cantor, a recently introduced methodology using ①-based infinite numbers is applied to measure the set A (where the number ① is called grossone). Our interest to this methodology is explained by the fact that in certain cases where cardinals allow one to say only whether a set is (...) countable or it has the cardinality of the continuum, the ①-based methodology can provide a more accurate measurement of infinite sets. In this article, lower and upper estimates of the number of elements of A are obtained. Both estimates are expressed in ①-based numbers. (shrink)

This paper presents a uniform general account of regress problems in the form of a pentalemma—i.e., a set of five mutually inconsistent claims. Specific regress problems can be analyzed as instances of such a general schema, and this Regress Pentalemma Schema can be employed to generate deductively valid arguments from the truth of a subset of four claims to the falsity of the fifth. Thus, a uniform account of the nature of regress problems allows for an improved understanding of specific (...) regress objections or arguments, and, correspondingly, of the general logical geography of the debate about infinite regresses. This uniform approach is illustrated by a treatment of the classical epistemological problem of justification, but it encompasses a whole variety of cases including explanation and ontological grounding. Furthermore, this general account is compared and contrasted with the existing literature discussing argument schemata for regress objections, particularly with the work of Jan Willem Wieland. It is shown how such other schemata can be incorporated and superseded by the general Regress Pentalemma Schema. (shrink)

Ortega y Gasset is known for his philosophy of life and his effort to propose an alternative to both realism and idealism. The goal of this article is to focus on an unfamiliar aspect of his thought. The focus will be given to Ortega’s interpretation of the advancements in modern mathematics in general and Cantor’s theory of transfinite numbers in particular. The main argument is that Ortega acknowledged the historical importance of the Cantor’s Set Theory, analyzed it and articulated a (...) response to it. In his writings he referred many times to the advancements in modern mathematics and argued that mathematics should be based on the intuition of counting. In response to Cantor’s mathematics Ortega presented what he defined as an ‘absolute positivism’. In this theory he did not mean to naturalize cognition or to follow the guidelines of the Comte’s positivism, on the contrary. His aim was to present an alternative to Cantor’s mathematics by claiming that mathematicians are allowed to deal only with objects that are immediately present and observable to intuition. Ortega argued that the infinite set cannot be present to the intuition and therefore there is no use to differentiate between cardinals of different infinite sets. (shrink)

The Turing machine is one of the simple abstract computational devices that can be used to investigate the limits of computability. In this paper, they are considered from several points of view that emphasize the importance and the relativity of mathematical languages used to describe the Turing machines. A deep investigation is performed on the interrelations between mechanical computations and their mathematical descriptions emerging when a human (the researcher) starts to describe a Turing machine (the object of the study) by (...) different mathematical languages (the instruments of investigation). Together with traditional mathematical languages using such concepts as ‘enumerable sets’ and ‘continuum’ a new computational methodology allowing one to measure the number of elements of different infinite sets is used in this paper. It is shown how mathematical languages used to describe the machines limit our possibilities to observe them. In particular, notions of observable deterministic and non-deterministic Turing machines are introduced and conditions ensuring that the latter can be simulated by the former are established. (shrink)

Gödel’s philosophical conceptions bear striking similarities to Cantor’s. Although there is no conclusive evidence that Gödel deliberately used or adhered to Cantor’s views, one can successfully reconstruct and see his “Cantorianism” at work in many parts of his thought. In this paper, I aim to describe the most prominent conceptual intersections between Cantor’s and Gödel’s thought, particularly on such matters as the nature and existence of mathematical entities (sets), concepts, Platonism, the Absolute Infinite, the progress and inexhaustibility of mathematics.