A number of philosophers think that grounding is, in some sense, well-founded. This thesis, however, is not always articulated precisely, nor is there a consensus in the literature as to how it should be characterized. In what follows, I consider several principles that one might have in mind when asserting that grounding is well-founded, and I argue that one of these principles, which I call ‘full foundations’, best captures the relevant claim. My argument is by the process of elimination. For (...) each of the inadequate principles, I illustrate its inadequacy by showing either that it excludes cases that should not be ruled out by a well-foundedness axiom for grounding, or that it admits cases that should be ruled out. (shrink)

We highlight that the connection of well-foundedness and recursive definitions is more than just convenience. While the consequences of making well-foundedness a sufficient condition for the existence of hierarchies have been extensively studied, we point out that well-foundedness is a necessary condition for the existence of hierarchies e.g. that even in an intuitionistic setting α⊢wfwhereα\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${_\alpha \vdash \mathsf{wf}\, {\rm where}\, _\alpha}$$\end{document} stands for the iteration of Π10\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} (...) \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\Pi^0_1}$$\end{document} comprehension along some ordinal α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha}$$\end{document} and wf\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\mathsf{wf}}$$\end{document} stands for the well-foundedness of α\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\alpha}$$\end{document}. (shrink)

It has recently been argued that foundationalists, those who take grounding to be well-founded, should not understand the well-foundedness of grounding as the condition that every grounding chain terminates in the downward direction, because this interpretation of well-foundedness fails to correctly classify certain complex grounding structures. Some structures that plausibly would be acceptable to the foundationalist are classified as not well-founded and others that plausibly would not be acceptable to the foundationalist are classified as well-founded. In this paper (...) I provide a characterisation of well-foundedness in terms of termination that correctly characterises all these difficult cases. This acts as a response to these recent arguments. Furthermore, it allows us to better evaluate their importance: these arguments have not shown that foundationalists are wrong to harbour the intuition that grounding chains must terminate in the downward direction, rather, they have shown that foundationalists need to be more clear about this intuition and how it is born out in more complex grounding structures. (shrink)

Tarski [5] showed that for any set X, its set w(X) of well-orderable subsets has cardinality strictly greater than that of X, even in the absence of the axiom of choice. We construct a Fraenkel-Mostowski model in which there is an infinite strictly descending sequence under the relation |w (X)| = |Y|. This contrasts with the corresponding situation for power sets, where use of Hartogs' ℵ-function easily establishes that there can be no infinite descending sequence under the relation |P(X)| = (...) |Y|. (shrink)

A foundational algebra ( , f, ) consists of a hemimorphism f on a Boolean algebra with a greatest solution to the condition f(x). The quasi-variety of foundational algebras has a decidable equational theory, and generates the same variety as the complex algebras of structures (X, R), where f is given by R-images and is the non-wellfounded part of binary relation R.The corresponding results hold for algebras satisfying =0, with respect to complex algebras of wellfounded binary relations. These algebras, however, (...) generate the variety of all ( ,f) with f a hemimorphism on ). (shrink)

Typed feature structures are used extensively for the specification of linguistic information in many formalisms. The subsumption relation orders TFSs by their information content. We prove that subsumption of acyclic TFSs is well founded, whereas in the presence of cycles general TFS subsumption is not well founded. We show an application of this result for parsing, where the well-foundedness of subsumption is used to guarantee termination for grammars that are off-line parsable. We define a new version of off-line parsability (...) that is less strict than the existing one; thus termination is guaranteed for parsing with a larger set of grammars. (shrink)

Contemporary metaphysicians have been drawn to a certain attractive picture of the structure of the world. This picture consists in classical mereology, the priority of parts over wholes, and the well-foundedness of metaphysical priority. In this short note, I show that this combination of theses entails superatomism, which is a significant strengthening of mereological atomism. This commitment has been missed in the literature due to certain sorts of models of mereology being overlooked. But the entailment is an important one: (...) we must either accept superatomism or reject one (or other) of the most widespread theses of contemporary metaphysics. (shrink)

