The best accuracy arguments for probabilism apply only to credence functions with finite domains, that is, credence functions that assign credence to at most finitely many propositions. This is a significant limitation. It reveals that the support for the accuracy-first program in epistemology is a lot weaker than it seems at first glance, and it means that accuracy arguments cannot yet accomplish everything that their competitors, the pragmatic (Dutch book) arguments, can. In this paper, I investigate the extent to (...) which this limitation can be overcome. Building on the best arguments in finite domains, I present two accuracy arguments for probabilism that are perfectly general—they apply to credence functions with arbitrary domains. I then discuss how the arguments’ premises can be challenged. We will see that it is particularly difficult to characterize admissible accuracy measures in infinite domains. (shrink)

Recent years have witnessed a proliferation of attempts to apply the mathematical theory of probability to the semantics of natural language probability talk. These sorts of “probabilistic” semantics are often motivated by their ability to explain intuitions about inferences involving “likely” and “probably”—intuitions that Angelika Kratzer’s canonical semantics fails to accommodate through a semantics based solely on an ordering of worlds and a qualitative ranking of propositions. However, recent work by Wesley Holliday and Thomas Icard has been widely thought to (...) undercut this motivation: they present a world-ordering semantics that yields essentially the same logic as probabilistic semantics. In this paper, I argue that the challenge remains: defenders of world-ordering semantics have yet to offer a plausible semantics that captures the logic of comparative likelihood. Holliday & Icard’s semantics yields an adequate logic only if models are restricted to Noetherian pre-orders. But I argue that the Noetherian restriction faces problems in cases involving infinitely large domains of epistemic possibilities. As a result, probabilistic semantics remains the better explanation of the data. (shrink)

Argument-forms exist which are valid over finite but not infinite domains. Despite understanding of this by formal logicians, philosophers can be observed treating as valid arguments which are in fact invalid over infinite domains. In support of this claim I will first present an argument against the classical pragmatist theory of truth by Mark Johnston. Then, more ambitiously, I will suggest the fallacy lurks in certain arguments for physicalism taken for granted by many philosophers today.

Scoring rules measure the accuracy or epistemic utility of a credence assignment. A significant literature uses plausible conditions on scoring rules on finite sample spaces to argue for both probabilism—the doctrine that credences ought to satisfy the axioms of probabilism—and for the optimality of Bayesian update as a response to evidence. I prove a number of formal results regarding scoring rules on infinite sample spaces that impact the extension of these arguments to infinite sample spaces. A common condition (...) in the arguments for probabilism and Bayesian update is strict propriety: that according to each probabilistic credence, the expected accuracy of any other credence is worse. Much of the discussion needs to divide depending on whether we require finite or countable additivity of our probabilities. I show that in a number of natural infinite finitely additive cases, there simply do not exist strictly proper scoring rules, and the prospects for arguments for probabilism and Bayesian update are limited. In many natural infinite countably additive cases, on the other hand, there do exist strictly proper scoring rules that are continuous on the probabilities, and which support arguments for Bayesian update, but which do not support arguments for probabilism. There may be more hope for accuracy-based arguments if we drop the assumption that scores are extended-real-valued. I sketch a framework for scoring rules whose values are nets of extended reals, and show the existence of a strictly proper net-valued scoring rules in all infinite cases, both for f.a. and c.a. probabilities. These can be used in an argument for Bayesian update, but it is not at present known what is to be said about probabilism in this case. (shrink)

This book on infinite regress arguments provides (i) an up-to-date overview of the literature on the topic, (ii) ready-to-use insights for all domains of philosophy, and (iii) two case studies to illustrate these insights in some detail. Infinite regress arguments play an important role in all domains of philosophy. There are infinite regresses of reasons, obligations, rules, and disputes, and all are supposed to have their own moral. Yet most of them are involved in controversy. (...) Hence the question is: what exactly is an infinite regress argument, and when is such an argument a good one? (shrink)

Infinite regress arguments are a powerful tool in Aristotle, but this style of argument has received relatively little attention. Improving our understanding of infinite regress arguments has become pressing since recent scholars have pointed out that it is not clear whether Aristotle’s infinite regress arguments are, in general, effective or indeed what the logical structure of these arguments is. One obvious approach would be to hold that Aristotle takes infinite regress arguments to be per impossibile arguments, (...) which derive an infinite sequence. Due to his finitism, Aristotle then rejects such a sequence as impossible. This paper argues that this obvious approach does not work, even for its most amenable cases. The paper argues instead that infinite regress arguments involve domain-specific infinities, and so there is not a general finitism which underpins infinite regress arguments in Aristotle, but rather domain-specific reasons that there cannot be an infinite number of entities in each domain in which Aristotle invokes an infinite regress argument. (shrink)

In 2002 Coecke and Martin (Research Report PRG-RR-02-07, Oxford University Computing Laboratory, 2002) created a model for the finite classical and quantum states in physics. This model is based on a type of ordered set which is standard in the study of information systems. It allows the information content of its elements to be compared and measured. Their work is extended to a model for the infinite classical states. These are the states which result when an observable is applied (...) to a quantum system. When this extended order is restricted to a finite number of coordinates, the model of Coecke and Martin is obtained. The infinite model retains many desirable aspects of the finite model, such as pure states as maximal elements and expected behavior of thermodynamic entropy. But it looses some of the important domain theoretic aspects, such as having a least element and exactness. Shannon entropy is no longer defined over the entire model and both it and thermodynamic entropy cease to be a measurements in the sense of Martin. (shrink)