Debates over what is fundamental assume that what is most fundamental must be either a “top” level (roughly, the biggest or highest-level thing), or a “bottom” level (roughly, the smallest or lowest-level things). Here I sketch an alternative to top-ism and bottom-ism, the view that a middle level could be the most fundamental, and argue for its plausibility. I then suggest that the view satisfies the desiderata of asymmetry, irreflexivity, transitivity, and well-foundedness of fundamentality, that the view has explanatory (...) power on par with that of top-ism and bottom-ism, and that it satisfies the Principle of Sufficient Reason. (shrink)

I examine the link between extensionality principles of classical mereology and the anti‐symmetry of parthood. Varzi's most recent defence of extensionality depends crucially on assuming anti‐symmetry. I examine the notions of proper parthood, weak supplementation and non‐well‐foundedness. By rejecting anti‐symmetry, the anti‐extensionalist has a unified, independently grounded response to Varzi's arguments. I give a formal construction of a non‐extensional mereology in which anti‐symmetry fails. If the notion of ‘mereological equivalence’ is made explicit, this non‐anti‐symmetric mereology recaptures all of the (...) structure of classical mereology. (shrink)

The paper contains proof-theoretic investigation on extensions of Kripke-Platek set theory, KP, which accommodate first-order reflection. Ordinal analyses for such theories are obtained by devising cut elimination procedures for infinitary calculi of ramified set theory with Пn reflection rules. This leads to consistency proofs for the theories KP+Пn reflection using a small amount of arithmetic and the well-foundedness of a certain ordinal system with respect to primitive decending sequences. Regarding future work, we intend to avail ourselves of these new (...) cut elimination techniques to attain an ordinal analysis of П12 comprehension by approaching П12 comprehension through transfinite levels of reflection. (shrink)

The generality problem is perhaps the most notorious problem for process reliabilism. Several recent responses to the generality problem have claimed that the problem has been unfairly leveled against reliabilists. In particular, these responses have claimed that the generality problem is either (i) just as much of a problem for evidentialists, or (ii) if it is not, then a parallel solution is available to reliabilists. Along these lines, Juan Comesaña has recently proposed solution to the generality problem—well-founded reliabilism. According to (...) Comesaña, the solution to the generality problem lies in solving the basing problem, such that any solution to the basing problem will give a solution to the generality problem. Comesaña utilizes Conee and Feldman’s evidentialist account of basing (Conee and Feldman’s well-foundedness principle) in forming his version of reliabilism. In this paper I show that Comesaña’s proposed solution to the generality problem is inadequate. Well-founded reliabilism both fails to solve the generality problem and subjects reliabilism to new damning verdicts. In addition, I show that evidentialism does not face any parallel problems, so the generality problem remains a reason to prefer evidentialism to reliabilism. (shrink)

Those who wish to claim that all facts about grounding are themselves grounded (“the meta-grounding thesis”) must defend against the charge that such a claim leads to infinite regress and violates the well-foundedness of ground. In this paper, we defend. First, we explore three distinct but related notions of “well-founded”, which are often conflated, and three corresponding notions of infinite regress. We explore the entailment relations between these notions. We conclude that the meta-grounding thesis need not lead to tension (...) with any of the three notions of “well-founded”. Finally, we explore the details of and motivations for further conditions on ground that one might add to generate a conflict between the meta-grounding thesis and a well-founded constraint. We explore these topics by developing and utilizing a formal framework based on the notion of a grounding structure. (shrink)

Once one accepts that certain things metaphysically depend upon, or are metaphysically explained by, other things, it is natural to begin to wonder whether these chains of dependence or explanation must come to an end. This essay surveys the work that has been done on this issue—the issue of grounding and infinite descent. I frame the discussion around two questions: (1) What is infinite descent of ground? and (2) Is infinite descent of ground possible? In addressing the second question, I (...) will consider a number of arguments that have been made for and against the possibility of infinite descent of ground. When relevant, I connect the discussion to two important views about the way reality can be structured by grounding: metaphysical foundationalism and metaphysical infinitism. (shrink)