The basic thesis is that the problem of infinity underlies the current dilemma in modern theoretical physics. The traditional and set-theoretic conceptions of infinity are considered. It is demonstrated that standard mathematical analysis is dependent on the complete relativity of the infinite. In examining the domains of modern physics, infinity is found to lose its entirely relative character and, therefore, to be less amenable to classical analysis. Complementary aspects of microworld infinity are identified and are associated with the (...) equivalent features (inertial and gravitational mass) of Einstein's macroworld theory. The persisting effort to treat essentially non-classical phenomena in classical terms is critically discussed. A new attitude toward the infinite is recommended, one that might lead to establishing a second principle of the relativity of the infinite. The prospect for implementing the suggested approach through a "trans-analytic" meta-theory of dimensional generation is briefly entertained. (shrink)

The satisfiability problem for the two-variable fragment of first-order logic is investigated over finite and infinite linearly ordered, respectively wellordered domains, as well as over finite and infinite domains in which one or several designated binary predicates are interpreted as arbitrary wellfounded relations. It is shown that FO 2 over ordered, respectively wellordered, domains or in the presence of one well-founded relation, is decidable for satisfiability as well as for finite satisfiability. Actually the complexity of (...) these decision problems is essentially the same as for plain unconstrained FO 2 , namely non-deterministic exponential time. In contrast FO 2 becomes undecidable for satisfiability and for finite satisfiability, if a sufficiently large number of predicates are required to be interpreted as orderings, wellorderings, or as arbitrary wellfounded relations. This undecidability result also entails the undecidability of the natural common extension of FO 2 and computation tree logic CTL. (shrink)

We consider the theoryT IT of infinite terms. The axioms for the theoryT IT are analogous to the Mal'cev's axioms for the theoryT IT of finite terms whose models are the locally free algebras. Recently Maher [Ma] has proved that the theoryT IT in a finite non singular signature plus the Domain Closure Axiom is complete. We give a description of all the complete extension ofT IT from which an effective decision procedure forT IT is obtained. Our approach considers (...) formulas built up with syntactic terms containing pointers. Using such a technique, the analysis of the theoryT IT can be carried out in analogy with Mal'cev's analysis ofT FT. Our results follow from an effective quantifier elimination procedure for formulas with pointers. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:THE ACTUAL INFINITE IN ARISTOTLE Prolegomena: Philosophy and Theology Related HENEVER PHILOSOPHY is taken to be the handmaiden of theology, then the autonomy of reason is destroyed." Such a daim should be distinguished from a still 1stronger thesis. Compare: " A philosopher may not legitimately try to fortify an argument by bringing in new premises from another discipline which has a special aura of authority." Quite how Aristotle (...) would have reacted to the first generalization, if it had been suitably translated for his scrutiny, is a question on which commentators might agree to differ. But Aristotle would have been as!'eluctant as Aquinas, or Maimonides, or later Monotheists who treasured the Physics, to leave the second general claim unquestioned. Natural and revealed theology, like physics or mathematics, are domains where extremely subtle reasoner1s have studied and published widely for a very long time. So an elementary respect for induction suggests that philosophers should e:x;pect to benefit from,applying some premises and some ways of arguing, which are found in theology, to their own issues. I speak of premises and ways of arguing that philosophers qua philosophers have not provided before. Thinkers in all four disciplines could thus profit from each body of work. Even the law of averages is set pitilessly against the second general claim.1 1 The late Father F. C. Copleston, S.J., covers many important topics regarding theology and philosophy in Aquinets (Baltimore: Peng11in, 1955), pp. 12-14, 19, 54-63, 65-68, 74, 116, etc. But the point put forward here about human power to strengthen intuition in one field seems to be partly missed. Copleston also fails to dwell enough on infinity in various passages. See John King-Farlow, "The First ·way in Physical and Moral Space", The Thomist 427 428 JOHN KING-FARLOW By focussing on some arguments of Aristotle's against the admissibility of an,actual infinite, we shall find deeper, less obvims reasons for rejecting that second claim. Other philosophical points of intrinsic value should emerge as well foom the short investigation. But this one is especially interesting because of its curious pertinence to perennial disagreements among those who address the relations of theology, theism and philosophy. At any rate, the search for such deeper reasons will involve the application to Aristotle's texts of a somewhat modern way of using the term " intuition ". Introduotion: A Relevant Kind of Intuitive Thinking Diss,atisfaction with modern Platonism in higher mathematics may be added to disenchantment with Platonism's modern opponents. Such opposition may seem too technical for issues of intuition or, indeed, of common reason. And so one is led back to consider certain rightly famous arguments of Aristotle. But before turning to Aristotle and his grapplings with ideais and claims about an actual infinity, let us 1ook at a few very ordinary uses of the sometimes charismatic word "intuition." Webster's Dictionary (1978) offers: "immediate and instinctive perception of a truth; direct understanding without reasoning." In his classic study Evolution of JJ;Jathematieal Concepts, Wilder writes at least once in the spirit of Webster: "Counting with fingers (and toes) clearly involves intuitive recognition of (1-1)-correspontreme, excessive gene:msity, and, next, irion unwillingness to give ·anything to others, lies usually much closer to the first extreme. Between utter recklessness and self-paralyzing caution the Mean may oscillate in relative distance, according to the demands of the context. Near recklessness may offer the only means to win one kind of battle and a stubborn refusal to move may be needed for the nex>t victory. By pursuing such a nonmechanical and variably positioned ideal of a Mean, a really wise father usually oould show special favor to one specially deserving child in some ways and some contexts, yet generally show very satisfying love to a;ll his children. 11 Richard Bosley, " What Is a Mean? The Question Considered Compara· tively and Systematically." PhiloB. (shrink)

The great mathematician, physicist, and philosopher, Hermann Weyl, once called mathematics the “science of the infinite.” This is a fitting title: contemporary mathematics—especially Cantorian set theory—provides us with marvelous ways of taming and clarifying the infinite. Nonetheless, I believe that the epistemic significance of mathematical infinity remains poorly understood. This dissertation investigates the role of the infinite in three diverse areas of study: number theory, cosmology, and probability theory. A discovery that emerges from my work is that (...) the epistemic role of the infinite varies, often in surprising ways, across different domains of knowledge. -/- My first chapter examines the role of mathematical infinity in number theory. It is reasonable to think that theorems concerning finite patterns and structures in the natural numbers are particularly “simple” or “elementary.” Indeed, such statements are comprehensible to a wide range of investigators, regardless of their mathematical training. One might then expect proofs of these theorems to be similarly comprehensible. However, many proofs, especially those that utilize only finitary methods, are exceedingly difficult to understand. Consequently, one finds that finitary theorems are often re-proved using infinitary techniques. My claim is that this is because infinitary proofs are often explanatory, while finitary proofs are not. This chapter analyzes why this is the case. Along the way, I investigate other questions of long-standing interest in the philosophy of mathematics, e.g., the role of purity/impurity ascriptions and the nature of the content of a theorem. In particular, I diagnose the explanatory potential of the infinite by articulating a new construal of content. This new construal both saves intuitive epistemic ascriptions made in mathematical practice and explains the unexpected role of the infinite in providing explanatory proofs of finitary statements. Thus, in number theory, my claim is that the infinite often plays an explanatory role. -/- My second chapter turns to the role of the infinite in cosmology. It investigates a question much discussed by philosophers and physicists alike: is the spatial extent of the universe finite or infinite? Contemporary cosmological research has indicated that one of the essential determinants of the extent of the universe is the topology we ascribe to space. Topology is a global property, which may suggest that it is not testable through local observation. Nonetheless, some cosmologists have indicated that it may be empirically detected, thereby providing an answer to the question of spatial extent. I argue that, in fact, the epistemic status of the topology of space is extremely subtle and not well captured by any of the categories commonly employed by philosophers of science. In particular, I argue that topological properties are neither empirical nor a priori (even in suitably weakened senses). Furthermore, I claim that we should prefer topological properties that generate finite universe models (consistent with our best data) in order to avoid extremely thorny issues concerning the physics of an infinite universe. I argue for such a preference on the grounds of the simplicity and explanatory power of finite universe models. Thus, in cosmology, my claim is that the finite often plays an explanatory and simplifying role. -/- My third chapter investigates several paradoxes that arise in the foundations of infinitary probability theory: the Label Invariance Paradox, God’s Lottery, and Bertrand’s Paradox. I argue that these have been poorly understood because they do not expressly concern probability theory, but rather our intuitions about—and formal techniques for dealing with— infinite sets. The paradoxes in question are, in fact, symptoms of our complete reliance upon Cantorian cardinality and its associated criterion of sameness of “size.” That is, two sets have the same cardinality if and only if the elements of the sets can be placed in 1-1 correspondence. When applied to infinite sets, this criterion produces counterintuitive verdicts. For instance, given a fair lottery on the natural numbers, we expect that the probability of drawing an even number is 1/2, and likewise for drawing an odd number. However, one can construct “relabellings” of the naturals such that the probability of drawing an even number remains 1/2, while the probability for drawing an odd number becomes 1/4. I argue that, ultimately, it is the coarseness of Cantorian cardinality that generates the probabilistic paradoxes. I then propose that finer-grained measures of infinite sets from mathematical logic and number theory can help to dissolve the paradoxes in question. Thus, in probability theory, we find that particular kinds of infinitary techniques effectively systematize our theory, while others lead to paradox. (shrink)