It is well-known that natural axiomatic theories are well-ordered by consistency strength. However, it is possible to construct descending chains of artificial theories with respect to consistency strength. We provide an explanation of this well-orderedness phenomenon by studying a coarsening of the consistency strength order, namely, the$\Pi ^1_1$reflection strength order. We prove that there are no descending sequences of$\Pi ^1_1$sound extensions of$\mathsf {ACA}_0$in this ordering. Accordingly, we can attach a rank in this order, which we call reflection rank, to any$\Pi (...) ^1_1$sound extension of$\mathsf {ACA}_0$. We prove that for any$\Pi ^1_1$sound theoryTextending$\mathsf {ACA}_0^+$, the reflection rank ofTequals the$\Pi ^1_1$proof-theoretic ordinal ofT. We also prove that the$\Pi ^1_1$proof-theoretic ordinal of$\alpha $iterated$\Pi ^1_1$reflection is$\varepsilon _\alpha $. Finally, we use our results to provide straightforward well-foundedness proofs of ordinal notation systems based on reflection principles. (shrink)

Should a philosophical account of perceptual knowledge accord a justificatory role to sensory experiences? This discussion raises problems for an affirmative answer and sets out an alternative account on which justified belief is conceived as well-founded belief and well-foundedness is taken to depend on knowledge. A key part of the discussion draws on a conception of perceptual-recognitional abilities to account for how perception gives rise both to perceptual knowledge and to well-founded belief.

We show that many principles of first-order arithmetic, previously only known to lie strictly between [Formula: see text]-induction and [Formula: see text]-induction, are equivalent to the well-foundedness of [Formula: see text]. Among these principles are the iteration of partial functions of Hájek and Paris, the bounded monotone enumerations principle by Chong, Slaman, and Yang, the relativized Paris–Harrington principle for pairs, and the totality of the relativized Ackermann–Péter function. With this we show that the well-foundedness of [Formula: see text] (...) is a far more widespread than usually suspected. Further, we investigate the [Formula: see text]-iterated version of the bounded monotone iterations principle, and show that it is equivalent to the well-foundedness of the -height [Formula: see text]-tower [Formula: see text]. (shrink)

The notion of fundamentality, as it is used in metaphysics, aims to capture the idea that there is something basic or primitive in the world. This metaphysical notion is related to the vernacular use of “fundamental”, but philosophers have also put forward various technical definitions of the notion. Among the most influential of these is the definition of absolute fundamentality in terms of ontological independence or ungroundedness. Accordingly, the notion of fundamentality is often associated with these two other technical notions.

Levels of organization and their use in science have received increased philosophical attention of late, including challenges to the well-foundedness or widespread usefulness of levels concepts. One kind of response to these challenges has been to advocate a more precise and specific levels concept that is coherent and useful. Another kind of response has been to argue that the levels concept should be taken as a heuristic, to embrace its ambiguity and the possibility of exceptions as acceptable consequences of (...) its usefulness. In this chapter, I suggest that each of these strategies faces its own attendant downsides, and that pursuit of both strategies (by different thinkers) compounds the difficulties. That both kinds of approaches are advocated is, I think, illustrative of the problems plaguing the concept of levels of organization. I end by suggesting that the invocation of levels may mislead scientific and philosophical investigations more than it informs them, so our use of the levels concept should be updated accordingly. (shrink)

A growing number of philosophers are concerned with the epistemic status of culturally nurtured beliefs, beliefs found especially in domains of morals, politics, philosophy, and religion. Plausibly, worries about the deep impact of cultural contingencies on beliefs in these domains of controversial views is a question about well-foundedness: Does it defeat well-foundedness if the agent is rationally convinced that she would take her own reasons for belief as insufficiently well-founded, or would take her own belief as biased, had (...) she been nurtured in a different psychographic community? This chapter will examine the proper scope and force of this epistemic location problem. It sketches an account of well and ill-founded nurtured belief based upon the many markers of doxastic strategies exhibiting low to high degrees of inductive risk: the moral and epistemic risk of ‘getting it wrong’ in an inductive context of inquiry. (shrink)