Central to Levinas’ “phenomenological” approach to ethics is his identification of an “infinite signification” in the human face. This insistence on the appearance of an infinitely signifying phenomenon has led many, notably Dominique Janicaud, to decry Levinas’ work as anti-phenomenological: little more than a novel approach to metaphysics. A significant element of the phenomenological revolution, Janicaud insists, referencing Husserl and the early Heidegger for support, is grounded in the recognition that phenomena arise in and are circumscribed by finitude. Any (...) reference to an infinite phenomenon which breaks with apperception, he therefore concludes, necessarily breaks as well with the phenomenological tradition, signaling a reversion to idealism, metaphysics, and ultimately theology. As this paper will argue however, a close reading of Husserl reveals not only the recognition of infinite phenomena; but, more significantly, the possibility that all phenomena are potentially infinite. This means that in many ways Levinas is not only more faithful to Husserl’s project than is often admitted; but moreover, that Levinas’ work serves as a lens through which a hitherto under-emphasized element of Husserl’s work can be examined – an element which challenges the traditional critique of Levinas. What’s more, the possibility of infinite phenomena opened up in Husserl’s work, when read through Levinas’ analysis of the ethical significance of the infinite, creates the possibility of recognizing the potential ethical value of all objects, and not merely one object in particular: the human face. This possibility, as I will show, contributes to further blurring the already ambiguous distinction within Levinas between “good” and “bad” infinities – a blurring which, as I will argue, serves as a powerful heuristic in interpreting certain human pathologies, from obsessive compulsive disorder and certain forms of schizophrenia, to the temptation of evil. In this way, an analysis of the status of the infinite in Husserl and Levinas provides a purely phenomenological ground for exploring issues traditionally seen as the exclusive domain of metaphysics and theology. (shrink)

In papers published between 1930 and 1935. Zermelo outlines a foundational program, with infinitary logic at its heart, that is intended to (1) secure axiomatic set theory as a foundation for arithmetic and analysis and (2) show that all mathematical propositions are decidable. Zermelo's theory of systems of infinitely long propositions may be termed "Cantorian" in that a logical distinction between open and closed domains plays a signal role. Well-foundedness and strong inaccessibility are used to systematically integrate highly transfinite (...) concepts of demonstrability and existence. Zermelo incompleteness is then the analogue of the Problem of Proper Classes, and the resolution of these two anomalies is similarly analogous. (shrink)

A new construction of a certain conceptual space is presented. Elements of this conceptual space correspond to concept elements of reality, which potentially comprise an infinite number of qualities. This construction of a conceptual space solves a problem stated by Dietz and his co-authors in 2013 in the context of Voronoi diagrams. The fractal construction of the conceptual space is that this problem simply does not pose itself. The concept of convexity is discussed in this new conceptual space. Moreover, (...) the meaning of convexity is discussed in full generality, for example when space is deprived of it, its substitutes for concept domains are considered. (shrink)

According to current scholarly consensus, the pre- and post-exilic strata of Biblical Hebrew differ sufficiently to allow for the relative dating of biblical texts on linguistic grounds. Challengers to this view have objected that the received orthography of the Hebrew Bible, which is fuller than that of any pre-exilic epigraphic source, shows that no pre-exilic biblical text escaped post-exilic spelling revision. Moreover, so it is claimed, susceptibility to scribal modification on the level of orthography implies susceptibility to scribal modification on (...) the higher linguistic levels as well, which would effectively obscure a text’s original linguistic profile. In the present article it is argued that the degree of scribal modification involved in the process of orthographical revision was not so great as to distort irremediably the picture of linguistic development seen in biblical literature, so that distinctively late linguistic features can still be distinguished from their classical counterparts. Significantly, as has been argued elsewhere, diachronic development is still discernible even in the domain of orthography, a fact demonstrated on the basis of several examples, including the spelling of the qṭol-pattern qal infinitive construct. (shrink)

This paper consists of two parts and has two aims. The first is to elaborate on the historical-philosophical background of Cantor’s notions of infinity in the context of Spinoza’s influence on him. To achieve this aim, in the first part I compare Spinoza’s and Cantor’s conceptions of actual infinity along with their mathematical implications. Explaining the metaphysical, conceptual, and methodological aspects of Cantor’s expansion of the orthodox finitist conception of number of his time, I discuss how he adopts Spinoza’s motifs (...) to overcome the challenges on his way to proposing his transfinite infinites. To achieve the second aim, i.e., to investigate the philosophical foundations of Cantor’s transfinite infinites, I follow a three-step outline analyzing Cantor’s three principles along with their metaphysical and epistemological-linguistic aspects. I analyze the strengths and weak sides of Lakoff and Núñez’s Basic Metaphor of Infinity and Pantsar’s Process → Object Metaphor, then compare their interpretations with mine. I conclude that the metaphors can be improved when their source domains are limited to the target domains they apply to and when supported by a thorough analysis of the historical-philosophical background of their target domains. (shrink)

If there is one question that has perplexed the best minds in every society, it is how to raise the individuals from their present state to a higher state of existence and perfection? The answers have been tried using different formulations in history: religious, scientific and political. The common factor in all these historical formulations was that they were designed in opposition to each other and therefore left many things unaccounted. The aim of this paper is to explore the idea (...) of self-perfection as a continuous streak of infinite vertical ascension. The paper has elaborated the idea of ‘Verticality’, propounded by Peter Sloterdijk for looking in to the domains of self-perfection and the stages of vertical ascension. For our purpose, we have relied on the example of discipline of Management that has progressively theorized about different aspects and stages of existence. (shrink)

According to Weyl, “‘inexhaustibility’ is essential to the infinite”. However, he distinguishes two kinds of inexhaustible, or merely potential, domains: those that are “extensionally determinate” and those that are not. This article clarifies Weyl's distinction and explains its enduring logical and philosophical significance. The distinction sheds lights on the contemporary debate about potentialism, which in turn affords a deeper understanding of Weyl.

We prove that the Wadge order on the Borel subsets of the Scott domain is not a well-quasi-order, and that this feature even occurs among the sets of Borel rank at most 2. For this purpose, a specific class of countable 2-colored posets$\mathbb{P}_{emb} $equipped with the order induced by homomorphisms is embedded into the Wadge order on the$\Delta _2^0 $-degrees of the Scott domain. We then show that$\mathbb{P}_{emb} $admits both infinite strictly decreasing chains and infinite antichains with respect (...) to this notion of comparison, which therefore transfers to the Wadge order on the$\Delta _2^0 $-degrees of the Scott domain. (shrink)

In this paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests and random resettings in the case that we are working over an infinite domain. These relations are precisely the ones expressible in DPL if we allow ourselves arbitrary tests as a starting point. We discuss some possible extensions of DPL and the (...) way these extensions interact with our notion of context. (shrink)

The application of the maximum entropy principle to determine probabilities on finite domains is well-understood. Its application to infinite domains still lacks a well-studied comprehensive approach. There are two different strategies for applying the maximum entropy principle on first-order predicate languages: applying it to finite sublanguages and taking a limit; comparing finite entropies of probability functions defined on the language as a whole. The entropy-limit conjecture roughly says that these two strategies result in the same probabilities. While (...) the conjecture is known to hold for monadic languages as well as for premiss sentences containing only existential or only universal quantifiers, its status for premiss sentences of greater quantifier complexity is, in general, unknown. I here show that the first approach fails to provide a sensible answer for some \-premiss sentences. I discuss implications of this failure for the first strategy and consequences for the entropy-limit conjecture. (shrink)

There are four broad grounds upon which the intelligibility of quantification over absolutely everything has been questioned—one based upon the existence of semantic indeterminacy, another on the relativity of ontology to a conceptual scheme, a third upon the necessity of sortal restriction, and the last upon the possibility of indefinite extendibility. The argument from semantic indeterminacy derives from general philosophical considerations concerning our understanding of language. For the Skolem–Lowenheim Theorem appears to show that an understanding of quanti- fication over absolutely (...) everything (assuming a suitably infinite domain) is semantically indistinguishable from the understanding of quantification over something less than absolutely everything; the same first-order sentences are true and even the same first-order conditions will be satisfied by objects from the narrower domain. From this it is then argued that the two kinds of understanding are indistinguishable tout court and that nothing could count as having the one kind of understanding as opposed to the other. (shrink)

In one of his meetings with members of the Vienna Circle, Wittgenstein discusses Hermann Weyl’s brief conversion to intuitionism and criticizes his arguments against applying the law of the excluded middle to generalizations over the natural numbers. Like Weyl, however, Wittgenstein rejects the classical model theoretic conception of generality when it comes to infinite domains. Nonetheless, he disagrees with him about the reasons for doing so. This paper provides an account of Wittgenstein’s criticism of Weyl that is based (...) on his differing understanding of what a general statement over infinite domains consists in. This difference in their conception of generality is argued to be central to the middle Wittgenstein’s overall stance on intuitionism as well. While Weyl (and other intuitionists) reject the law of the excluded middle on grounds of constructivity, Wittgenstein argues that general statements over infinite domains do not express propositions in the first place. The origin of this position as well as its consequences for contemporary debates on generality are further assessed. (shrink)

Locality is a key concept not only in linguistic theorizing, but in explaining pattern of acquisition and patterns of recovery in garden path sentences, as well. If syntax relates sound and meaning over an infinite domain, syntactic dependencies and operations must be restricted in such a way to apply over limited, finite domains in order to be detectable at all. The theory of what these finite domains are and how they relate to the fundamentally unbounded nature of (...) syntax is the theory of locality. The papers in this collection all deal with the concept of locality in syntactic theory, and, more specifically, describe and analyze the various contributions Luigi Rizzi has made to this area over the past three and a half decades. The authors are all eminent linguists in generative syntax who have collaborated with Rizzi closely, and in eleven chapters, they explore locality in both pure syntax and psycholinguistics. This collection is essential reading for students and scholars of linguistic theory, generative syntax, and comparative syntax. (shrink)

This article discusses the classical problem of zero probability of universal generalizations in Rudolf Carnap’s inductive logic. A correction rule for updating the inductive method on the basis of evidence will be presented. It will be shown that this rule has the effect that infinite streams of uniform evidence assume a non-zero limit probability. Since Carnap’s inductive logic is based on finite domains of individuals, the probability of the corresponding universal quantification changes accordingly. This implies that universal generalizations (...) can receive positive prior and posterior probabilities, even for (countably) infinite domains. (shrink)

We study logical reduction (factorization) of relations into relations of lower arity by Boolean or relative products that come from applying conjunctions and existential quantifiers to predicates, i.e. by primitive positive formulas of predicate calculus. Our algebraic framework unifies natural joins and data dependencies of database theory and relational algebra of clone theory with the bond algebra of C.S. Peirce. We also offer new constructions of reductions, systematically study irreducible relations and reductions to them and introduce a new characteristic of (...) relations, ternarity, that measures their ‘complexity of relating’ and allows to refine reduction results. In particular, we refine Peirce’s controversial reduction thesis, and show that reducibility behaviour is dramatically different on finite and infinite domains. (shrink)