According to the traditional bundle theory, particulars are bundles of compresent universals. I think we should reject the bundle theory for a variety of reasons. But I will argue for the thesis at the core of the bundle theory: that all the facts about particulars are grounded in facts about universals. I begin by showing how to meet the main objection to this thesis (which is also the main objection to the bundle theory): that it is inconsistent with the possibility (...) of distinct qualitative indiscernibles. Here, the key idea appeals to a non-standard theory of haecceities as non-well-founded properties of a certain sort. I will then defend this theory from a number of objections, and finally argue that we should accept it on the basis of considerations of parsimony about the fundamental. (shrink)

We have previously established that [Formula: see text]-comprehension is equivalent to the statement that every dilator has a well-founded Bachmann–Howard fixed point, over [Formula: see text]. In this paper, we show that the base theory can be lowered to [Formula: see text]. We also show that the minimal Bachmann–Howard fixed point of a dilator [Formula: see text] can be represented by a notation system [Formula: see text], which is computable relative to [Formula: see text]. The statement that [Formula: see text] (...) is well founded for any dilator [Formula: see text] will still be equivalent to [Formula: see text]-comprehension. Thus, the latter is split into the computable transformation [Formula: see text] and a statement about the preservation of well-foundedness, over a system of computable mathematics. (shrink)

This paper introduces Agreement Theorems to dynamic-epistemic logic. We show first that common belief of posteriors is sufficient for agreement in epistemic-plausibility models, under common and well-founded priors. We do not restrict ourselves to the finite case, showing that in countable structures the results hold if and only if the underlying plausibility ordering is well-founded. We then show that neither well-foundedness nor common priors are expressible in the language commonly used to describe and reason about epistemic-plausibility models. The static (...) agreement result is, however, finitely derivable in an extended modal logic. We provide the full derivation. We finally consider dynamic agreement results. We show they have a counterpart in epistemic-plausibility models, and provide a new form of agreements via public announcements. (shrink)

Following Yik and Russell (1999) a judgement paradigm was used to examine to what extent differential accuracy of recognition of facial expressions allows evaluation of the well-foundedness of different theoretical views on emotional expression. Observers judged photos showing facial expressions of seven emotions on the basis of: (1) discrete emotion categories; (2) social message types; (3) appraisal results; or (4) action tendencies, and rated their confidence in making choices. Emotion categories and appraisals were judged significantly more accurately and confidently (...) than messages or action tendencies. These results do not support claims of primacy for message or action tendency views of facial expression. Based on a componential model of emotion it is suggested that judges can infer components from categories and vice versa. (shrink)

Kant’s Critique of Pure Reason (KrV) presents a priori knowledge of synthetic truths as posing a philosophical problem of great import whose only possible solution vindicates the system of transcendental idealism. The work does not accord any such significance to a priori knowledge of analytic truths. The intelligibility of the contrast rests on the well-foundedness of Kant’s analytic–synthetic distinction and on his claim to objectively or correctly classify key judgments with respect to it. Though the correctness of Kant’s classification (...) is vital to his philosophical project, it has been vigorously challenged since he introduced his famous distinction of judgments. The aim of this essay is to explore several metaphysical motives contributing to Kant’s objective classification claim that have been underemphasized and in part overlooked in the large literature on the topic. (shrink)

The Suslin operator is a type-2 functional testing for the well-foundedness of binary relations on the natural numbers. In the context of applicative theories, its proof-theoretic strength has been analyzed in Jäger and Strahm [18]. This article provides a more direct approach to the computation of the upper bounds in question. Several theories featuring the Suslin operator are embedded into ordinal theories tailored for dealing with non-monotone inductive definitions that enable a smooth definition of the application relation.