Saul Kripke has proposed an argument to show that there is a serious problem with many computational accounts of physical systems and with functionalist theories in the philosophy of mind. The problem with computational accounts is roughly that they provide no noncircular way to maintain that any particular function with an infinite domain is realized by any physical system, and functionalism has the similar problem because of the character of the functional systems that are supposed to be realized by (...) organisms. This paper shows that the standard account of what it is for a physical system to compute a function can avoid Kripke's criticisms without being reduced to circularity; a very minor and natural elaboration of the standard account suffices to save both functionalist theories and computational accounts generally. (shrink)

We give a complete characterization of the class of upward monotone generalized quantifiers Q1 and Q2 over countable domains that satisfy the scheme Q1 x Q2 y φ → Q2 y Q1 x φ. This generalizes the characterization of such quantifiers over finite domains, according to which the scheme holds iff Q1 is ∃ or Q2 is ∀ (excluding trivial cases). Our result shows that in infinite domains, there are more general types of quantifiers that support (...) these entailments. (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)

Saul Kripke has proposed an argument to show that there is a serious problem with many computational accounts of physical systems and with functionalist theories in the philosophy of mind. The problem with computational accounts is roughly that they provide no noncircular way to maintain that any particular function with an infinite domain is realized by any physical system, and functionalism has the similar problem because of the character of the functional systems that are supposed to be realized by (...) organisms. This paper shows that the standard account of what it is for a physical system to compute a function can avoid Kripke's criticisms without being reduced to circularity; a very minor and natural elaboration of the standard account suffices to save both functionalist theories and computational accounts generally. (shrink)

We give some lectures on the work on formal logic of Jacques Herbrand, and sketch his life and his influence on automated theorem proving. The intended audience ranges from students interested in logic over historians to logicians. Besides the well-known correction of Herbrand’s False Lemma by Goedel and Dreben, we also present the hardly known unpublished correction of Heijenoort and its consequences on Herbrand’s Modus Ponens Elimination. Besides Herbrand’s Fundamental Theorem and its relation to the Loewenheim-Skolem-Theorem, we carefully investigate Herbrand’s (...) notion of intuitionism in connection with his notion of falsehood in an infinite domain. We sketch Herbrand’s two proofs of the consistency of arithmetic and his notion of a recursive function, and last but not least, present the correct original text of his unification algorithm with a new translation. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Affective Foundation of Society in Nietzsche's PhilosophyJihun JeongIntroductionNietzsche believes that the different human types should be allowed to thrive and not be reduced into uniformity, as he says "nothing should be banished more than... the approximation and reconciliation" of the different types (KSA 12:10[59]).1 He sees the approximation as a reflection of democratic values and monolithic morality that he opposes. Instead, he believes that humans should be naturalized and (...) allowed to live in accordance with their own nature. To achieve this, Nietzsche proposed "the great politics," which "makes physiology into the ruler over all other questions" to "breed humanity as a whole" so that "one affirms what one is, one denies what one is not" (KSA 13:25[1]). In this way, Nietzsche thinks the different types should live in accordance with their respective nature.In The Antichrist, Nietzsche argues that "every healthy society" consists of different physiological types.2 He repeatedly says that "Nature, not Manu," separates these physiological types of the hierarchical order,3 which is "merely the sanction of a natural order, natural lawfulness of the first rank." While each type has "its own hygiene, its own realm of work, its own feelings of perfection and mastery" (A 57), this rank order is "the sanctioning of a natural distance between several physiological types," which are "determined and best developed for different activity," like "division of labor" (KSA 13:14[221]). Therefore, Nietzsche describes the physiological types divided in a healthy society as "differently gravitating" and "mutually conditioning" types (A 57). In order for a society to be healthy as a whole, individuals should be neither uniform nor scattered, but should be in an organized structure together. This structure is "opposed to an atomistic anarchy." A "human community is a unity [Einheit]," and "all unity is unity only as organization and co-operation." In [End Page 1] this way "a ruling structure," which does not exist as one, "means one [Eins]" (KSA 12:2[87]).However, what is it that produces this unity? Nietzsche's envisioned "naturalization of human beings" (KSA 9:11[211]) involves a society where different types live actively in accordance with their nature or respective physiological constitution. However, the existence of different types does not ensure the formation of society as a whole. Individuals of different types with different power will not automatically gather to form a society if they remain merely as individuals. In other words, if there is no social character in nature itself, a society could be seen to be formed "by accident," as Hobbes understands (42). What then is the basis that allows individuals to be incorporated into the social order? This article explores the social aspect of Nietzsche's understanding of nature, particularly with attention to his idea of affects, which will lead us to the idea of the affective foundation of society in his philosophy.4Nietzsche often describes nature as something chaotic that is elusive, uncertain, indifferent to human affairs, and without purpose and mercy. Thus, he writes, "how could you live according to this indifference? Living—is that not precisely wanting to be different than this nature? Is living not assessing, preferring, being unjust, being limited, wanting to be different?" (BGE 9) In this regard, the first point to note is that the "nature" of which Nietzsche speaks involves human nature strong enough to play with chaos and even to defy nature's indifference and brutality. As Conway points out, "the 'return to nature' that he envisions thus involves a return to human nature as the sole authority or justification for the nomothetic preferences required by the restricted economy of Life" (42–43). It is human nature to impose order on the natural world, transforming its amorphous state into a structured form of life, and to create a hierarchy of values in nature's indifference—this is perfectly natural and is the task of the philosophers. Therefore, rather than settling in "the infinite domain of Chaos" as Seung argues (292), Nietzsche reminds us of human nature: "We speak of nature and, in doing so, forget ourselves: we ourselves are nature" (WS 327). In this respect, the affirmation of nature... (shrink)

We first consider the entailment logic MC, based on meaning containment, which contains neither the Law of Excluded Middle (LEM) nor the Disjunctive Syllogism (DS). We then argue that the DS may be assumed at least on a similar basis as the assumption of the LEM, which is then justified over a finite domain or for a recursive property over an infinite domain. In the latter case, use is made of Mathematical Induction. We then show that an instance of (...) the LEM is intrumental in the proof of Cantor's Theorem, and we then argue that this is based on a more general form than can be reasonably justified. We briefly consider the impact of our approach on arithmetic and naive set theory, and compare it with intuitionist mathematics and briefly with recursive mathematics. Our "Four Basic Logical Issues" paper would provide useful background, the current paper being an application of the some of the ideas in it. (shrink)

In ancient philosophy, there is no discipline called “logic” in the contemporary sense of “the study of formally valid arguments.” Rather, once a subfield of philosophy comes to be called “logic,” namely in Hellenistic philosophy, the field includes (among other things) epistemology, normative epistemology, philosophy of language, the theory of truth, and what we call logic today. This entry aims to examine ancient theorizing that makes contact with the contemporary conception. Thus, we will here emphasize the theories of the “syllogism” (...) in the Aristotelian and Stoic traditions. However, because the context in which these theories were developed and discussed were deeply epistemological in nature, we will also include references to the areas of epistemological theorizing that bear directly on theories of the syllogism, particularly concerning “demonstration.” Similarly, we will include literature that discusses the principles governing logic and the components that make up arguments, which are topics that might now fall under the headings of philosophy of logic or non-classical logic. This includes discussions of problems and paradoxes that connect to contemporary logic and which historically spurred developments of logical method. For example, there is great interest among ancient philosophers in the question of whether all statements have truth-values. Relevant themes here include future contingents, paradoxes of vagueness, and semantic paradoxes like the liar. We also include discussion of the paradoxes of the infinite for similar reasons, since solutions have introduced sophisticated tools of logical analysis and there are a range of related, modern philosophical concerns about the application of some logical principles in infinite domains. Our criterion excludes, however, many of the themes that Hellenistic philosophers consider part of logic, in particular, it excludes epistemology and metaphysical questions about truth. Ancient philosophers do not write treatises “On Logic,” where the topic would be what today counts as logic. Instead, arguments and theories that count as “logic” by our criterion are found in a wide range of texts. For the most part, our entry follows chronology, tracing ancient logic from its beginnings to Late Antiquity. However, some themes are discussed in several eras of ancient logic; ancient logicians engage closely with each other’s views. Accordingly, relevant publications address several authors and periods in conjunction. These contributions are listed in three thematic sections at the end of our entry. (shrink)

While the classical account of the linear continuum takes it to be a totality of points, which are its ultimate parts, Aristotle conceives of it as continuous and infinitely divisible, without ultimate parts. A formal account of this conception can be given employing a theory of quantification for nonatomic domains and a theory of region-based topology.

This is a useful little book. Within a surprisingly short space it manages to cover most of the fundamentals of symbolic logic in a clear and accurate way. The development is step-by-step, and each new term is carefully explained at its first mention. The main topics covered are the logic of sentences, the axiomatic method, and an elementary form of the logic of predicates. In the final chapter and appendix a number of more difficult problems are briefly touched upon: higher-order (...) predicates, finite and infinite domains, satisfiability, the classical syllogism, and the algebra of classes. A well-chosen bibliography is given at the end of each chapter. The book can be recommended without reserve for elementary courses in modern logic. There is no other book of quite this type available in English; it gives the bare essentials; it stays within formal logic all the time; its co-ordination of the logic of sentences and the logic of predicates is good; the accuracy of the historical knowledge displayed unobtrusively here and there is in refreshing contrast to the lack of perspective one often finds in writings of the Russell school which has dominated the English scene for so long. This book could also be used by those familiar with the “traditional” formal logic who wish to situate their speciality within the broader field of modern symbolic logic. (shrink)

Do actual infinities exist or are they impossible? Does mathematical practice require the existence of actual infinities, or are potential infinities enough? Contrasting points of view are examined in depth, concentrating on Aristotle’s ancient arguments against actual infinities. In the long 19th century, we consider Cantor’s successful rehabilitation of the actual infinite within his set theory, his views on the continuum, Zeno's paradoxes, and the domain principle, criticisms by Frege, and the axiomatisation of set theory by Zermelo, as well (...) as Zermelo’s assertion of the primacy of potential infinity in mathematics. (shrink)