This paper is an investigation of the relationship between G\"odel's second incompleteness theorem and the well-foundedness of jump hierarchies. It follows from a classic theorem of Spector's that the relation $\{(A,B) \in \mathbb{R}^2 : \mathcal{O}^A \leq_H B\}$ is well-founded. We provide an alternative proof of this fact that uses G\"odel's second incompleteness theorem instead of the theory of admissible ordinals. We then derive a semantic version of the second incompleteness theorem, originally due to Mummert and Simpson, from this result. (...) Finally, we turn to the calculation of the ranks of reals in this well-founded relation. We prove that, for any $A\in\mathbb{R}$, if the rank of $A$ is $\alpha$, then $\omega_1^A$ is the $(1 + \alpha)^{\text{th}}$ admissible ordinal. It follows, assuming suitable large cardinal hypotheses, that, on a cone, the rank of $X$ is $\omega_1^X$. (shrink)

In formal ontology, infinite regresses are generally considered a bad sign. One debate where such regresses come into play is the debate about fundamentality. Arguments in favour of some type of fundamentalism are many, but they generally share the idea that infinite chains of ontological dependence must be ruled out. Some motivations for this view are assessed in this article, with the conclusion that such infinite chains may not always be vicious. Indeed, there may even be room for a type (...) of fundamentalism combined with infinite descent as long as this descent is “boring,” that is, the same structure repeats ad infinitum. A start is made in the article towards a systematic account of this type of infinite descent. The philosophical prospects and scientific tenability of the account are briefly evaluated using an example from physics. (shrink)

I put forward precise and appealing notions of reference, self-reference, and well-foundedness for sentences of the language of first-order Peano arithmetic extended with a truth predicate. These notions are intended to play a central role in the study of the reference patterns that underlie expressions leading to semantic paradox and, thus, in the construction of philosophically well-motivated semantic theories of truth.

Carnap’s thought not only played a pivotal role for the development of formal semantics and modern philosophy of science, but also engendered the profound methodological reorientation that distinguishes analytical from traditional ontology. Historically and systematically, Carnap’s formal approach to category theory is the primary source of influence on the three research programs that have given analytical ontology its distinctive profile: the design of constructional systems, the investigation of the expressive power of first order theories, and the meta-linguistic reduction of abstract (...) terms. Each of these research programs takes off from Carnap’s deflation of traditional category theory as set out in the Aufbau and modified in Syntax. None of these programs, however, follow Carnap in his claim that category theory, even in the attenuated sense of a derivational systematization of cognitive contents, may ultimately be separated from metaphysics or remain metaphysically “neutral.” Carnap’s “neutralism thesis” is taken to imply the stronger “elimination thesis,” his explicit anti-metaphysical pronouncements that stand and fall with semantic verificationism. However, I will argue, first, that the neutralism thesis is historically and systematically independent of the elimination thesis. Second, unlike the elimination thesis, the neutrality claim and Carnap’s attempt to cash it out in the Aufbau is important for the methodology of contemporary ontology, at least where it follows constructivist predilections. Third, Carnap’s neutrality claim in the Aufbau is supported by an implicit conception of reality as invariance-structure. Yet, just as the structuralization of referential domains may be able to warrant neutrality, it threatens the explanatory aspirations of constitution theory. This tension between neutrality and explanatory power sheds new light on the notion of “foundedness,” Carnap’s curious restriction on the interpretation of the system’s basic relation that has struck some as outright incoherent. (shrink)

I will use paradox as a guide to metaphysical grounding, a kind of non-causal explanation that has recently shown itself to play a pivotal role in philosophical inquiry. Specifically, I will analyze the grounding structure of the Predestination paradox, the regresses of Carroll and Bradley, Russell's paradox and the Liar, Yablo's paradox, Zeno's paradoxes, and a novel omega plus one variant of Yablo's paradox, and thus find reason for the following: We should continue to characterize grounding as asymmetrical and irreflexive. (...) We should change our understanding of the transitivity of grounding in a certain sense. We should require foundationality in a new, generalized sense, that has well-foundedness as its limit case. Meta-grounding is important. The polarity of grounding can be crucial. Thus we will learn a lot about structural properties of grounding from considering the various paradoxes. On the way, grounding will also turn out to be relevant to the diagnosis (if not the solution) of paradox. All the paradoxes under consideration will turn out to be breaches of some standard requirement on grounding, which makes uniform solutions of large groups of these paradoxes more desirable. In sum, bringing together paradox and grounding will be shown to be of considerable value to philosophy.1. (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)

We re-express our theorem on the strong-normalisation of display calculi as a theorem about the well-foundedness of a certain ordering on first-order terms, thereby allowing us to prove the termination of systems of rewrite rules. We first show how to use our theorem to prove the well-foundedness of the lexicographic ordering, the multiset ordering and the recursive path ordering. Next, we give examples of systems of rewrite rules which cannot be handled by these methods but which can be (...) handled by ours. Finally, we show that our method can also prove the termination of the Knuth-Bendix ordering and of dependency pairs. Keywords: rewriting, termination, well-founded ordering, recursive path ordering.. (shrink)

In connection with his interest in selfdistributive algebra, Richard Laver established two deep results with potential applications in low-dimen\-sional topology, namely the existence of what is now known as the Laver tables and the well-foundedness of the standard ordering of positive braids. Here we present these results and discuss the way they could be used in topological applications.

The modal -calculus extends basic modal logic with second-order quantification in terms of arbitrarily nested fixpoint operators. Its satisfiability problem is EXPTIME-complete. Decision procedures for the modal -calculus are not easy to obtain though since the arbitrary nesting of fixpoint constructs requires some combinatorial arguments for showing the well-foundedness of least fixpoint unfoldings. The tableau-based decision procedures so far also make assumptions on the unfoldings of fixpoint formulas, e.g., explicitly require formulas to be in guarded normal form. In this (...) paper we present a tableau calculus for deciding satisfiability of arbitrary, i.e., not necessarily guarded -calculus formulas. It is based on a new unfolding rule for greatest fixpoint formulas which allows unguarded formulas to be handled without an explicit transformation into guarded form, thus avoiding a exponential blow-up in formula size. We prove soundness and completeness of the calculus, and compare it empirically to using guarded transformation instead. The new unfolding rule can also be used to handle nested star operators in PDL formulas correctly. (shrink)

Russell’s paradox is purely logical in the following sense: a contradiction can be formally deduced from the proposition that there is a set of all non-self-membered sets, in pure first-order logic—the first-order logical form of this proposition is inconsistent. This explains why Russell’s paradox is portable—why versions of the paradox arise in contexts unrelated to set theory, from propositions with the same logical form as the claim that there is a set of all non-self-membered sets. Burali-Forti’s paradox, like Russell’s paradox, (...) is portable. I offer the following explanation for this fact: Burali-Forti’s paradox, like Russell’s, is purely logical. Concretely, I show that if we enrich the language \ of first-order logic with a well-foundedness quantifier W and adopt certain minimal inference rules for this quantifier, then a contradiction can be formally deduced from the proposition that there is a greatest ordinal. Moreover, a proposition with the same logical form as the claim that there is a greatest ordinal can be found at the heart of several other paradoxes that resemble Burali-Forti’s. The reductio of Burali-Forti can be repeated verbatim to establish the inconsistency of these other propositions. Hence, the portability of the Burali-Forti’s paradox is explained in the same way as the portability of Russell’s: both paradoxes involve an inconsistent logical form—Russell’s involves an inconsistent form expressible in \ and Burali-Forti’s involves an inconsistent form expressible in \. (shrink)