Results from a crowdsourced audio questionnaire show that inflected infinitives in Galician are still acceptable in a broad range of contexts, different from those described for European Portuguese. Crucially, inflected infinitives with referential subjects are widely accepted only inside strong islands in Galician (complements of nouns, adjunct clauses). They are widely rejected in non-islands, notably in the complements of epistemic/factive verbs, in contrast with Portuguese and older varieties of Galician (Gondar 1978, Raposo 1987). Statistical analysis shows, however, that, in the (...) complements of epistemic/factive (and desiderative) verbs, inflected infinitives are significantly more acceptable in instances of control, whether partial or exhaustive. In fact, there is no significant difference between these two types of control in Galician, unlike in Portuguese, where inflection is generally better in instances of partial control and is not acceptable in instances of exhaustive local subject control (Modesto 2010, Sheehan 2018). We propose an analysis of this pattern in terms of phase theory. The inflectional domain of non-finite clauses remains visible to the thematic domain of the next clause up, according to the less strict version of the Phase Impenetrability Condition (Chomsky 2001), allowing control to take place. Pronouns/or pronominal inflections in the inflectional domain of visible non-finite clauses therefore get controlled. In islands, however, material in the inflectional domain remains free/referential. Despite this basic pattern, the data are characterized by substantial interspeaker variation. Statistical analysis shows that gender, urban/rural birthplace and mother tongue are all significant factors in this variation, while age and region of birth are not. Most notably, urban-born male bilinguals with Spanish as their mother tongue consistently rate the sentences higher on the Likert scale. Overall, the results show that crowdsourcing can lead to empirically robust syntactic descriptions of minority languages which are likely to be subject to substantial sociolinguistic variation and where judgements from a single social group may be misrepresentative of the general picture. The study also highlights, however, the challenges associated with using crowd-sourced audio-questionnaires of this kind in languages of this kind and the need for statistical analysis of results to control for substantial amounts of variation. (shrink)

The present article critically examines three aspects of Graham Priest's dialetheic analysis of very important kinds of limitations (the limit of what can be expressed, described, conceived, known, or the limit of some operation or other). First, it is shown that Priest's considerations focusing on Hegel's account of the infinite cannot be sustained, mainly because Priest seems to rely on a too restrictive notion of object. Second, we discuss Priest's treatment of the paradoxes in Cantorian set-theory. It is shown (...) that Priest does not address the issue in full generality; rather, he relies on a reading of Cantor which implicitly attributes a very strong principle concerning quantification over arbitrary domains to Cantor. Third, the main piece of Priest's work, the so-called “inclosure schema”, is investigated. This schema is supposed to formalize the core of many well-known paradoxes. We claim, however, that formally the schema is not sound. (shrink)

We examine how degrees of computably enumerable equivalence relations under computable reduction break down into isomorphism classes. Two ceers are isomorphic if there is a computable permutation of ω which reduces one to the other. As a method of focusing on nontrivial differences in isomorphism classes, we give special attention to weakly precomplete ceers. For any degree, we consider the number of isomorphism types contained in the degree and the number of isomorphism types of weakly precomplete ceers contained in the (...) degree. We show that the number of isomorphism types must be 1 or ω, and it is 1 if and only if the ceer is self-full and has no computable classes. On the other hand, we show that the number of isomorphism types of weakly precomplete ceers contained in the degree can be any member of $[0,\omega ]$. In fact, for any $n \in [0,\omega ]$, there is a degree d and weakly precomplete ceers ${E_1}, \ldots,{E_n}$ in d so that any ceer R in d is isomorphic to ${E_i} \oplus D$ for some $i \le n$ and D a ceer with domain either finite or ω comprised of finitely many computable classes. Thus, up to a trivial equivalence, the degree d splits into exactly n classes.We conclude by answering some lingering open questions from the literature: Gao and Gerdes [11] define the collection of essentially FC ceers to be those which are reducible to a ceer all of whose classes are finite. They show that the index set of essentially FC ceers is ${\rm{\Pi }}_3^0$-hard, though the definition is ${\rm{\Sigma }}_4^0$. We close the gap by showing that the index set is ${\rm{\Sigma }}_4^0$-complete. They also use index sets to show that there is a ceer all of whose classes are computable, but which is not essentially FC, and they ask for an explicit construction, which we provide.Andrews and Sorbi [4] examined strong minimal covers of downwards-closed sets of degrees of ceers. We show that if $\left$ is a uniform c.e. sequence of non universal ceers, then $\left\{ {{ \oplus _{i \le j}}{E_i}|j \in \omega } \right\}$ has infinitely many incomparable strong minimal covers, which we use to answer some open questions from [4].Lastly, we show that there exists an infinite antichain of weakly precomplete ceers. (shrink)

We prove that the two-variable fragment of first-order intuitionistic logic is undecidable, even without constants and equality. We also show that the two-variable fragment of a quantified modal logic L with expanding first-order domains is undecidable whenever there is a Kripke frame for L with a point having infinitely many successors (such are, in particular, the first-order extensions of practically all standard modal logics like K, K4, GL, S4, S5, K4.1, S4.2, GL.3, etc.). For many quantified modal logics, including (...) those in the standard nomenclature above, even the monadic two-variable fragments turn out to be undecidable. (shrink)

We prove that if f is a partial Borel function from one Polish space to another, then either f can be decomposed into countably many partial continuous functions, or else f contains the countable infinite power of a bijection that maps a convergent sequence together with its limit onto a discrete space. This is a generalization of a dichotomy discovered by Solecki for Baire class 1 functions. As an application, we provide a characterization of functions which are countable unions (...) of continuous functions with domains of type Πn0, for a fixed n<ω. For Baire class 1 functions, this generalizes analogous characterizations proved by Jayne and Rogers for n=1 and Semmes for n=2. (shrink)