Inspite of growing interest in research on language universals the concept of language universal itself has not been clarified beyond its status in Greenberg 1966. The present paper is an attempt at further clarification. The concept of language universal presents at least the following basic problems : Which entities are to be called universal? How can universality statements be deductively related to statements on individual languages and to non-linguistic statements, e.g. psychological ones? How are we to conceive the relation between (...) the 'empirical' and the 'non-empirical' in universality research? It is argued that the universal entities should be properties of languages. Three conceptions of universals are characterized: The Naive View , the Semantic View , and the Pragmatic View proposed by the author . It is argued that the Naive View and the Semantic View do not, and that the Pragmatic View may solve the basic problems formulated in Part I. Combining the Pragmatic View with the conception of theories developed in Lieb to appear the author characterizes the ultimate aim of universality research as defining a set of properties that, if taken as universal by any linguist, maximize the fruitfulness of any theory of language. The main task of universality research consists in making universality proposals that are well-founded with respect to that aim. Various principles are suggested by which the well-foundedness of universality proposals can be judged. (shrink)

As is well-known, the Bernays-Schönfinkel-Ramsey class of all prenex ∃*∀* -sentences which are valid in classical first-order logic is decidable. This paper paves the way to an analogous result which the authors deem to hold when the only available predicate symbols are ∈ and =, no constants or function symbols are present, and one moves inside a (rather generic) Set Theory whose axioms yield the well-foundedness of membership and the existence of infinite sets. Here semi-decidability of the satisfiability problem (...) for the BSR class is proved by following a purely semantic approach, the remaining part of the decidability result being postponed to a forthcoming paper. (shrink)

Vauzeilles, J., Cut elimination for the Unified Logic, Annals of Pure and Applied Logic 62 1-16. In the paper entitled “On the Unity of Logic” Girard introduced and motivated the system LU. In Girard's article, the cut-elimination result for LU is stated and used as a key lemma, but not supported by any rigourous proof. In the present paper, we prove that LU enjoys cut elimination under minimal hypotheses: a notion of degree for a formula is introduced, which depends only (...) on the number of exponentials of the formula; this refinement yields much better bounds for cut elimination and leaves open many possibilities as to non-well-foundedness of formulae. (shrink)

One main kind of etiological challenge to the well-foundedness of someone’s belief is the consideration that if you had a different education/upbringing, you would very likely accept different beliefs than you actually do. Although a person’s religious identity and attendant religious beliefs are usually the ones singled out as targets of such “contingency” or “epistemic location” arguments, it is clear that a person’s place and time has a conditioning effect in all domains of controversial views, and over all of (...) what in the epistemology of disagreement are termed our nurtured beliefs. Still, given the absolutism that has often attended religious truth claims, together with the great contrariety of teachings based upon purported divine revelation, arguments from contingency have often been presented as having special force against religious ‘enthusiasts.’ Chapter Two argues that if we are to explicate the force of problems of religious luck, we need to think more carefully about the scope and force of skeptical arguments of this general type. Contingency problems are not often considered serious objections to faith, since there are narrative theological explanations about differences between “home” and “alien” religious traditions, which any adherent of a particular tradition might appeal to. But what I term the New Problem tries to present a qualified and re-focused set of concerns, rather than a sweeping sort of skepticism. First, I carefully delimit the scope of the de jure challenge which the contingency and insensitivity of belief suggests. In general terms, a de jure challenge implicates dereliction of epistemic duty, intellectual viciousness, or some other sense of epistemic unacceptability to some target class of religious belief, narrow or broad (Plantinga 1995). Next, I redirect that challenge through a new thought experiment aimed at clarifying how the mind-set of religious exclusivism is enabled only through counter-inductive or “pattern-breaking” thinking. Much more focused than any overbroad argument from continency, the New Problem of religious luck is presented as a strong de jure challenge to the reasonableness of religious exclusivist a) conceptions of faith and b) responses to religious multiplicity. (shrink)

Gaisi Takeuti extended Gentzen's work to higher-order case in 1950's–1960's and proved the consistency of impredicative subsystems of analysis. He has been chiefly known as a successor of Hilbert's school, but we pointed out in the previous paper that Takeuti's aimed to investigate the relationships between "minds" by carrying out his proof-theoretic project rather than proving the "reliability" of such impredicative subsystems of analysis. Moreover, as briefly explained there, his philosophical ideas can be traced back to Nishida's philosophy in Kyoto's (...) school. For the proving the consistency of such systems, it is crucial to prove the well-foundedness of ordinals called "ordinal diagrams" developed for it. Takeuti presented such arguments several times in order to show that they are admitted in his stand point. As a starting point of investigating his finitist stand point, we formulate the system of ordinal notations up to ε0 and reconstruct the well-foundedness arguments of them. (shrink)

Potentialists think that the concept of set is importantly modal. Using tensed language as an heuristic, the following bar-bones story introduces the idea of a potential hierarchy of sets: 'Always: for any sets that existed, there is a set whose members are exactly those sets; there are no other sets.' Surprisingly, this story already guarantees well-foundedness and persistence. Moreover, if we assume that time is linear, the ensuing modal set theory is almost definitionally equivalent with non-modal set theories; specifically, (...) with Level Theory, as developed in Part 1. (shrink)

According to Alan Millar, justified beliefs are well-founded beliefs. Millar cashes out the notion of well-foundedness in terms of having an adequate reason to believe something and believing it for that reason. To make his account of justified belief compatible with perceptual justification he appeals to the notion of recognitional ability. It is argued that, due to the fact that Millar’s is a knowledge-first view, his appeal to recognitional abilities fails to offer an explanatory account of familiar cases in (...) the literature and, as a consequence, of the notion of perceptual justification. (shrink)

We construct by diagonalization a non-well-founded primitive recursive tree, which is well-founded for co-r.e. sets, provable in Σ1 0. It follows that the supremum of order-types of primitive recursive well-orderings, whose well-foundedness on co-r.e. sets is provable in Σ1 0, equals the limit of all recursive ordinals ω1 ck . RID=""ID="" Mathematics Subject Classification (2000): 03B30, 03F15 RID=""ID="" Supported by the Deutschen Akademie der Naturforscher Leopoldina grant #BMBF-LPD 9801-7 with funds from the Bundesministerium für Bildung, Wissenschaft, Forschung und Technologie. (...) RID=""ID="" I would like to thank A. SETZER for his hospitality during my stay in Uppsala in December 1998 – these investigations are inspired by a discussion with him; S. BUSS for his hospitality during my stay at UCSD and for valuable remarks on a previous version of this paper; and M. MÖLLERFELD for remarks on a previous title. (shrink)

This paper investigates provability and non-provability of well-foundedness of ordinal notations in weak theories of bounded arithmetic. We define a notion of well-foundedness on bounded domains. We show that T21 and S22 can prove the well-foundedness on bounded domains of the ordinal notations below 0 and Γ0. As a corollary, the class of polynomial local search problems, PLS, can be augmented with cost functions that take ordinal values below 0 and Γ0 without increasing the class PLS.

This paper investigates provability and non-provability of well-foundedness of ordinal notations in weak theories of bounded arithmetic. We define a notion of well-foundedness on bounded domains. We show that T21 and S22 can prove the well-foundedness on bounded domains of the ordinal notations below 0 and Γ0. As a corollary, the class of polynomial local search problems, PLS, can be augmented with cost functions that take ordinal values below 0 and Γ0 without increasing the class PLS.

“To pose the problem of ‘scientific concepts’ is, immediately, to pose the problem of their power.”For many Anglophone readers, the interest of Isabelle Stengers’s now extensive writings will have been shaped—in part, at least—by a critical tradition of thinking that finds in the sociological and cultural study of science a welcome set of intellectual tools for denouncing the pretentions to a foundedness in scientific truth of socio-political domination. Informed by arguments about the instrumental qualities of scientific rationality, the social (...) and cultural construction of knowledge, and the links between intellectual practices and domination, this is a tradition of thinking which in many respects finds its raison... (shrink)